UID:
almahu_9949218784502882
Format:
1 online resource (xi, 441 p. : ill.)
Edition:
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
ISBN:
9781470439781 (online)
Series Statement:
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 20
Note:
Papers from workshops held at DIMACS at Rutgers University Sept. 1992-Aug. 1993.
,
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. A consortium of Rutgers University, Princeton University, AT&T Bell Labs, Bellcore."
,
Hypermetrics in geometry of numbers
,
Practical problem solving with cutting plane algorithms in combinatorial optimization
,
Randomized algorithms in combinatorial optimization
,
Maximum cuts and large bipartite subgraphs
,
Algorithms and reformulations for lot sizing problems
,
Efficient algorithms for disjoint paths in planar graphs
,
Computing near-optimal solutions to combinatorial optimization problems
,
Graph entropy: A survey
,
Mode of access : World Wide Web
Additional Edition:
Print version: Combinatorial optimization : ISSN 1052-1798 ISBN 9780821802397
Language:
English
Bookmarklink