Surveys in combinatorial optimization [electronic resource] / edited by Silvano Martello ... [et al.].

Contributor(s): Martello, SilvanoMaterial type: Text

TextSeries: North-Holland mathematics studies ; 132. | Annals of discrete mathematics ; 31.Publication details: Amsterdam ; New York : New York : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1987. Description: 1 online resource (ix, 384 p.) : illContent type: text Media type: computer Carrier type: online resourceISBN: 9780444701367; 0444701362; 9780080872438 (electronic bk.); 0080872433 (electronic bk.)Subject(s): Combinatorial optimization | Optimisation combinatoire | Combinatorial optimization | MATHEMATICS -- Optimization | algorithme combinatoire | probl�eme knapsack | ordonnancement | r�eseau transmission | optimisation combinatoire | Optimisation combinatoire | Aufsatzsammlung | Kombinatorische Optimierung | Mathematics Combinatorial optimisation AlgorithmsGenre/Form: Electronic books.Additional physical formats: Print version:: Surveys in combinatorial optimization.DDC classification: 519 LOC classification: QA402.5 | .S85 1987ebOther classification: MAT 052f | SD 1985 | SK 890 Online resources: ScienceDirect | Volltext

Contents:

Front Cover; Surveys in Combinatorial Optimization; Copyright Page; Preface; Contents; Chapter 1. Selected topics in scheduling theory; Chapter 2. Quadratic assignment problems; Chapter 3. Order relations of variables in 0-1 programming; Chapter 4. Single facility location on networks; Chapter 5. Exact algorithms for the vehicle routing problem; Chapter 6. The Steiner problem in graphs; Chapter 7. Algorithms for knapsack problems; Chapter 8. Linear assignment problems; Chapter 9. Network synthesis and dynamic network optimization

Action note: digitized 2011 committed to preserveSummary: A collection of papers surveying recent progress in the field of Combinatorial Optimization. Topics examined include theoretical and computational aspects (Boolean Programming, Probabilistic Analysis of Algorithms, Parallel Computer Models and Combinatorial Algorithms), well-known combinatorial problems (such as the Linear Assignment Problem, the Quadratic Assignment Problem, the Knapsack Problem and Steiner Problems in Graphs) and more applied problems (such as Network Synthesis and Dynamic Network Optimization, Single Facility Location Problems on Networks, the Vehicle Routing Problem and Scheduling Problems).

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 10 )
Comments ( 0 )

No physical items for this record

A collection of papers surveying recent progress in the field of Combinatorial Optimization. Topics examined include theoretical and computational aspects (Boolean Programming, Probabilistic Analysis of Algorithms, Parallel Computer Models and Combinatorial Algorithms), well-known combinatorial problems (such as the Linear Assignment Problem, the Quadratic Assignment Problem, the Knapsack Problem and Steiner Problems in Graphs) and more applied problems (such as Network Synthesis and Dynamic Network Optimization, Single Facility Location Problems on Networks, the Vehicle Routing Problem and Scheduling Problems).

"Based on a series of tutorial lectures given at the School on Combinatorial Optimization, held at the Federal University of Rio de Janeiro, Brazil, July 8-19, 1985"--Foreword.

Includes bibliographical references.

Description based on print version record.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL

There are no comments on this title.

to post a comment.