Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
From MaRDI portal
Recommendations
- Approximating nondominated sets in continuous multiobjective optimization problems
- Multiobjective combinatorial optimization: some approaches
- scientific article; zbMATH DE number 3936958
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- scientific article; zbMATH DE number 1830716
- On approximate solutions in multiobjective optimization
- Approximate solutions to nonsmooth multiobjective programming problems
- Approximability and Hardness in Multi-objective Optimization
- On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- On spanning tree problems with multiple objectives
Cited in
(21)- Distribution based representative sets for multi-objective integer programs
- Multi-objective route planning of an unmanned air vehicle in continuous terrain: an exact and an approximation algorithm
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Finding a representative nondominated set for multi-objective mixed integer programs
- Finding all nondominated points of multi-objective integer programs
- Decision making on Pareto front approximations with inherent nondominance
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- An evolutionary approach to generalized biobjective traveling salesperson problem
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Biobjective UAV routing for a mission to visit multiple mobile targets
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- Representing the nondominated set in multi-objective mixed-integer programs
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
- Multiobjective combinatorial optimization: some approaches
- Estimating the number of basins of attraction of multi-objective combinatorial problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- A simple method for approximating a general Pareto surface
- Approximating nondominated sets in continuous multiobjective optimization problems
This page was built for publication: Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621927)
