HAL (France)
open access
Approches exactes pour les problèmes d'optimisation combinatoire multi-objectifs
This thesis studies several exact approaches to compute the fullnon-dominated set, also called the Pareto optimal set, ofmulti-objective combinatorial optimization problems. We extend thesuccessful cutting plane based techniques for single-objective mixedinteger linear programs to multi-objective on
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Representing the Non-dominated Set of Multi-objective Optimization Problems with Polyhedral Ordering Cones#1297493
- Multi-objective optimisation applied to industrial energy problems#456707
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
- Large-Scale Portfolio Optimization Problem Under Cardinality Constraint With Enhanced Multi-Objective Evolutionary Algorithms#361491
- Bi-Criterion Optimization with Multi Colony Ant Algorithms#622735
Record · ID 1345875
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive