On the representation of the search region in multi-objective optimization
From MaRDI portal
Publication:319674
DOI10.1016/j.ejor.2015.03.031zbMath1346.90739arXiv1502.06111OpenAlexW2087591761MaRDI QIDQ319674
Renaud Lacour, Kathrin Klamroth, Daniel Vanderpooten
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06111
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (34)
Planning sustainable routes: economic, environmental and welfare concerns ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ A multi-criteria approach for hospital capacity analysis ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ A box decomposition algorithm to compute the hypervolume indicator ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A decision space algorithm for multiobjective convex quadratic integer 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 ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Ordinal optimization through multi-objective reformulation ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Limit sets in global multiobjective optimization ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Monomial Tropical Cones for Multicriteria Optimization ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Efficient computation of the search region in multi-objective optimization ⋮ Multi-objective branch and bound ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Cites Work
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Bound sets for biobjective combinatorial optimization problems
- Dynamic fractional cascading
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the bi-criterion integer programming problem
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- 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
- Two phase algorithms for the bi-objective assignment problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- Efficient Colored Orthogonal Range Counting
- Adding range restriction capability to dynamic data structures
- On Finding the Maxima of a Set of Vectors
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the representation of the search region in multi-objective optimization
