A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
From MaRDI portal
Publication:5139845
DOI10.1287/ijoc.2019.0887OpenAlexW2964996841WikidataQ127399512 ScholiaQ127399512MaRDI QIDQ5139845
Tyler Perini, Savelsbergh, Martin W. P., Diego Pecin, Natashia Boland
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ada05e26e9c9582d95886dc6a4ef1fab6eb28fbe
Related Items (8)
An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems
Cites Work
- Unnamed Item
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An exact algorithm for biobjective mixed integer linear programming problems
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multiple criteria facility location problems: a survey
- Multiobjective programming and planning
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Efficiently computing succinct trade-off curves
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Bicriteria Transportation Problem
- Multicriteria Optimization
This page was built for publication: A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
