An oracle-polynomial time augmentation algorithm for integer programming
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
0/1 optimization and 0/1 primal separation are equivalent
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research
Non-standard approaches to integer programming
Discrete Applied Mathematics
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
Journal of Global Optimization
Algorithmic characterization of bipartite b-matching and matroid intersection
Combinatorial optimization - Eureka, you shrink!
An augment-and-branch-and-cut framework for mixed 0-1 programming
Combinatorial optimization - Eureka, you shrink!
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-Directions of Standard Polyhedra with Applications to Network Flows
Journal of Global Optimization
Monotone Covering Problems with an Additional Covering Constraint
Mathematics of Operations Research
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Integer Programming: Optimization and Evaluation Are Equivalent
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A primal branch-and-cut algorithm for the degree-constrained minimum spanning tree problem
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
| Hi-index | 0.00 |