Pareto Local Search Algorithms for Anytime Bi-objective Optimization
From MaRDI portal
Publication:3164923
DOI10.1007/978-3-642-29124-1_18zbMath1292.90267OpenAlexW1555828828MaRDI QIDQ3164923
Thomas Stützle, Manuel López-Ibáñez, Jérémie Dubois-Lacoste
Publication date: 18 October 2012
Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/139579/1/DubLopStu2012evocop.pdf
Multi-objective and goal programming (90C29) Search theory (90B40) Combinatorial optimization (90C27)
Related Items (3)
Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ Anytime Pareto local search ⋮ Multi- and many-objective path-relinking: a taxonomy and decomposition approach
This page was built for publication: Pareto Local Search Algorithms for Anytime Bi-objective Optimization
