Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design

DOI10.1016/S0377-2217(00)00134-XzbMath0985.90067OpenAlexW1996285090MaRDI QIDQ5946532

Walter A. H. Rossing, Eligius M. T. Hendrix, Martin K. van Ittersum, David Makowski

Publication date: 14 October 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00134-x

zbMATH Keywords

branch-and-boundmixed integer linear programmingagriculturenearly optimal solution

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Case-oriented studies in operations research (90B90)

Cites Work

• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design