The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs

From MaRDI portal
Publication:1753507

DOI10.1016/j.ejor.2016.03.035zbMath1403.90593OpenAlexW2307869511MaRDI QIDQ1753507

Natashia Boland, Hadi Charkhgard, Savelsbergh, Martin W. P.

Publication date: 29 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.035




Related Items (25)

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problemsA branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approachBranch-and-Bound for Biobjective Mixed-Integer Linear ProgrammingA Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative ProgramsSplit algorithms for multiobjective integer programming problemsWarm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programsBranch-and-bound and objective branching with three or more objectivesA matheuristic for tri-objective binary integer linear programmingA criterion space decomposition approach to generalized tri-objective tactical resource allocationA criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approachAn exact criterion space search method for a bi-objective nursing home location and allocation problemOptimising makespan and energy consumption in task scheduling for parallel systemsAn exact criterion space search algorithm for a bi-objective blood collection problemSolving Multiobjective Mixed Integer Convex Optimization ProblemsA Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear ProgrammingA New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear ProgramsPlanning efficient 4D trajectories in air traffic flow management.Representing the nondominated set in multi-objective mixed-integer programsFinding a representative nondominated set for multi-objective mixed integer programsPreprocessing and cut generation techniques for multi-objective binary programmingAn exact parallel objective space decomposition algorithm for solving multi-objective integer programming problemsMulti-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programsBranching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programmingGoNDEF: 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 programming



Cites Work


This page was built for publication: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs