- Main Menu-

Catalogue Tag Display

MARC 21

Combinatorial Optimization II
Tag	Description
020	$a9783642008047$9978-3-642-00804-7
082	$a519.6$223
099	$aOnline resource: Springer
245	$aCombinatorial Optimization II$h[EBook] /$cedited by V. J. Rayward-Smith.
260	$aBerlin, Heidelberg :$bSpringer Berlin Heidelberg,$c1980.
300	$a142 p.$bonline resource.
336	$atext$btxt$2rdacontent
337	$acomputer$bc$2rdamedia
338	$aonline resource$bcr$2rdacarrier
440	$aMathematical Programming Studies,$x0303-3929 ;$v13
505	$aPerfect 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?.
538	$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700	$aRayward-Smith, V. J.$eeditor.
710	$aSpringerLink (Online service)
830	$aMathematical Programming Studies,$x0303-3929 ;$v13
856	$uhttp://dx.doi.org/10.1007/BFb0120900