User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

The bi-objective pareto constraint

Primary tabs

Hartert, Renaud [UCL] Schaus, Pierre [UCL]

Multi-Objective Combinatorial Optimization (MOCO) problems are ubiquitous in real-world applications. Gavanelli proposed a complete constraint programming approach to find the exact set of optimal solutions – known as efficient solutions – of MOCO problems. This approach has recently been extended in a new global constraint called the Pareto constraint. In this paper, we bring some complementary information on the Pareto constraint. Particularly, we discuss its efficiency when applied on standard MOCO problems and present two ways of improving this efficiency when applied on bi-objective combinatorial optimization problems

Document type Communication à un colloque (Conference Paper) – Poster
Access type Accès restreint
Publication date 2013
Language Anglais
Conference "CP 2013 Doctoral Program"
Peer reviewed yes
Publication status Publié
Affiliation UCL - SST/ICTM/INGI - Pôle en ingénierie informatique
Keywords constraint programming ; multi-objective combinatorial optimization ; bi-objective combinatorial optimization ; global constraint ; 1162
Links
Bibliographic reference Hartert, Renaud ; Schaus, Pierre. The bi-objective pareto constraint.CP 2013 Doctoral Program
Permanent URL http://hdl.handle.net/2078.1/135573