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

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 ◽

Cited By ~ 16

Author(s):

Dimitris Bertsimas ◽

Chung-Piaw Teo ◽

Rakesh Vohra

Keyword(s):

Randomized Rounding

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

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 ◽

Cited By ~ 4

Author(s):

Nabil Kahale

Keyword(s):

Markov Chains ◽

Mixing Rates

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 ◽

Cited By ~ 29

Author(s):

Magnús M. Halldórsson

Keyword(s):

Graph Coloring ◽

Set Cover ◽

Complementary Graph

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 ◽

Cited By ~ 7

Author(s):

Meinrad Funke ◽

Gerhard Reinelt

Keyword(s):

Feedback Vertex Set ◽

Vertex Set ◽

Feedback Vertex Set Problem ◽

Polyhedral Approach

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 ◽

Cited By ~ 6

Author(s):

Neil Simonetti ◽

Egon Balas

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Traveling Salesman ◽

Linear Time Algorithm ◽

Traveling Salesman Problems

Coloring bipartite hypergraphs

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

10.1007/3-540-61310-2_26 ◽

1996 ◽

pp. 345-358 ◽

Cited By ~ 20

Author(s):

Hui Chen ◽

Alan Frieze

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 ◽

Cited By ~ 51

Author(s):

J. A. Hoogeveen ◽

A. P. A. Vestjens

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

On Line

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 ◽

Cited By ~ 8

Author(s):

Robert Carr

Keyword(s):

Polynomial Time

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 ◽

Cited By ~ 12

Author(s):

C. Helmberg ◽

F. Rendl ◽

R. Weismantel

Keyword(s):

Semidefinite Programming ◽

Cutting Planes ◽

Quadratic Knapsack

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On dependent randomized rounding algorithms

Algorithms and extended formulations for one and two facility network design

A semidefinite bound for mixing rates of Markov chains

Approximating k-set cover and complementary graph coloring

A polyhedral approach to the feedback vertex set problem

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

Coloring bipartite hypergraphs

Optimal on-line algorithms for single-machine scheduling

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

Quadratic knapsack relaxations using cutting planes and semidefinite programming

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