NLU Meghalaya Library

Online Public Access Catalogue (OPAC)

Amazon cover image
Image from Amazon.com

Combinatorial optimization and theoretical computer science : interfaces and perspectives : 30th anniversary of the LAMSADE / edited by Vangelis Th. Paschos.

Contributor(s): Material type: TextTextPublication details: London, UK : ISTE ; Hoboken, NJ : Wiley, �2008.Description: 1 online resource (515 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780470611098
  • 047061109X
  • 9780470393673
  • 047039367X
Subject(s): Genre/Form: Additional physical formats: Print version:: Combinatorial optimization and theoretical computer science.DDC classification:
  • 519.6/4 22
LOC classification:
  • QA402.5 .C54513 2008
Other classification:
  • SK 890
  • ST 130
  • 31.12
  • 54.10
  • 85.03
Online resources:
Contents:
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.
Action note:
  • digitized 2010 committed to preserve
Summary: 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
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references and index.

Print version record.

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 Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. 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 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

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

John Wiley and Sons Wiley Online Library: Complete oBooks

There are no comments on this title.

to post a comment.
© 2022- NLU Meghalaya. All Rights Reserved. || Implemented and Customized by
OPAC Visitors

Powered by Koha