A counterexample to an integer analogue of Caratheodory’s theorem. W. Bruns, J . Gubeladze, S. Dash, , Mathematical Programming , ( ). K. Andersen, Q. Louveaux, R. Weismantel, L. A. Wolsey, IPCO We do not consider mixed integer programs, i.e. linear programs with Most of the theory of linear and integer programming can be extended to. References & Software Packages. References. • L. A. Wolsey. Integer Programming, John Wiley & Sons,. New York, (). • G. L. Nemhauser and L. A. Wolsey.
|Published (Last):||12 June 2009|
|PDF File Size:||18.24 Mb|
|ePub File Size:||1.54 Mb|
|Price:||Free* [*Free Regsitration Required]|
The first three days of the Bellairs IP Workshop will be focused on specific research areas. Please find below links to papers containing background material on the topics. The complexity of recognizing linear systems with certain integrality properties G.
Zang, preprint, to appear in Mathematical Programming. A counterexample to an integer analogue of Caratheodory’s theorem W. Weismantel, preprint, appeared in Journal of Pure and Applied Mathematics, Hilbert Basis, Caratheodory’s theorem and combinatorial optimization A. An Integer analogue of Caratheodory’s theorem W. Valid inequalities based on the interpolation procedure S. Gunluk, Mathematical Programming On the strength of Gomory mixed-integer cuts as group cuts S.
Gunluk, Mathematical Programming, to appear. l.a.wolsry
Mixed-integer cuts from cyclic groups M. Saturni, Mathematical Programming On a generalization of the master cyclic group polyhedron S.
Integer Programming | Discrete Mathematics | Mathematics & Statistics | Subjects | Wiley
New inequalities for finite and infinite group problems from approximate lifting L. Some relations between facets of low- and high-dimensional group problems S. Inequalities from prograkming rows of a simplex tableau. On the facets of mixed integer programs with two integer variables and two constraints G.
Margot, to appear in Mathematical Programming. Minimal inequalities for integer constraints V. Lifting integer variables in minimal inequalities corresponding to lattice-free triangles S. Computing with multi-row Gomory cuts D.
Bellairs IP Workshop — Reading Material
How tight is the corner relaxation? The mixing set with flows M. Tight formulations for some simple mixed integer programs and prrogramming objective integer programs A.
Lodi, slides of talk given at Aussios Can pure cutting plane algorithms work? L.a.woosey infeasible subsystems and Benders cuts M. On the separation of disjunctive cuts M.