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 International Publishing

9783319592497, 9783319592503

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Two-Point Fano and Ideal Binary Clutters

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

10.1007/978-3-319-59250-3_1 ◽

2017 ◽

pp. 1-12

Author(s):

Ahmad Abdi ◽

Bertrand Guenin

Keyword(s):

Binary Clutters

Download Full-text

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem

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

10.1007/978-3-319-59250-3_15 ◽

2017 ◽

pp. 173-185 ◽

Cited By ~ 3

Author(s):

Szymon Dudycz ◽

Jan Marcinkowski ◽

Katarzyna Paluch ◽

Bartosz Rybicki

Keyword(s):

Approximation Algorithm ◽

Traveling Salesman Problem ◽

Traveling Salesman ◽

Maximum Traveling Salesman Problem

Download Full-text

On Scheduling Coflows

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

10.1007/978-3-319-59250-3_2 ◽

2017 ◽

pp. 13-24 ◽

Cited By ~ 8

Author(s):

Saba Ahmadi ◽

Samir Khuller ◽

Manish Purohit ◽

Sheng Yang

Download Full-text

Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector

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

10.1007/978-3-319-59250-3_21 ◽

2017 ◽

pp. 254-266 ◽

Cited By ~ 1

Author(s):

Rebecca Hoberg ◽

Harishchandra Ramadas ◽

Thomas Rothvoss ◽

Xin Yang

Download Full-text

Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

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

10.1007/978-3-319-59250-3_14 ◽

2017 ◽

pp. 161-172 ◽

Cited By ~ 9

Author(s):

Roberto Cominetti ◽

José Correa ◽

Neil Olver

Keyword(s):

Queuing Networks ◽

Long Term Behavior ◽

Dynamic Equilibria

Download Full-text

The Saleman’s Improved Tours for Fundamental Classes

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

10.1007/978-3-319-59250-3_10 ◽

2017 ◽

pp. 111-122 ◽

Cited By ~ 1

Author(s):

Sylvia Boyd ◽

András Sebő

Download Full-text

On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory–Johnson Infinite Group Problem

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

10.1007/978-3-319-59250-3_27 ◽

2017 ◽

pp. 330-342 ◽

Cited By ~ 5

Author(s):

Matthias Köppe ◽

Yuan Zhou

Keyword(s):

Infinite Group ◽

Group Problem ◽

Infinite Group Problem

Download Full-text

The Structure of the Infinite Models in Integer Programming

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

10.1007/978-3-319-59250-3_6 ◽

2017 ◽

pp. 63-74 ◽

Cited By ~ 5

Author(s):

Amitabh Basu ◽

Michele Conforti ◽

Marco Di Summa ◽

Joseph Paat

Keyword(s):

Integer Programming

Download Full-text

The Heterogeneous Capacitated k-Center Problem

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

10.1007/978-3-319-59250-3_11 ◽

2017 ◽

pp. 123-135 ◽

Cited By ~ 3

Author(s):

Deeparnab Chakrabarty ◽

Ravishankar Krishnaswamy ◽

Amit Kumar

Keyword(s):

Center Problem

Download Full-text

An Improved Deterministic Rescaling for Linear Programming Algorithms

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

10.1007/978-3-319-59250-3_22 ◽

2017 ◽

pp. 267-278 ◽

Cited By ~ 1

Author(s):

Rebecca Hoberg ◽

Thomas Rothvoss

Keyword(s):

Linear Programming ◽

Programming Algorithms

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

The Two-Point Fano and Ideal Binary Clutters

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem

On Scheduling Coflows

Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector

Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

The Saleman’s Improved Tours for Fundamental Classes

On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory–Johnson Infinite Group Problem

The Structure of the Infinite Models in Integer Programming

The Heterogeneous Capacitated k-Center Problem

An Improved Deterministic Rescaling for Linear Programming Algorithms

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