A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
From MaRDI portal
Publication:2802241
DOI10.1287/ijoc.2015.0646zbMath1338.90364OpenAlexW2179308666MaRDI QIDQ2802241
Hadi Charkhgard, Natashia Boland, Savelsbergh, Martin W. P.
Publication date: 25 April 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2015.0646
Related Items (33)
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ 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 ⋮ A robust biobjective optimization approach for operating a shared energy storage under price uncertainty ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ Multi-objective branch and bound ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ 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 ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING ⋮ Bi-objective optimisation over a set of convex sub-problems
Cites Work
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Algebra of efficient sets for multiobjective complex systems
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- 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
- Bicriteria Transportation Problem
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
This page was built for publication: A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method