Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642366932, 9783642366949

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_6 ◽

2013 ◽

pp. 62-73 ◽

Cited By ~ 4

Author(s):

Amitabh Basu ◽

Robert Hildebrand ◽

Matthias Köppe

Keyword(s):

Infinite Group ◽

Dimensional Case ◽

Two Dimensional ◽

Group Problem ◽

Infinite Group Problem

Download Full-text

Matroid and Knapsack Center Problems

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_10 ◽

2013 ◽

pp. 110-122 ◽

Cited By ~ 2

Author(s):

Danny Z. Chen ◽

Jian Li ◽

Hongyu Liang ◽

Haitao Wang

Download Full-text

An Improved Integrality Gap for Asymmetric TSP Paths

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_16 ◽

2013 ◽

pp. 181-192 ◽

Cited By ~ 1

Author(s):

Zachary Friggstad ◽

Anupam Gupta ◽

Mohit Singh

Keyword(s):

Integrality Gap

Download Full-text

Blocking Optimal Arborescences

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_7 ◽

2013 ◽

pp. 74-85 ◽

Cited By ~ 1

Author(s):

Attila Bernáth ◽

Gyula Pap

Download Full-text

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_8 ◽

2013 ◽

pp. 86-97

Author(s):

Flavia Bonomo ◽

Gianpaolo Oriolo ◽

Claudia Snels ◽

Gautier Stauffer

Keyword(s):

Perfect Graphs

Download Full-text

Shallow-Light Steiner Arborescences with Vertex Delays

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_20 ◽

2013 ◽

pp. 229-241 ◽

Cited By ~ 9

Author(s):

Stephan Held ◽

Daniel Rotter

Download Full-text

On Some Generalizations of the Split Closure

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_13 ◽

2013 ◽

pp. 145-156

Author(s):

Sanjeeb Dash ◽

Oktay Günlük ◽

Diego Alejandro Morán Ramirez

Download Full-text

The Complexity of Scheduling for p-Norms of Flow and Stretch

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_24 ◽

2013 ◽

pp. 278-289 ◽

Cited By ~ 2

Author(s):

Benjamin Moseley ◽

Kirk Pruhs ◽

Cliff Stein

Download Full-text

0/1 Polytopes with Quadratic Chvátal Rank

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_30 ◽

2013 ◽

pp. 349-361 ◽

Cited By ~ 6

Author(s):

Thomas Rothvoß ◽

Laura Sanitá

Download Full-text

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36694-9_3 ◽

2013 ◽

pp. 25-36 ◽

Cited By ~ 6

Author(s):

Aris Anagnostopoulos ◽

Fabrizio Grandoni ◽

Stefano Leonardi ◽

Andreas Wiese

Keyword(s):

Integrality Gap ◽

Unsplittable Flow

Download Full-text

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case

Matroid and Knapsack Center Problems

An Improved Integrality Gap for Asymmetric TSP Paths

Blocking Optimal Arborescences

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property

Shallow-Light Steiner Arborescences with Vertex Delays

On Some Generalizations of the Split Closure

The Complexity of Scheduling for p-Norms of Flow and Stretch

0/1 Polytopes with Quadratic Chvátal Rank

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science
Latest Publications