Combinatorial optimization and theoretical computer science : interfaces and perspectives : 30th anniversary of the LAMSADE /
edited by Vangelis Th. Paschos.
- London, UK : Hoboken, NJ : ISTE ; Wiley, �2008.
- 1 online resource (515 pages) : illustrations
Includes bibliographical references and index.
Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); Chapter 3. Online Models for Set-covering: The Flaw of Greediness; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; Chapter 5. A "Maximum Node Clustering" Problem; Chapter 6. The Patrolling Problem: Theoretical and Experimental Results.
Use copy
This volume is dedicated to the theme "Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives" and has two main objectives: the first is to show that bringing together operational research and theoretical computer science can yield useful results for a range of applications, while the second is to demonstrate the quality and range of research conducted by the LAMSADE in these areas
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010.
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. http://purl.oclc.org/DLF/benchrepro0212