|
|
|
|
LEADER |
03892cam a2200733Ia 4500 |
001 |
ocn520990431 |
003 |
OCoLC |
005 |
20170124070014.7 |
006 |
m o d |
007 |
cr cn||||||||| |
008 |
100219s2008 enka ob 011 0 eng d |
010 |
|
|
|z 2007024974
|
040 |
|
|
|a DG1
|b eng
|e pn
|c DG1
|d OSU
|d N$T
|d EBLCP
|d OCLCE
|d OCLCQ
|d E7B
|d DG1
|d OCLCQ
|d MERUC
|d OCLCQ
|d UKDOC
|d OCLCQ
|d YDXCP
|d DEBSZ
|d OCLCQ
|d COO
|d OCLCQ
|d DEBBG
|d AZK
|
019 |
|
|
|a 593310952
|a 626042578
|a 647847806
|a 651781100
|a 659490072
|a 680429535
|a 760333843
|a 961537555
|
020 |
|
|
|a 9780470611098
|q (ebook)
|
020 |
|
|
|a 047061109X
|q (ebook)
|
020 |
|
|
|a 9780470393673
|q (ebook)
|
020 |
|
|
|a 047039367X
|q (ebook)
|
020 |
|
|
|z 9781848210219
|
020 |
|
|
|z 1848210213
|
020 |
|
|
|z 9781905209996
|
020 |
|
|
|z 1905209991
|
024 |
7 |
|
|a 10.1002/9780470611098
|2 doi
|
029 |
1 |
|
|a DEBSZ
|b 430806159
|
029 |
1 |
|
|a DEBBG
|b BV043390665
|
035 |
|
|
|a (OCoLC)520990431
|z (OCoLC)593310952
|z (OCoLC)626042578
|z (OCoLC)647847806
|z (OCoLC)651781100
|z (OCoLC)659490072
|z (OCoLC)680429535
|z (OCoLC)760333843
|z (OCoLC)961537555
|
042 |
|
|
|a dlr
|
050 |
|
4 |
|a QA402.5
|b .C54513 2008
|
072 |
|
7 |
|a MAT
|x 042000
|2 bisacsh
|
082 |
0 |
4 |
|a 519.6/4
|2 22
|
084 |
|
|
|a SK 890
|2 rvk
|
084 |
|
|
|a ST 130
|2 rvk
|
049 |
|
|
|a MAIN
|
245 |
0 |
0 |
|a Combinatorial optimization and theoretical computer science :
|b interfaces and perspectives : 30th anniversary of the LAMSADE /
|c edited by Vangelis Th. Paschos.
|
264 |
|
1 |
|a London, UK :
|b ISTE ;
|c [2008]
|
264 |
|
1 |
|a Hoboken, NJ :
|b Wiley,
|c [2008]
|
264 |
|
4 |
|c ©2008
|
300 |
|
|
|a 1 online resource (515 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
504 |
|
|
|a Includes bibliographical references and index.
|
588 |
0 |
|
|a Print version record.
|
505 |
0 |
|
|a 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.
|
506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
533 |
|
|
|a Electronic reproduction.
|b [S.l.] :
|c HathiTrust Digital Library,
|d 2010.
|5 MiAaHDL
|
538 |
|
|
|a 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.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
583 |
1 |
|
|a digitized
|c 2010
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
650 |
|
0 |
|a Combinatorial optimization
|x Computer programs.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
6 |
|a Optimisation combinatoire
|x Logiciels.
|
650 |
|
6 |
|a Informatique
|x Mathématiques.
|
650 |
|
7 |
|a MATHEMATICS
|x Optimization.
|2 bisacsh
|
650 |
|
7 |
|a Optimisation combinatoire
|x Logiciels.
|2 ram
|
650 |
|
7 |
|a Informatique
|x Mathématiques.
|2 ram
|
650 |
0 |
7 |
|a Kombinatorische Optimierung.
|2 swd
|
650 |
0 |
7 |
|a Theoretische Informatik.
|2 swd
|
655 |
|
4 |
|a Electronic books.
|
655 |
|
7 |
|a Aufsatzsammlung.
|2 swd
|
700 |
1 |
|
|a Paschos, Vangelis Th.
|
710 |
2 |
|
|a Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (France)
|
776 |
0 |
8 |
|i Print version:
|t Combinatorial optimization and theoretical computer science.
|d London : ISTE ; Hoboken, NJ : Wiley, 2008
|z 9781848210219
|w (DLC) 2007024974
|w (OCoLC)144771900
|
856 |
4 |
0 |
|z View fulltext via EzAccess
|u https://ezaccess.library.uitm.edu.my/login?url=https://doi.org/10.1002/9780470611098
|
994 |
|
|
|a 92
|b DG1
|