Advancing local search approximations for multiobjective combinatorial optimization problems
DOI10.1007/S10878-021-00795-1zbMATH Open1490.90258OpenAlexW3194387831WikidataQ114225858 ScholiaQ114225858MaRDI QIDQ2125231FDOQ2125231
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
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
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Multicriteria Optimization
- Local branching
- Title not available (Why is that?)
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A survey of recent developments in multiobjective optimization
- Title not available (Why is that?)
- Genetic local search for multi-objective combinatorial optimization
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Variable neighborhood search and local branching
- Multi‐objective combinatorial optimization problems: A survey
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Approximating multiobjective knapsack problems
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Fundamentals of Computation Theory
- An approximation method for the efficiency set of multiobjective programming problems
- Covers and approximations in multiobjective optimization
- An algorithm for approximating the Pareto set of the multiobjective set covering problem
- On upper approximations of Pareto fronts
- A tolerance function for the multiobjective set covering problem
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- New perspectives on multi-objective knapsack problems
Cited In (3)
Uses Software
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)
