Efficient computation of the search region in multi-objective optimization
From MaRDI portal
Publication:1753505
DOI10.1016/j.ejor.2016.05.029zbMath1403.90602OpenAlexW2407151459MaRDI QIDQ1753505
Renaud Lacour, Kerstin Dächert, Kathrin Klamroth, Daniel Vanderpooten
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.05.029
Related Items (27)
A box decomposition algorithm to compute the hypervolume indicator ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Computing representations using hypervolume scalarizations ⋮ Split algorithms for multiobjective integer programming problems ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs ⋮ Monomial Tropical Cones for Multicriteria Optimization ⋮ Face posets of tropical polyhedra and monomial ideals ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Linear programming-based directed local search for expensive multi-objective optimization problems: application to drinking water production plants ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ Efficient computation of expected hypervolume improvement using box decomposition algorithms ⋮ 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 ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Performance indicators in multiobjective optimization ⋮ 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 ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Uses Software
Cites Work
- Unnamed Item
- On the representation of the search region in multi-objective optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- 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
- An improved algorithm for solving biobjective integer programs
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Bringing Order to Special Cases of Klee’s Measure Problem
- 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
- Bicriteria Transportation Problem
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
This page was built for publication: Efficient computation of the search region in multi-objective optimization
