An Evolutionary Metaheuristic for Approximating Preference-Nondominated Solutions

DOI10.1287/ijoc.1050.0170zbMath1241.90114OpenAlexW2140204382MaRDI QIDQ2892341

Selcen Phelps (Pamuk), Murat M. Köksalan

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/11511/65735

zbMATH Keywords

evolutionary heuristicmultiple criteria combinatorial optimization

Mathematics Subject Classification ID

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

Related Items (6)

Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ INTEGRATING PROMETHEEII WITH THE TCHEBYCHEFF FUNCTION FOR MULTI CRITERIA DECISION MAKING ⋮ Interactive evolutionary multi-objective optimization for quasi-concave preference functions ⋮ Multiobjective combinatorial optimization: some approaches ⋮ Domination Measure: A New Metric for Solving Multiobjective Optimization ⋮ Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria

This page was built for publication: An Evolutionary Metaheuristic for Approximating Preference-Nondominated Solutions