Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleCombinatorial Optimization II [electronic resource] / edited by V. J. Rayward-Smith
ImprintBerlin, Heidelberg : Springer Berlin Heidelberg, 1980
Connect to
Descript 142 p. online resource


Perfect triangle-free 2-matchings -- On the structure of all minimum cuts in a network and applications -- Clutter percolation and random graphs -- The use of recurrence relations in computing -- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem -- A problem of scheduling conference accommodation -- Constructing timetables for sport competitions -- The reconstruction of latin squares with applications to school timetabling and to experimental design -- An algorithm for the single machine sequencing problem with precedence constraints -- Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory -- The distance between nodes for a class of recursive trees -- Optimization problems arising from the incorporation of split values in search trees -- Heuristic analysis, linear programming and branch and bound -- Heuristic improvement methods: How should starting solutions be chosen?

Mathematics Computer science -- Mathematics Mathematical optimization Mathematics Optimization Mathematics of Computing


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


facebook   instragram