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
nondominated frontiercriterion space search methodquadrant shrinking methodtri-objective integer programs
Related Items (25)
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ An exact criterion space search method for a bi-objective nursing home location and allocation problem ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Planning efficient 4D trajectories in air traffic flow management. ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ 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
Cites Work
- Unnamed Item
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Finding all nondominated points of multi-objective integer programs
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- A discussion of scalarization techniques for multiple objective integer programming
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- Bicriteria Transportation Problem
- Benchmarking optimization software with performance profiles.
This page was built for publication: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs