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

9783540436768, 9783540478676

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design

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

10.1007/3-540-47867-1_16 ◽

2002 ◽

pp. 212-229 ◽

Cited By ~ 4

Author(s):

Ramamoorthi Ravi ◽

Amitabh Sinha

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Facility Location ◽

Integrated Logistics

Download Full-text

On a Lemma of Scarf

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

10.1007/3-540-47867-1_13 ◽

2002 ◽

pp. 176-187

Author(s):

Ron Aharoni ◽

Tamás Fleiner

Download Full-text

Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms

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

10.1007/3-540-47867-1_12 ◽

2002 ◽

pp. 161-175 ◽

Cited By ~ 3

Author(s):

Jean-Philippe P. Richard ◽

Ismael R. de Farias ◽

George L. Nemhauser

Keyword(s):

Integer Programming ◽

Mixed Integer Programming ◽

Basic Theory ◽

Mixed Integer

Download Full-text

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem

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

10.1007/3-540-47867-1_23 ◽

2002 ◽

pp. 315-328 ◽

Cited By ~ 5

Author(s):

Alberto Caprara ◽

Andrea Lodi ◽

Michele Monaci

Keyword(s):

Bin Packing ◽

Approximation Scheme ◽

Packing Problem ◽

Two Dimensional ◽

Two Stage ◽

Bin Packing Problem

Download Full-text

The Demand Matching Problem

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

10.1007/3-540-47867-1_32 ◽

2002 ◽

pp. 457-474 ◽

Cited By ~ 6

Author(s):

Bruce Shepherd ◽

Adrian Vetta

Keyword(s):

Matching Problem

Download Full-text

Approximating the Advertisement Placement Problem

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

10.1007/3-540-47867-1_29 ◽

2002 ◽

pp. 415-424 ◽

Cited By ~ 2

Author(s):

Ari Freund ◽

Joseph Seffi Naor

Keyword(s):

Placement Problem

Download Full-text

A New Subadditive Approach to Integer Programming

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

10.1007/3-540-47867-1_27 ◽

2002 ◽

pp. 384-400 ◽

Cited By ~ 5

Author(s):

Diego Klabjan

Keyword(s):

Integer Programming

Download Full-text

A Polyhedral Approach to Surface Reconstruction from Planar Contours

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

10.1007/3-540-47867-1_19 ◽

2002 ◽

pp. 258-272

Author(s):

Ernst Althaus ◽

Christian Fink

Keyword(s):

Surface Reconstruction ◽

Polyhedral Approach

Download Full-text

An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs

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

10.1007/3-540-47867-1_11 ◽

2002 ◽

pp. 145-160 ◽

Cited By ~ 7

Author(s):

Sanjeeb Dash

Keyword(s):

Lower Bound ◽

Branch And Cut ◽

Exponential Lower Bound

Download Full-text

Split Closure and Intersection Cuts

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

10.1007/3-540-47867-1_10 ◽

2002 ◽

pp. 127-144 ◽

Cited By ~ 2

Author(s):

Kent Andersen ◽

Gérard Cornuéjols ◽

Yanjun Li

Keyword(s):

Intersection Cuts

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design

On a Lemma of Scarf

Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem

The Demand Matching Problem

Approximating the Advertisement Placement Problem

A New Subadditive Approach to Integer Programming

A Polyhedral Approach to Surface Reconstruction from Planar Contours

An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs

Split Closure and Intersection Cuts

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