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

9783540422259, 9783540455356

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

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

10.1007/3-540-45535-3_32 ◽

2010 ◽

pp. 406-421 ◽

Cited By ~ 8

Author(s):

Clifford Stein ◽

David P. Wagner*

Keyword(s):

Approximation Algorithms ◽

Traveling Salesman Problem ◽

Traveling Salesman

Download Full-text

Independence Free Graphs and Vertex connectivity Augmentation

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

10.1007/3-540-45535-3_21 ◽

2010 ◽

pp. 264-279 ◽

Cited By ~ 2

Author(s):

Bill Jackson ◽

Tibor Jordná

Keyword(s):

Vertex Connectivity ◽

Connectivity Augmentation

Download Full-text

The Throughput of Sequential Testing

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

10.1007/3-540-45535-3_22 ◽

2001 ◽

pp. 280-292 ◽

Cited By ~ 7

Author(s):

Murali S. Kodialam

Keyword(s):

Sequential Testing

Download Full-text

A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective

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

10.1007/3-540-45535-3_28 ◽

2001 ◽

pp. 361-369 ◽

Cited By ~ 2

Author(s):

Maurice Queyranne ◽

Maxim Sviridenko

Keyword(s):

Approximation Algorithm ◽

Open Shop ◽

Open Shop Problem

Download Full-text

Fences Are Futile: On Relaxations for the Linear Ordering Problem

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

10.1007/3-540-45535-3_26 ◽

2001 ◽

pp. 333-347 ◽

Cited By ~ 10

Author(s):

Alantha Newman ◽

Santosh Vempala

Keyword(s):

Linear Ordering ◽

Linear Ordering Problem

Download Full-text

Cutting Planes for Mixed 0-1 Semidefinite Programs

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

10.1007/3-540-45535-3_20 ◽

2001 ◽

pp. 251-263 ◽

Cited By ~ 2

Author(s):

G. Iyengar ◽

M. T. Çezik

Keyword(s):

Cutting Planes ◽

Semidefinite Programs

Download Full-text

Performance Guarantees of Local Search for Multiprocessor Scheduling

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

10.1007/3-540-45535-3_29 ◽

2001 ◽

pp. 370-382 ◽

Cited By ~ 17

Author(s):

Petra Schuurman ◽

Tjark Vredeveld

Keyword(s):

Local Search ◽

Multiprocessor Scheduling ◽

Performance Guarantees

Download Full-text

Pruning by Isomorphism in Branch-and-Cut

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

10.1007/3-540-45535-3_24 ◽

2001 ◽

pp. 304-317 ◽

Cited By ~ 3

Author(s):

François Margot

Keyword(s):

Branch And Cut

Download Full-text

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times

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

10.1007/3-540-45535-3_25 ◽

2001 ◽

pp. 318-332 ◽

Cited By ~ 1

Author(s):

Andrew J. Miller ◽

George L. Nemhauser ◽

Martin W. P. Savelsbergh

Keyword(s):

Production Planning ◽

Setup Times ◽

Planning Model

Download Full-text

On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem

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

10.1007/3-540-45535-3_14 ◽

2001 ◽

pp. 170-184 ◽

Cited By ~ 24

Author(s):

Naveen Garg ◽

Rohit Khandekar ◽

Goran Konjevod ◽

R. Ravi ◽

F. S. Salman ◽

...

Keyword(s):

Network Design ◽

Design Problem ◽

Network Design Problem ◽

Integrality Gap ◽

Natural Formulation

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

Independence Free Graphs and Vertex connectivity Augmentation

The Throughput of Sequential Testing

A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective

Fences Are Futile: On Relaxations for the Linear Ordering Problem

Cutting Planes for Mixed 0-1 Semidefinite Programs

Performance Guarantees of Local Search for Multiprocessor Scheduling

Pruning by Isomorphism in Branch-and-Cut

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times

On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem

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