Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorPapadimitriou, Christos H
TitleCombinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz
Imprint Englewood Cliffs, N.J. : Prentice Hall, c1982
Descript xvi, 496 p. ; 24 cm

CONTENT

Optimization problems -- The simplex algorithm -- Duality -- Computational considerations for the simplex algorithm -- The primal-dual algorithm -- Primal-dual algorithms for max-flow and shortest path: ford-fulkerson and dijkstra -- Primal-dual algorithms for min-cost flow -- Algorithms and complexity -- Efficient algorithms for the max-flow problem -- Algorithms for matching -- Weighted matching -- Spanning tree and matroids -- Integer linear programming -- A cutting-planning algorithm for integer linear programs -- NP-complete problems -- More about NP-completeness -- Approximation algorithms -- Branch-and-bound and dynamic programming -- Local search


Mathematical optimization Combinatorial analysis Computational complexity

LOCATIONCALL#STATUS
Chula Business School Library519 P213C 1982CHECK SHELVES

Chulalinet's Book Delivery Request




Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram