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

9783540645900, 9783540693468

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved Approximation Algorithms for Uncapacitated Facility Location

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

10.1007/3-540-69346-7_14 ◽

1998 ◽

pp. 180-194 ◽

Cited By ~ 51

Author(s):

Fabián A. Chudak

Keyword(s):

Approximation Algorithms ◽

Facility Location

Download Full-text

A New Bound for the 2-Edge Connected Subgraph Problem

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

10.1007/3-540-69346-7_9 ◽

1998 ◽

pp. 112-125 ◽

Cited By ~ 9

Author(s):

Robert Carr ◽

R. Ravi

Keyword(s):

Connected Subgraph

Download Full-text

Solving Integer and Disjunctive Programs by Lift and Project

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

10.1007/3-540-69346-7_21 ◽

1998 ◽

pp. 271-283 ◽

Cited By ~ 6

Author(s):

Sebastián Ceria ◽

Gábor Pataki

Keyword(s):

Disjunctive Programs

Download Full-text

On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems

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

10.1007/3-540-69346-7_30 ◽

1998 ◽

pp. 394-408 ◽

Cited By ~ 8

Author(s):

R. N. Uma ◽

Joel Wein

Keyword(s):

Np Hard ◽

Scheduling Problems ◽

The Relationship

Download Full-text

Consecutive Ones and a Betweenness Problem in Computational Biology

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

10.1007/3-540-69346-7_17 ◽

1998 ◽

pp. 213-228 ◽

Cited By ~ 13

Author(s):

Thomas Christof ◽

Marcus Oswald ◽

Gerhard Reinelt

Keyword(s):

Computational Biology

Download Full-text

Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time

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

10.1007/3-540-69346-7_23 ◽

1998 ◽

pp. 294-309 ◽

Cited By ~ 2

Author(s):

Lisa Fleischer

Keyword(s):

Minimum Cuts ◽

Run Time

Download Full-text

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables

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

10.1007/3-540-69346-7_18 ◽

1998 ◽

pp. 229-242 ◽

Cited By ~ 6

Author(s):

Karen Aardal ◽

Cor Hurkens ◽

Arjen K. Lenstra

Keyword(s):

Diophantine Equation ◽

Upper Bounds ◽

Lower And Upper Bounds ◽

Linear Diophantine Equation

Download Full-text

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow

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

10.1007/3-540-69346-7_26 ◽

1998 ◽

pp. 338-352 ◽

Cited By ~ 28

Author(s):

Andrew V. Goldberg ◽

Jeffrey D. Oldham ◽

Serge Plotkin ◽

Cliff Stein

Keyword(s):

Approximation Algorithm ◽

Minimum Cost ◽

Multicommodity Flow

Download Full-text

Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations

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

10.1007/3-540-69346-7_31 ◽

1998 ◽

pp. 409-422 ◽

Cited By ~ 13

Author(s):

Volker Kaibel

Keyword(s):

Polyhedral Combinatorics ◽

Quadratic Assignment ◽

Assignment Problems ◽

Quadratic Assignment Problems

Download Full-text

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs

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

10.1007/3-540-69346-7_12 ◽

1998 ◽

pp. 153-168 ◽

Cited By ~ 28

Author(s):

Stavros G. Kolliopoulos ◽

Clifford Stein

Keyword(s):

Greedy Algorithms ◽

Disjoint Path ◽

Integer Programs ◽

Packing Integer Programs

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Improved Approximation Algorithms for Uncapacitated Facility Location

A New Bound for the 2-Edge Connected Subgraph Problem

Solving Integer and Disjunctive Programs by Lift and Project

On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems

Consecutive Ones and a Betweenness Problem in Computational Biology

Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow

Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs

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