Anytime Pareto local search (Q319099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2014.10.062 / rank
Normal rank
 
Property / author
 
Property / author: Thomas Stützle / rank
Normal rank
 
Property / author
 
Property / author: Thomas Stützle / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C29 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6633424 / rank
 
Normal rank
Property / zbMATH Keywords
 
Pareto local search
Property / zbMATH Keywords: Pareto local search / rank
 
Normal rank
Property / zbMATH Keywords
 
anytime optimization
Property / zbMATH Keywords: anytime optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-objective optimization
Property / zbMATH Keywords: multi-objective optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling salesman problem
Property / zbMATH Keywords: traveling salesman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
quadratic assignment problem
Property / zbMATH Keywords: quadratic assignment problem / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scatter Search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMS-EMOA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064659014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMS-EMOA: multiobjective selection based on dominated hypervolume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the anytime behavior of two-phase local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto Local Search Algorithms for Anytime Bi-objective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic convergence of random search methods to fixed size Pareto front approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid population-based algorithms for the bi-objective quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically improving the anytime behaviour of optimisation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining VNS with constraint programming for solving anytime optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiobjective Traveling Salesman Problem: A Survey and a New Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase Pareto local search for the biobjective traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiobjective multidimensional knapsack problem: a survey and a new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local optima in multiobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of stochastic local search for the multiobjective traveling salesman problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2014.10.062 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:17, 9 December 2024

scientific article
Language Label Description Also known as
English
Anytime Pareto local search
scientific article

    Statements

    Anytime Pareto local search (English)
    0 references
    6 October 2016
    0 references
    Pareto local search
    0 references
    anytime optimization
    0 references
    multi-objective optimization
    0 references
    traveling salesman problem
    0 references
    quadratic assignment problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers