Cut-and-solve: An iterative search strategy for combinatorial optimization problems

Sharlee Climer, Weixiong Zhang

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)714-738
Number of pages25
JournalArtificial Intelligence
Volume170
Issue number8-9
DOIs
StatePublished - Jun 2006
Externally publishedYes

ASJC Scopus Subject Areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Keywords

  • Anytime algorithms
  • Branch-and-bound
  • Branch-and-cut
  • Linear programming
  • Search strategies
  • Traveling Salesman Problem

Cite this