Y. Caseau and F. Laburthe. Heuristics for large constrained routing problems, Journal of Heuristics, 5:281--303, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Heuristic Constraint Propagation Using Local Search for.. - Sellmann (2002) (Correct)
....the integration of constraint programming (CP) and local search (LS) have been developed. The main problem when constructing CP LS hybrids is caused by the fact that CP uses monotonic reasoning whereas LS does not. Fairly balanced hybrids result from sequential applications of the two methods [2, 11]. Other balanced hybrids can also be achieved by applying decomposition methods (like Lagrangian relaxation, column generation or Benders decomposition) where sub and master problem can be solved by di erent solution methods. But there also exist many developments that favor one of the methods ....
Y. Caseau and F. Laburthe. Heuristics for large constrained routing problems, Journal of Heuristics, 5:281303, 1999.
An Arc-Consistency Algorithm for the - Minimum Weight All (Correct)
No context found.
Y. Caseau and F. Laburthe. Heuristics for large constrained routing problems, Journal of Heuristics, 5:281--303, 1999.
Proceedings CPAIOR'02 - Heuristic Constraint Propagation (Correct)
No context found.
Y. Caseau and F. Laburthe. Heuristics for large constrained routing problems, Journal of Heuristics, 5:281303, 1999.
An Arc-Consistency Algorithm for the - Minimum Weight All (2002) (Correct)
No context found.
Y. Caseau and F. Laburthe. Heuristics for large constrained routing problems, Journal of Heuristics, 5:281--303, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC