A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
From MaRDI portal
(Redirected from Publication:5139845)
Recommendations
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- An exact algorithm for biobjective mixed integer linear programming problems
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- A fast and robust algorithm for solving biobjective mixed integer programs
Cites work
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An exact algorithm for biobjective mixed integer linear programming problems
- Bicriteria Transportation Problem
- Efficiently computing succinct trade-off curves
- Multi-objective optimization using evolutionary algorithms
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multicriteria Optimization
- Multiobjective programming and planning
- Multiple criteria facility location problems: a survey
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
Cited in
(15)- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- 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
- Solving multiobjective mixed integer convex optimization 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
- A fast and robust algorithm for solving biobjective mixed integer programs
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- A test instance generator for multiobjective mixed-integer optimization
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- On the strength of Lagrangian duality in multiobjective integer programming
This page was built for publication: A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139845)
