✦ LIBER ✦

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 2337 || A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling

✍ Scribed by Cook, William J.; Schulz, Andreas S.

Book ID: 120518946
Publisher: Springer Berlin Heidelberg
Year: 2002
Weight: 164 KB
Category: Article
ISBN: 3540478671
DOI: 10.1007/3-540-47867-1_22

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2223 || A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling

✍ Eades, Peter; Takaoka, Tadao 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 179 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 2337 || An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

✍ Cook, William J.; Schulz, Andreas S. 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 217 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

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 1412 || New Classes of Lower Bounds for Bin Packing Problems

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

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 7801 || A Complexity and Approximability Study of the Bilevel Knapsack Problem

✍ Goemans, Michel; Correa, José 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 208 KB

[Lecture Notes in Computer Science] Evol

[Lecture Notes in Computer Science] Evolutionary Computation in Combinatorial Optimization Volume 6622 || A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem

✍ Merz, Peter; Hao, Jin-Kao 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 160 KB

This Book Constitutes The Refereed Proceedings Of The 11th European Conference On Evolutionary Computation In Combinatorial Optimization, Evocop 2011, Held In Torino, Italy, In April 2011. The 22 Revised Full Papers Presented Were Carefully Reviewed And Selected From 42 Submissions. The Papers Prese