论文信息 - Notes on Combinatorial Optimization - 字舞流文

Notes on Combinatorial Optimization

Abstract : Contents: Introduction; Minimum Spanning Trees; Shortest Paths; Polyhedral Combinatorics; Facts of Polyhedra; Ellipsoids.

Robert E. Bixby | R. Bixby

[1] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..

[2] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .

[3] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .

[6] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[7] Gérard Cornuéjols,et al. On the 0, 1 facets of the set covering polytope , 1989, Math. Program..

[8] G. Nemhauser,et al. Integer Programming , 2020 .

[9] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..