Constraint Programming and Local Search Hybrids

Paul Shaw ()
Additional contact information
Paul Shaw: IBM

A chapter in Hybrid Optimization, 2011, pp 271-303 from Springer

Abstract: Abstract Constraint programming and local search are two different optimization paradigms which, over the last two decades or so, have been successfully combined to form hybrid optimization techniques. This chapter describes and compares a number of these works, with the goal of giving a clear picture of research in this domain.We close with some open topics for the future.

Keywords: Local Search; Search Tree; Travel Salesman Problem; Constraint Programming; Local Search Method (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-1644-0_8

Ordering information: This item can be ordered from
http://www.springer.com/9781441916440

DOI: 10.1007/978-1-4419-1644-0_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().