Implied integrality in mixed-integer optimization
From MaRDI portal
Cites work
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An Almost Linear-Time Algorithm for Graph Realization
- An Automatic Method of Solving Discrete Programming Problems
- Fiber polytopes
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Implementation of a unimodularity test
- Integer Programming
- L’algebre de Boole et ses applications en recherche operationnelle
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- On recognizing integer polyhedra
- On the existence of optimal solutions to integer and mixed-integer programming problems
- On the facial structure of scheduling polyhedra
- Parallelizing the dual revised simplex method
- Presolve Reductions in Mixed Integer Programming
- Rational and integral \(k\)-regular matrices.
- The complexity of recognizing linear systems with certain integrality properties
- The fixed charge problem
- The integrality number of an integer program
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
This page was built for publication: Implied integrality in mixed-integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880113)
