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 problemsAn adaptive patch approximation algorithm for bicriteria convex mixed-integer problemsThe bi-objective mixed capacitated general routing problem with different route balance criteriaBi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storageILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network designAn exact algorithm for biobjective mixed integer linear programming problemsA Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative ProgramsAn \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problemsA robust biobjective optimization approach for operating a shared energy storage under price uncertaintyA criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approachBi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical testsTwenty years of continuous multiobjective optimization in the twenty-first centuryComparing solution paths of sparse quadratic minimization with a Stieltjes matrixAn exact criterion space search algorithm for a bi-objective blood collection problemA bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal deathSolving Multiobjective Mixed Integer Convex Optimization ProblemsA Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear ProgrammingBranch-and-Bound for Bi-objective Integer ProgrammingA New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear ProgramsA Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line MethodFiltering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice ConstraintA multiobjective hub-airport location problem for an airline network designFathoming rules for biobjective mixed integer linear programs: review and extensionsMulti-objective branch and boundA branch-and-bound based heuristic algorithm for convex multi-objective MINLPsA one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problemsThe search-and-remove algorithm for biobjective mixed-integer linear programming problemsMulti-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programsEquidistant representations: connecting coverage and uniformity in discrete biobjective optimizationGoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programsFPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programmingA NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMINGBi-objective optimisation over a set of convex sub-problems



Cites Work


This page was built for publication: A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method