A cutting plane theory for mixed integer optimization
From MaRDI portal
Recommendations
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Polyhedral approaches to mixed integer linear programming
- Chvátal closures for mixed integer programming problems
Cited in
(15)- Cutting plane algorithms for the inverse mixed integer linear programming problem
- A cutting plane method for solving minimax problems in the complex plane
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- scientific article; zbMATH DE number 1538005 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Relaxations of mixed integer sets from lattice-free polyhedra
- Classical cuts for mixed-integer programming and branch-and-cut
- Relaxations of mixed integer sets from lattice-free polyhedra
- Complexity of optimizing over the integers
- An interior point cutting plane heuristic for mixed integer programming
- Testing cut generators for mixed-integer linear programming
This page was built for publication: A cutting plane theory for mixed integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096727)
