A simple, efficient and versatile objective space algorithm for multiobjective integer programming
From MaRDI portal
Publication:6616283
DOI10.1007/S00186-023-00841-0MaRDI QIDQ6616283
Kathrin Klamroth, Tino Fleuren, Kerstin Dächert
Publication date: 9 October 2024
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
multiobjective optimizationscalarizationlocal upper boundssearch regionnondominated setobjective space algorithms
Cites Work
- Title not available (Why is that?)
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- 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
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- Nonlinear multiobjective optimization
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Efficient computation of the search region in multi-objective optimization
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Representing the nondominated set in multi-objective mixed-integer programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming 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
- A discussion of scalarization techniques for multiple objective integer programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- Efficient Colored Orthogonal Range Counting
- Bicriteria Transportation Problem
- Monomial Tropical Cones for Multicriteria Optimization
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Multicriteria Optimization
Related Items (2)
Special issue on exact and approximation methods for mixed-integer multi-objective optimization ⋮ Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: A simple, efficient and versatile objective space algorithm for multiobjective integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616283)