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

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540221135, 9783540259602

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Metric Inequalities and the Network Loading Problem

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

10.1007/978-3-540-25960-2_2 ◽

2004 ◽

pp. 16-32 ◽

Author(s):

Pasquale Avella ◽

Sara Mattia ◽

Antonio Sassano

Keyword(s):

Network Loading ◽

Loading Problem

Download Full-text

Optimizing over Semimetric Polytopes

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

10.1007/978-3-540-25960-2_32 ◽

2004 ◽

pp. 431-443 ◽

Author(s):

Antonio Frangioni ◽

Andrea Lodi ◽

Giovanni Rinaldi

Download Full-text

Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem

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

10.1007/978-3-540-25960-2_5 ◽

2004 ◽

pp. 59-73 ◽

Author(s):

José R. Correa ◽

Andreas S. Schulz ◽

Nicolás E. Stier Moses

Keyword(s):

Computational Complexity ◽

Price Of Anarchy

Download Full-text

LP-based Approximation Algorithms for Capacitated Facility Location

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

10.1007/978-3-540-25960-2_16 ◽

2004 ◽

pp. 206-218 ◽

Author(s):

Retsef Levi ◽

David B. Shmoys ◽

Chaitanya Swamy

Keyword(s):

Approximation Algorithms ◽

Facility Location ◽

Capacitated Facility Location

Download Full-text

Separable Concave Optimization Approximately Equals Piecewise Linear Optimization

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

10.1007/978-3-540-25960-2_18 ◽

2004 ◽

pp. 234-243 ◽

Author(s):

Thomas L. Magnanti ◽

Dan Stratila

Keyword(s):

Piecewise Linear ◽

Linear Optimization

Download Full-text

All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables

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

10.1007/978-3-540-25960-2_26 ◽

2004 ◽

pp. 338-351 ◽

Author(s):

Jesus De Loera ◽

Shmuel Onn

Keyword(s):

Contingency Tables ◽

Transportation Polytopes

Download Full-text

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems

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

10.1007/978-3-540-25960-2_12 ◽

2004 ◽

pp. 152-162 ◽

Author(s):

E. Boros ◽

K. Elbassioni ◽

V. Gurvich ◽

L. Khachiyan

Keyword(s):

Geometric Problems ◽

Strongly Connected ◽

Connected Subgraphs

Download Full-text

Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games

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

10.1007/978-3-540-25960-2_6 ◽

2004 ◽

pp. 74-85 ◽

Author(s):

Dmitrii Lozovanu

Keyword(s):

Polynomial Time ◽

Optimal Strategies ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Download Full-text

Minsquare Factors and Maxfix Covers of Graphs

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

10.1007/978-3-540-25960-2_29 ◽

2004 ◽

pp. 388-400

Author(s):

Nicola Apollonio ◽

András Sebő

Download Full-text

A Capacity Scaling Algorithm for M-convex Submodular Flow

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

10.1007/978-3-540-25960-2_27 ◽

2004 ◽

pp. 352-367

Author(s):

Satoru Iwata ◽

Satoko Moriguchi ◽

Kazuo Murota

Keyword(s):

Capacity Scaling ◽

Submodular Flow

Download Full-text