The \(L\)-shape search method for triobjective integer programming
From MaRDI portal
Publication:298165
DOI10.1007/s12532-015-0093-3zbMath1338.90366OpenAlexW2159436355MaRDI QIDQ298165
Natashia Boland, Hadi Charkhgard, Savelsbergh, Martin W. P.
Publication date: 20 June 2016
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-015-0093-3
Related Items
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ 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 ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ An exact method for solving the integer sum of linear ratios 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 ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ Scheduling EURO-k conferences ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ 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 ⋮ Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective
Uses Software
Cites Work
- Unnamed Item
- 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
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Survey of multi-objective optimization methods for engineering
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the bi-criterion integer programming problem
- Multiobjective programming and planning
- An algorithm for the multiple objective integer linear programming problem
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- 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
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria 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
- Finding representative systems for discrete bicriterion optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Geometric Duality in Multiple Objective Linear Programming
- Bicriteria Transportation Problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Benchmarking optimization software with performance profiles.
