𝔖 Bobbio Scriptorium

✦ LIBER ✦

[Lecture Notes in Computer Science] Integer Programming and Combinatoral Optimization Volume 6655 || Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack

✍ Scribed by Günlük, Oktay; Woeginger, Gerhard J.

Book ID: 120566900
Publisher: Springer Berlin Heidelberg
Year: 2011
Tongue: German
Weight: 239 KB
Category: Article
ISBN: 364220807X
DOI: 10.1007/978-3-642-20807-2_24

No coin nor oath required. For personal study only.

✦ Synopsis

This Book Constitutes The Proceedings Of The 15th International Conference On Integer Programming And Combinatorial Optimization, Ipco 2011, Held In New York, Usa In June 2011. The 33 Papers Presented Were Carefully Reviewed And Selected From 110 Submissions. The Conference Is A Forum For Researchers And Practitioners Working On Various Aspects Of Integer Programming And Combinatorial Optimization With The Aim To Present Recent Developments In Theory, Computation, And Applications. The Scope Of Ipco Is Viewed In A Broad Sense, To Include Algorithmic And Structural Results In Integer Programming And Combinatorial Optimization As Well As Revealing Computational Studies And Novel Applications Of Discrete Optimization To Practical Problems.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 1084 || Quadratic knapsack relaxations using cutting planes and semidefinite programming

✍ Cunningham, William H.; McCormick, S. Thomas; Queyranne, Maurice 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 776 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 4513 || An Integer Programming Approach for Linear Programs with Probabilistic Constraints

✍ Fischetti, Matteo; Williamson, David P. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 386 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] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 2081 || Synthesis of 2-Commodity Flow Networks

✍ Aardal, Karen; Gerards, Bert 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 130 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Volume 5547 || Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations

✍ van Hoeve, Willem-Jan; Hooker, John N. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 59 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 6080 || The Price of Collusion in Series-Parallel Networks

✍ Eisenbrand, Friedrich; Shepherd, F. Bruce 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 246 KB

Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the Universit