Combining local search and elicitation for multi-objective combinatorial optimization
From MaRDI portal
Publication:2290362
DOI10.1007/978-3-030-31489-7_1zbMath1431.91132OpenAlexW2961478348MaRDI QIDQ2290362
Cassandre Leroy, Thibaut Lust, Nawal Benabbou, Patrice Perny
Publication date: 27 January 2020
Full work available at URL: https://hal.sorbonne-universite.fr/hal-02170910/file/ADT.pdf
local searchminimax regrettraveling salesman problemmulti-objective combinatorial optimizationpreference elicitation
Related Items (1)
Cites Work
- Unnamed Item
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Generating random vectors uniformly distributed inside and on the surface of different regions
- On spanning tree problems with multiple objectives
- Weighted sum model with partial preference information: application to multi-objective optimization
- On solving linear programs with the ordered weighted averaging objective.
- Approximation algorithms for the traveling salesman problem
- Learning monotone nonlinear models using the Choquet integral
- Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Theory of capacities
- LP Solvable Models for Multiagent Fair Allocation problems
- Preference Learning: An Introduction
- On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
- A Method for Solving Traveling-Salesman Problems
- A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid
This page was built for publication: Combining local search and elicitation for multi-objective combinatorial optimization
