On local optima in multiobjective combinatorial optimization problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 26845 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1975100 (Why is no real title available?)
- scientific article; zbMATH DE number 2102226 (Why is no real title available?)
- scientific article; zbMATH DE number 2102230 (Why is no real title available?)
- scientific article; zbMATH DE number 2102231 (Why is no real title available?)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Approximating multiobjective knapsack problems
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Multicriteria optimization
- On Finding the Maxima of a Set of Vectors
- On bicriterion minimal spanning trees: An approximation
- On cardinality of the set of alternatives in discrete many-criterion problems
- On spanning tree problems with multiple objectives
- Stochastic local search. Foundations and applications.
- Variable Neighborhood Search
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
Cited in
(23)- On a particular case of the multi-criteria unconstrained optimization problem
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Bi‐objective green vehicle routing problem
- Combining local search and elicitation for multi-objective combinatorial optimization
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Many-objective Pareto local search
- scientific article; zbMATH DE number 5003796 (Why is no real title available?)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Genetic local search for multi-objective combinatorial optimization
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Anytime Pareto local search
- Multi-directional local search
- Stochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis
- Evolutionary Multi-Criterion Optimization
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization
- Greedy algorithms for a class of knapsack problems with binary weights
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- scientific article; zbMATH DE number 1784661 (Why is no real title available?)
- Estimating the number of basins of attraction of multi-objective combinatorial problems
- \(\varPhi\)-strict local efficient solution for multiobjective programming problems
- A local multiobjective optimization algorithm using neighborhood field
This page was built for publication: On local optima in multiobjective combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468765)
