On the Separation of Maximally Violated mod-k Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Chvátal Rank of Certain Inequalities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Fences Are Futile: On Relaxations for the Linear Ordering Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
INFORMS Journal on Computing
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Algorithms to separate {0, 1/2}-chvátal-gomory cuts
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the $p$-Median Polytope and the Intersection Property: Polyhedra and Algorithms
SIAM Journal on Discrete Mathematics
The chvátal-gomory closure of an ellipsoid is a polyhedron
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Optimization with binet matrices
Operations Research Letters
Stable sets, corner polyhedra and the Chvátal closure
Operations Research Letters
Metric inequalities and the Network Loading Problem
Discrete Optimization
On cycles and the stable multi-set polytope
Discrete Optimization
Chvatal-Gomory-tier cuts for general integer programs
Discrete Optimization
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
Totally tight Chvátal-Gomory cuts
Operations Research Letters
| Hi-index | 0.00 |