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

TOTAL DOCUMENTS

36

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540613107, 9783540684534

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On dependent randomized rounding algorithms

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

10.1007/3-540-61310-2_25 ◽

1996 ◽

pp. 330-344 ◽

Author(s):

Dimitris Bertsimas ◽

Chung-Piaw Teo ◽

Rakesh Vohra

Keyword(s):

Randomized Rounding

Download Full-text

Algorithms and extended formulations for one and two facility network design

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

10.1007/3-540-61310-2_4 ◽

1996 ◽

pp. 44-57

Author(s):

Sunil Chopra ◽

Itzhak Gilboa ◽

S. Trilochan Sastry

Keyword(s):

Network Design ◽

Extended Formulations

Download Full-text

A semidefinite bound for mixing rates of Markov chains

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

10.1007/3-540-61310-2_15 ◽

1996 ◽

pp. 190-203 ◽

Author(s):

Nabil Kahale

Keyword(s):

Markov Chains ◽

Download Full-text

Approximating k-set cover and complementary graph coloring

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

10.1007/3-540-61310-2_10 ◽

1996 ◽

pp. 118-131 ◽

Author(s):

Magnús M. Halldórsson

Keyword(s):

Graph Coloring ◽

Set Cover ◽

Complementary Graph

Download Full-text

A polyhedral approach to the feedback vertex set problem

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

10.1007/3-540-61310-2_33 ◽

1996 ◽

pp. 445-459 ◽

Author(s):

Meinrad Funke ◽

Gerhard Reinelt

Keyword(s):

Feedback Vertex Set ◽

Feedback Vertex Set Problem ◽

Polyhedral Approach

Download Full-text

Implementation of a linear time algorithm for certain generalized traveling salesman problems

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

10.1007/3-540-61310-2_24 ◽

1996 ◽

pp. 316-329 ◽

Author(s):

Neil Simonetti ◽

Egon Balas

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Traveling Salesman ◽

Linear Time Algorithm ◽

Traveling Salesman Problems

Download Full-text

Coloring bipartite hypergraphs

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

10.1007/3-540-61310-2_26 ◽

1996 ◽

pp. 345-358 ◽

Author(s):

Hui Chen ◽

Alan Frieze

Download Full-text

Optimal on-line algorithms for single-machine scheduling

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

10.1007/3-540-61310-2_30 ◽

1996 ◽

pp. 404-414 ◽

Author(s):

J. A. Hoogeveen ◽

A. P. A. Vestjens

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Download Full-text

Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time

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

10.1007/3-540-61310-2_34 ◽

1996 ◽

pp. 460-474 ◽

Author(s):

Robert Carr

Keyword(s):

Polynomial Time

Download Full-text

Quadratic knapsack relaxations using cutting planes and semidefinite programming

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

10.1007/3-540-61310-2_14 ◽

1996 ◽

pp. 175-189 ◽

Author(s):

C. Helmberg ◽

F. Rendl ◽

R. Weismantel

Keyword(s):

Semidefinite Programming ◽

Cutting Planes ◽

Quadratic Knapsack

Download Full-text