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

9783540688860, 9783540688914

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles

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

10.1007/978-3-540-68891-4_32 ◽

2008 ◽

pp. 463-475 ◽

Cited By ~ 27

Author(s):

Santanu S. Dey ◽

Laurence A. Wolsey

Keyword(s):

Integer Variables

Download Full-text

A New Approach to Splitting-Off

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

10.1007/978-3-540-68891-4_28 ◽

2008 ◽

pp. 401-415 ◽

Cited By ~ 3

Author(s):

Attila Bernáth ◽

Tamás Király

Keyword(s):

New Approach

Download Full-text

A Polynomial Algorithm for Weighted Abstract Flow

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

10.1007/978-3-540-68891-4_7 ◽

2008 ◽

pp. 97-111 ◽

Cited By ~ 4

Author(s):

Maren Martens ◽

S. Thomas McCormick

Keyword(s):

Polynomial Algorithm

Download Full-text

Primal-Dual Schema for Capacitated Covering Problems

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

10.1007/978-3-540-68891-4_20 ◽

2008 ◽

pp. 288-302 ◽

Cited By ~ 27

Author(s):

Tim Carnes ◽

David Shmoys

Keyword(s):

Covering Problems ◽

Primal Dual ◽

Capacitated Covering

Download Full-text

A Polynomial Time Approximation Scheme for the Square Packing Problem

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

10.1007/978-3-540-68891-4_13 ◽

2008 ◽

pp. 184-198 ◽

Cited By ~ 7

Author(s):

Klaus Jansen ◽

Roberto Solis-Oba

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Packing Problem ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Square Packing ◽

Polynomial Time Approximation

Download Full-text

Can Pure Cutting Plane Algorithms Work?

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

10.1007/978-3-540-68891-4_29 ◽

2008 ◽

pp. 416-434 ◽

Cited By ~ 2

Author(s):

Arrigo Zanette ◽

Matteo Fischetti ◽

Egon Balas

Keyword(s):

Cutting Plane ◽

Cutting Plane Algorithms

Download Full-text

A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs

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

10.1007/978-3-540-68891-4_5 ◽

2008 ◽

pp. 62-76

Author(s):

Kenjiro Takazawa

Keyword(s):

Bipartite Graphs

Download Full-text

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem

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

10.1007/978-3-540-68891-4_8 ◽

2008 ◽

pp. 112-124 ◽

Cited By ~ 11

Author(s):

Michael Armbruster ◽

Marzena Fügenschuh ◽

Christoph Helmberg ◽

Alexander Martin

Keyword(s):

Comparative Study ◽

Branch And Cut ◽

Graph Bisection

Download Full-text

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs

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

10.1007/978-3-540-68891-4_2 ◽

2008 ◽

pp. 17-33 ◽

Cited By ~ 12

Author(s):

Anureet Saxena ◽

Pierre Bonami ◽

Jon Lee

Keyword(s):

Mixed Integer ◽

Disjunctive Cuts ◽

Quadratically Constrained

Download Full-text

The Stochastic Machine Replenishment Problem

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

10.1007/978-3-540-68891-4_12 ◽

2008 ◽

pp. 169-183 ◽

Cited By ~ 1

Author(s):

Kamesh Munagala ◽

Peng Shi

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles

A New Approach to Splitting-Off

A Polynomial Algorithm for Weighted Abstract Flow

Primal-Dual Schema for Capacitated Covering Problems

A Polynomial Time Approximation Scheme for the Square Packing Problem

Can Pure Cutting Plane Algorithms Work?

A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs

The Stochastic Machine Replenishment Problem

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