An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information
From MaRDI portal
Publication:3297811
DOI10.1007/978-3-030-35514-2_17zbMath1447.90046OpenAlexW2992544775MaRDI QIDQ3297811
Publication date: 20 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.sorbonne-universite.fr/hal-02308626/file/SUM2019%20%281%29.pdf
minimax regrettraveling salesman problemminimum spanning tree problemmulti-objective combinatorial optimizationincremental preference elicitation
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Choquet optimal set in biobjective combinatorial optimization
- 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
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- 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
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- Reducing the Number of Queries in Interactive Value Iteration
- On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems
- An algorithm for determining all extreme points of a convex polytope
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
- A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid
This page was built for publication: An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information
