Similar Search Results

Light on the infinite group relaxation I : foundations and taxonomy

Basu, Amitabh; Hildebrand, Robert; Köppe, Matthias - In: 4OR : a quarterly journal of operations research 14 (2016) 1, pp. 1-40

Persistent link: https://www.econbiz.de/10011698214

Light on the infinite group relaxation II : sufficient conditions for extremality, sequences, and algorithms

Basu, Amitabh; Hildebrand, Robert; Köppe, Matthias - In: 4OR : a quarterly journal of operations research 14 (2016) 2, pp. 107-131

Persistent link: https://www.econbiz.de/10011698256

Unique minimal liftings for simplicial polytopes

Basu, Amitabh; Cornuéjols, Gérard; Köppe, Matthias - In: Mathematics of operations research 37 (2012) 2, pp. 346-355

Persistent link: https://www.econbiz.de/10009562363

Minimizing cubic and homogeneous polynomials over integers in the plane

Del Pia, Alberto; Hildebrand, Robert; Weismantel, Robert; … - In: Mathematics of operations research 41 (2016) 2, pp. 511-530

Persistent link: https://www.econbiz.de/10011520471

Note on the complexity of the mixed-integer hull of a polyhedron

Hildebrand, Robert; Oertel, Timm; Weismantel, Robert - In: Operations research letters 43 (2015) 3, pp. 279-282

Persistent link: https://www.econbiz.de/10011309547

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I

Beach, Benjamin; Burlacu, Robert; Bärmann, Andreas; … - In: Computational Optimization and Applications 87 (2024) 3, pp. 835-891

We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP relaxation methods for non-convex continuous variable products. In this paper, we consider MIP relaxations based on...

Persistent link: https://www.econbiz.de/10015361670

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part II

Beach, Benjamin; Burlacu, Robert; Bärmann, Andreas; … - In: Computational Optimization and Applications 87 (2024) 3, pp. 893-934

This is Part II of a study on mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We set the focus on MIP relaxation methods for non-convex continuous variable products where both variables are...

Persistent link: https://www.econbiz.de/10015361673

Pareto optima of multicriteria integer linear programs

De Loera, Jesús A.; Hemmecke, Raymond; Köppe, Matthias - In: INFORMS journal on computing : JOC 21 (2009) 1, pp. 39-48

Persistent link: https://www.econbiz.de/10003896630

Rational generating functions and integer programming games

Köppe, Matthias; Ryan, Christopher Thomas; Queyranne, … - In: Operations research 59 (2011) 6, pp. 1445-1460

Persistent link: https://www.econbiz.de/10009487159

An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem

Köppe, Matthias; Zhou, Yuan - In: Operations research letters 43 (2015) 4, pp. 438-444

Persistent link: https://www.econbiz.de/10011372395