Advancing local search approximations for multiobjective combinatorial optimization problems

DOI10.1007/S10878-021-00795-1MaRDI QIDQ2125231zbMATH OpenOpenAlexWikidataFDO

Authors Lakmali Weerasena

Publication date 13 April 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-021-00795-1

zbMATH Keywords

combinatorial optimizationapproximation algorithmlocal searchtolerance function\(t\)-representation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Covers and approximations in multiobjective optimization
• An algorithm for approximating the Pareto set of the multiobjective set covering problem
• Multi-directional local search
• Efficient approximation algorithms for multi-objective constraint optimization
• Dynamic algorithm selection for Pareto optimal set approximation

Cites work

• scientific article; zbMATH DE number 3662118 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A survey of recent developments in multiobjective optimization
• A tolerance function for the multiobjective set covering problem
• An algorithm for approximating the Pareto set of the multiobjective set covering problem
• An approximation method for the efficiency set of multiobjective programming problems
• Approximating multiobjective knapsack problems
• Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
• Covers and approximations in multiobjective optimization
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
• Exact generation of epsilon-efficient solutions in multiple objective programming
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Fundamentals of Computation Theory
• Genetic local search for multi-objective combinatorial optimization
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
• Local branching
• Multicriteria Optimization
• Multi‐objective combinatorial optimization problems: A survey
• New perspectives on multi-objective knapsack problems
• On upper approximations of Pareto fronts
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Variable neighborhood search and local branching
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function

Cited in

(3)

• scientific article; zbMATH DE number 1961998 (Why is no real title available?)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Covers and approximations in multiobjective optimization

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Advancing local search approximations for multiobjective combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125231)