|
|
|
|
| LEADER |
01268nam a22003857a 4500 |
| 001 |
381430 |
| 008 |
040120t20032003xxe ||| |||| 00| 0 eng d |
| 009 |
PPN07597973X |
| 020 |
|
|
|a 9783540443896 (rel.)
|
| 020 |
|
|
|a 3540443894 (rel.)
|
| 024 |
|
|
|a 9783540443896
|
| 041 |
0 |
|
|a eng
|
| 082 |
|
|
|a 519
|
| 082 |
|
|
|a 519.64
|
| 084 |
|
|
|a G.2
|
| 084 |
|
|
|a 90-02. 2010
|
| 084 |
|
|
|a 05-02. 2010
|
| 084 |
|
|
|a 52B55. 2010
|
| 084 |
|
|
|a 68Q25. 2010
|
| 084 |
|
|
|a 68R10. 2010
|
| 084 |
|
|
|a 90C27. 2010
|
| 084 |
|
|
|a 90C35. 2010
|
| 084 |
|
|
|a 90C57. 2010
|
| 084 |
|
|
|a 05C85. 2000
|
| 084 |
|
|
|a 68R05. 2000
|
| 100 |
1 |
|
|a Schrijver, Alexander,
|d 1948-
|
| 240 |
1 |
0 |
|a Disjoint paths, hypergraphs
|
| 245 |
1 |
0 |
|a Combinatorial optimization :
|b polyhedra and efficiency chapters 70-83
|n Volume C,
|p Disjoint paths, hypergraphs :
|c Alexander Schrijver.
|
| 260 |
|
|
|a Berlin ;
|a New York ;
|a Paris [etc.] :
|b Springer.
|
| 260 |
|
|
|c C 2003.
|
| 300 |
|
|
|a 1 vol. (XXXIII-p. [1219]-1881) :
|b ill., couv. ill. ;
|c 24 cm.
|
| 490 |
1 |
|
|a Algorithms and combinatorics
|x 0937-5511
|v 24
|
| 504 |
|
|
|a Bibliogr. p. [1463]-1766. Notes bibliogr. Index
|
| 650 |
|
|
|a Optimisation combinatoire
|
| 997 |
|
|
|0 381430
|1 Livre papier
|a Ressource papier
|c 0/Orléans/
|c 1/Orléans/IDP/
|z Orléans, IDP, 6922 SCH
|
