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

9783540594086, 9783540492450

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Combining semidefinite and polyhedral relaxations for integer programs

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

10.1007/3-540-59408-6_46 ◽

1995 ◽

pp. 124-134 ◽

Cited By ~ 13

Author(s):

C. Helmberg ◽

S. Poljak ◽

F. Rendl ◽

H. Wolkowicz

Keyword(s):

Integer Programs ◽

Polyhedral Relaxations

Download Full-text

On implementing push-relabel method for the maximum flow problem

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

10.1007/3-540-59408-6_49 ◽

1995 ◽

pp. 157-171 ◽

Cited By ~ 34

Author(s):

Boris V. Cherkassky ◽

Andrew V. Goldberg

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Maximum Flow Problem

Download Full-text

A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem

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

10.1007/3-540-59408-6_68 ◽

1995 ◽

pp. 403-413 ◽

Cited By ~ 1

Author(s):

Hiroshi Nagamochi ◽

Toshihide Ibaraki

Keyword(s):

Splitting Algorithm ◽

Edge Connectivity ◽

Connectivity Augmentation

Download Full-text

A mickey-mouse decomposition theorem

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

10.1007/3-540-59408-6_61 ◽

1995 ◽

pp. 321-328 ◽

Cited By ~ 3

Author(s):

Michele Conforti ◽

Gérard Cornuéjols ◽

Ajai Kapoor ◽

Kristina Vušković

Keyword(s):

Decomposition Theorem ◽

Mickey Mouse

Download Full-text

Oriented matroid polytopes and polyhedral fans are signable

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

10.1007/3-540-59408-6_52 ◽

1995 ◽

pp. 198-211 ◽

Cited By ~ 1

Author(s):

Peter Kleinschmidt ◽

Shmuel Onn

Keyword(s):

Oriented Matroid ◽

Matroid Polytopes

Download Full-text

Use of hidden network structure in the set partitioning problem

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

10.1007/3-540-59408-6_50 ◽

1995 ◽

pp. 172-184

Author(s):

Agha Iqbal Ali ◽

Hyun-Soo Han ◽

Jeffery L. Kennington

Keyword(s):

Network Structure ◽

Set Partitioning ◽

Set Partitioning Problem ◽

Partitioning Problem

Download Full-text

Coverings and delta-coverings

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

10.1007/3-540-59408-6_54 ◽

1995 ◽

pp. 228-243 ◽

Cited By ~ 2

Author(s):

André Bouchet

Download Full-text

Computational study of a family of mixed-integer quadratic programming problems

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

10.1007/3-540-59408-6_43 ◽

1995 ◽

pp. 80-94 ◽

Cited By ~ 8

Author(s):

Daniel Bienstock

Keyword(s):

Quadratic Programming ◽

Computational Study ◽

Mixed Integer ◽

Integer Quadratic Programming ◽

Quadratic Programming Problems ◽

Mixed Integer Quadratic Programming

Download Full-text

The interval order polytope of a digraph

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

10.1007/3-540-59408-6_41 ◽

1995 ◽

pp. 50-64 ◽

Cited By ~ 7

Author(s):

Rudolf Müller ◽

Andreas S. Schulz

Keyword(s):

Interval Order ◽

Order Polytope

Download Full-text

The random linear bottleneck assignment problem

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

10.1007/3-540-59408-6_48 ◽

1995 ◽

pp. 145-156 ◽

Cited By ~ 1

Author(s):

Ulrich Pferschy

Keyword(s):

Assignment Problem ◽

Bottleneck Assignment Problem ◽

Linear Bottleneck Assignment Problem

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Combining semidefinite and polyhedral relaxations for integer programs

On implementing push-relabel method for the maximum flow problem

A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem

A mickey-mouse decomposition theorem

Oriented matroid polytopes and polyhedral fans are signable

Use of hidden network structure in the set partitioning problem

Coverings and delta-coverings

Computational study of a family of mixed-integer quadratic programming problems

The interval order polytope of a digraph

The random linear bottleneck assignment problem

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