Compact extended linear programming models

DOI10.1007/978-3-319-63976-5zbMath1390.90004OpenAlexW2751668451MaRDI QIDQ1693865

Giuseppe Lancia, Paolo Serafini

Publication date: 31 January 2018

Published in: EURO Advanced Tutorials on Operational Research (Search for Journal in Brave)

Full work available at URL: http://www.springer.com/gp/book/9783319639758

zbMATH Keywords

column generationtraveling salesman problemscheduling problemscomputational biologypacking problemscompact extended formulationsinteger linear optimization problemslinear optimization problems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (4)

Weighted network search games with multiple hidden objects and multiple search teams ⋮ Polyhedral results for position-based scheduling of chains on a single machine ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ A new integer programming formulation of the graphical traveling salesman problem

Uses Software

• SCIP
• CPLEX
• Gurobi
• GLPK
• COIN-OR
• Concorde
• XPRESS
• LINGO
• OEIS

Cites Work

• CPLEX

This page was built for publication: Compact extended linear programming models