Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems

DOI10.1002/nav.20336zbMath1158.90402OpenAlexW2099947283MaRDI QIDQ3621927

Banu Lokman, Murat M. Köksalan

Publication date: 22 April 2009

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20336

zbMATH Keywords

multi-objective combinatorial optimizationsurface fittingnondominated vectors

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (14)

Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ An evolutionary approach to generalized biobjective traveling salesperson problem ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Biobjective UAV routing for a mission to visit multiple mobile targets ⋮ A simple method for approximating a general Pareto surface ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Multiobjective combinatorial optimization: some approaches ⋮ A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Cites Work

• Unnamed Item
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• On spanning tree problems with multiple objectives
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making

This page was built for publication: Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems