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

9783540660194, 9783540487777

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope

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

10.1007/3-540-48777-8_13 ◽

1999 ◽

pp. 166-182 ◽

Cited By ~ 5

Author(s):

Jean Fonlupt ◽

Ali Ridha Mahjoub

Keyword(s):

Extreme Points

Download Full-text

Approximation Algorithms for a Directed Network Design Problem

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

10.1007/3-540-48777-8_26 ◽

1999 ◽

pp. 345-360 ◽

Cited By ~ 6

Author(s):

Vardges Melkonian ◽

Éva Tardos

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Design Problem ◽

Network Design Problem ◽

Directed Network

Download Full-text

On the Separation of Maximally Violated mod-k Cuts

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

10.1007/3-540-48777-8_7 ◽

1999 ◽

pp. 87-98

Author(s):

Alberto Caprara ◽

Matteo Fischetti ◽

Adam N. Letchford

Download Full-text

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow

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

10.1007/3-540-48777-8_25 ◽

1999 ◽

pp. 328-344 ◽

Cited By ~ 1

Author(s):

Stavros G. Kolliopoulos ◽

Clifford Stein

Keyword(s):

Approximation Algorithms ◽

Experimental Evaluation ◽

Single Source ◽

Unsplittable Flow

Download Full-text

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube

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

10.1007/3-540-48777-8_11 ◽

1999 ◽

pp. 137-150 ◽

Cited By ~ 15

Author(s):

Friedrich Eisenbrand ◽

Andreas S. Schulz

Download Full-text

A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)

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

10.1007/3-540-48777-8_6 ◽

1999 ◽

pp. 73-86 ◽

Cited By ~ 1

Author(s):

Mao-cheng Cai ◽

Xiaotie Deng ◽

Wenan Zang

Keyword(s):

Preliminary Version ◽

Vertex Sets

Download Full-text

Valid Inequalities for Problems with Additive Variable Upper Bounds

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

10.1007/3-540-48777-8_5 ◽

1999 ◽

pp. 60-72

Author(s):

Alper Atamtürk ◽

George L. Nemhauser ◽

Martin W. P. Savelsbergh

Keyword(s):

Valid Inequalities ◽

Upper Bounds ◽

Variable Upper Bounds

Download Full-text

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

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

10.1007/3-540-48777-8_1 ◽

1999 ◽

pp. 1-16 ◽

Cited By ~ 6

Author(s):

Karen Aardal ◽

Robert E. Bixby ◽

Cor A. J. Hurkens ◽

Arjen K. Lenstra ◽

Job W. Smeltink

Keyword(s):

Basis Reduction

Download Full-text

An Introduction to Empty Lattice Simplices

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

10.1007/3-540-48777-8_30 ◽

1999 ◽

pp. 400-414 ◽

Cited By ~ 9

Author(s):

András Sebő

Download Full-text

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

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

10.1007/3-540-48777-8_20 ◽

1999 ◽

pp. 259-272 ◽

Cited By ~ 7

Author(s):

Satoru Iwata ◽

S. Thomas McCormick ◽

Maiko Shigeno

Keyword(s):

Flow Problem ◽

Submodular Flow ◽

Strongly Polynomial

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope

Approximation Algorithms for a Directed Network Design Problem

On the Separation of Maximally Violated mod-k Cuts

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube

A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)

Valid Inequalities for Problems with Additive Variable Upper Bounds

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

An Introduction to Empty Lattice Simplices

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

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