| Article ID: | iaor20072057 |
| Country: | Germany |
| Volume: | 147 |
| Issue: | 1 |
| Start Page Number: | 143 |
| End Page Number: | 174 |
| Publication Date: | Oct 2006 |
| Journal: | Annals of Operations Research |
| Authors: | Grabisch M., Hud F. Le, Labreuche C., Savant P. |
| Keywords: | programming: multiple criteria |
In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search.