The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper presents the approach that we developed to
solve the ROADEF 2003 challenge problem. This work is part of a research
program whose aim is to study the benefits and the computer-aided generation
of hybrid solutions that mix constraint programming and meta-heuristics,
such as large neighborhood search (LNS). This paper focuses on three
contributions that were obtained during this project: an improved method for
propagating Hamiltonian chain constraints, a fresh look at limited
discrepancy...
Download Results (CSV)