Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
 
conference paper

Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems

Eisenberg, Carlos
•
Faltings, Boi  
2003
Principles and Practice of Constraint Programming – CP 2003
9th International Conference on Principles and Practice of Constraint Programming (CP-2003)
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-540-45193-8_60
Author(s)
Eisenberg, Carlos
Faltings, Boi  
Date Issued

2003

Published in
Principles and Practice of Constraint Programming – CP 2003
Series title/Series vol.

Lecture Notes in Computer Science; 2833

Start page

822

End page

826

Written at

EPFL

EPFL units
LIA  
Event name
9th International Conference on Principles and Practice of Constraint Programming (CP-2003)
Available on Infoscience
December 13, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/238372
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés