✦ LIBER ✦

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs

✍ Scribed by Festa, Paola

Book ID: 118252110
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 218 KB
Category: Article
ISBN: 364213193X
DOI: 10.1007/978-3-642-13193-6_21

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || A Metaheuristic for a Two Echelon Location-Routing Problem

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 248 KB

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || A Branch-and-Price Algorithm for Multi-mode Resource Leveling

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 227 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Combinatorial Optimization Volume 2241 || General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

✍ Jünger, Michael; Naddef, Denis 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 321 KB

[Lecture Notes in Computer Science] Tree

[Lecture Notes in Computer Science] Trees in Algebra and Programming — CAAP'94 Volume 787 || A new linear algorithm for Modular Decomposition

✍ Tison, Sophie 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 German ⚖ 978 KB

This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebra

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental and Efficient Algorithms Volume 3059 || Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems

✍ Ribeiro, Celso C.; Martins, Simone L. 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 230 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 1412 || Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

✍ Bixby, Robert E.; Boyd, E. Andrew; Ríos-Mercado, Roger Z. 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 211 KB