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

&
Artificial Intelligence 170 (8-9):714-738 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2006.02.005

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks.Weixiong Zhang, Guandong Wang, Zhao Xing & Lars Wittenburg - 2005 - Artificial Intelligence 161 (1-2):55-87.
Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions.Baharak Rastegari, Anne Condon & Kevin Leyton-Brown - 2011 - Artificial Intelligence 175 (2):441-456.
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.
Optimization Methods for Logical Inference.Vijay Chandru & John Hooker - 1999 - University of Texas Press.
Refinements to depth-first iterative-deepening search in automatic theorem proving.Xumin Nie & David A. Plaisted - 1989 - Artificial Intelligence 41 (2):223-235.
Explorative anytime local search for distributed constraint optimization.Roie Zivan, Steven Okamoto & Hilla Peled - 2014 - Artificial Intelligence 212 (C):1-26.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,422,077)

6 months
3 (#1,475,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
A complete anytime algorithm for number partitioning.Richard E. Korf - 1998 - Artificial Intelligence 106 (2):181-203.

Add more references