✦ LIBER ✦

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming – CP 2011 Volume 6876 || The Computational Complexity of Disconnected Cut and 2K 2-Partition

✍ Scribed by Lee, Jimmy

Book ID: 118016979
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 311 KB
Category: Article
ISBN: 364223786X
DOI: 10.1007/978-3-642-23786-7_43

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming – CP 2011 Volume 6876 || Grid-Based SAT Solving with Iterative Partitioning and Clause Learning

✍ Lee, Jimmy 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 665 KB

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming-CP97 Volume 1330 || Solving classes of set constraints with tree automata

✍ Smolka, Gert 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 961 KB

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming — CP98 Volume 1520 || Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

✍ Maher, Michael; Puget, Jean-Francois 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 265 KB

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming – CP 2010 Volume 6308 || Exact Cover via Satisfiability: An Empirical Study

✍ Cohen, David 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 259 KB

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming - CP 2002 Volume 2470 || Robust and Parallel Solving of a Network Design Problem

✍ Van Hentenryck, Pascal 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 189 KB

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming — CP 2001 Volume 2239 || iOpt: A Software Toolkit for Heuristic Search Methods

✍ Walsh, Toby 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 593 KB

Hybrid Benders Decomposition Algorithms In Constraint Logic Programming / Andrew Eremin And Mark Wallace -- Branch-and-check: A Hybrid Framework Integrating Mixed Integer Programming And Constraint Logic Programming / Erlendur S. Thorsteinsson -- Towards Inductive Constraint Solving / Slim Abdennadh