default search action
DIMACS Workshop: Combinatorial Optimization 1992/93
- William J. Cook, László Lovász, Paul D. Seymour:
Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20, DIMACS/AMS 1995, ISBN 978-0-8218-0239-7
Papers from the DIMACS Special Year 1992/93
- Forward. Combinatorial Optimization 1993: ix-
- Preface. Combinatorial Optimization 1993: xi-
- Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
Hypermetrics in geometry of numbers. 1-109 - Michael Jünger, Gerhard Reinelt, Stefan Thienel:
Practical problem solving with cutting plane algorithms in combinatorialoptimization. 111-152 - László Lovász:
Randomized algorithms in combinatorial optimization. 153-179 - Svatopluk Poljak, Zsolt Tuza:
Maximum cuts and largest bipartite subgraphs. 181-244 - Yves Pochet, Laurence A. Wolsey:
Algorithms and reformulations for lot sizing problems. 245-293 - Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
Efficient algorithms for disjoint paths in planar graphs. 295-354 - David B. Shmoys:
Computing near-optimal solutions to combinatorial optimization problems. 355-397 - Gábor Simonyi:
Graph entropy: A survey. 399-441
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.