Formulating a Mixed Integer Programming Problem to Improve Solvability

DOI10.1287/OPRE.41.6.1013MaRDI QIDQ4285160zbMATH OpenOpenAlexFDO

Authors Cynthia Barnhart, G. L. Nemhauser, Gabriele C. Sigismondi, Pamela H. Vance, Ellis L. Johnson

Publication date 13 March 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.41.6.1013

zbMATH Keywords

real-world distribution problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)

Recommendations

• Mixed integer linear programming formulation techniques
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• scientific article; zbMATH DE number 2196290
• Stronger formulations of mixed integer linear programs: an example
• Formulations and Reformulations in Integer Programming

Cited in

(9)

• Decomposition, reformulation, and diving in university course timetabling
• A sequential linear programming approach to solve mixed integer programming problems
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• Evolution and state-of-the-art in integer programming
• Optimization models for forest road upgrade planning
• Exploiting Solving Phases for Mixed-Integer Programs
• Influence maximization with latency requirements on social networks
• Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain
• Weighted target set selection on trees and cycles

This page was built for publication: Formulating a Mixed Integer Programming Problem to Improve Solvability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285160)