Stronger formulations of mixed integer linear programs: an example
From MaRDI portal
Publication:4378103
DOI10.1080/0020739970280507zbMATH Open0894.90115OpenAlexW2001529231WikidataQ126249865 ScholiaQ126249865MaRDI QIDQ4378103FDOQ4378103
Authors: L. G. Proll
Publication date: 7 September 1998
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739970280507
Recommendations
- Strong formulations for mixed integer programming: A survey
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Formulation of integer linear programs: an example
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- scientific article; zbMATH DE number 1488341
- A geometric way to build strong mixed-integer programming formulations
- Strong formulations of robust mixed 0-1 programming
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Tight formulations for some simple mixed integer programs and convex objective integer programs
Cites Work
Cited In (7)
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- Mixed integer linear programming models for combinatorial optimization problems
- A mixed integer linear programming formulation of the maximum betweenness problem
- Mixed integer linear programming formulation techniques
- Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design
- A fuzzy genetic algorithm for driver scheduling
- Formulation of integer linear programs: an example
This page was built for publication: Stronger formulations of mixed integer linear programs: an example
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378103)