DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821802397, 9781470439781

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Graph entropy: A survey

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/08 ◽

1995 ◽

pp. 399-441 ◽

Cited By ~ 48

Author(s):

G Simonyi

Download Full-text

Algorithms and reformulations for lot sizing problems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/05 ◽

1995 ◽

pp. 245-293 ◽

Cited By ~ 25

Author(s):

Yves Pochet ◽

Laurence Wolsey

Keyword(s):

Lot Sizing

Download Full-text

Maximum cuts and large bipartite subgraphs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/04 ◽

1995 ◽

pp. 181-244 ◽

Cited By ~ 57

Author(s):

Svatopluk Poljak ◽

Z Tuza

Download Full-text

Randomized algorithms in combinatorial optimization

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/03 ◽

1995 ◽

pp. 153-179 ◽

Cited By ~ 11

Author(s):

Laszlo Lovasz

Keyword(s):

Combinatorial Optimization ◽

Randomized Algorithms

Download Full-text

Efficient algorithms for disjoint paths in planar graphs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/06 ◽

1995 ◽

pp. 295-354 ◽

Cited By ~ 14

Author(s):

H Ripphausen-Lipa ◽

Dorothea Wagner ◽

K Weihe

Keyword(s):

Planar Graphs ◽

Efficient Algorithms ◽

Disjoint Paths

Download Full-text

Hypermetrics in geometry of numbers

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/01 ◽

1995 ◽

pp. 1-109 ◽

Cited By ~ 2

Author(s):

M Deza ◽

V Grishukhin ◽

Monique Laurent

Keyword(s):

Geometry Of Numbers

Download Full-text

Computing near-optimal solutions to combinatorial optimization problems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/07 ◽

1995 ◽

pp. 355-397 ◽

Cited By ~ 17

Author(s):

David Shmoys

Keyword(s):

Combinatorial Optimization ◽

Optimization Problems ◽

Optimal Solutions ◽

Combinatorial Optimization Problems

Download Full-text

Practical problem solving with cutting plane algorithms in combinatorial optimization

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization ◽

10.1090/dimacs/020/02 ◽

1995 ◽

pp. 111-152 ◽

Cited By ~ 31

Author(s):

M Junger ◽

G Reinelt ◽

Stefan Thienel

Keyword(s):

Combinatorial Optimization ◽

Problem Solving ◽

Practical Problem ◽

Cutting Plane ◽

Cutting Plane Algorithms

Download Full-text

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial OptimizationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Graph entropy: A survey

Algorithms and reformulations for lot sizing problems

Maximum cuts and large bipartite subgraphs

Randomized algorithms in combinatorial optimization

Efficient algorithms for disjoint paths in planar graphs

Hypermetrics in geometry of numbers

Computing near-optimal solutions to combinatorial optimization problems

Practical problem solving with cutting plane algorithms in combinatorial optimization

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Combinatorial Optimization
Latest Publications