The Hirsch conjecture is true for (0,1)-polytopes
Mathematical Programming: Series A and B
0/1-Integer Programming: Optimization and Augmentation are Equivalent
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Basis of solutions for a system of linear inequalities in integers: computation and applications
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A polynomial-time algorithm for optimizing over N-flod 4-block decomposable integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |