Theory of linear and integer programming
Theory of linear and integer programming
On polynomial solvability of the high multiplicity total weighted tardiness problem
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cutting planes and the complexity of the integer hull
Cutting planes and the complexity of the integer hull
Point containment in the integer hull of a polyhedron
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hi-index | 0.00 |