Tools

LEADER 01397cam a2200373 a 4500

001 ocm30894955;

003 OCoLC;

005 20141212114727.0;

008 940714s1994 gw a b 001 0 eng ;

010 a| 94031562;

020 a| 3540583343 (Berlin : acid-free paper);

020 a| 0387583343 (New York : acid-free paper);

035 a| (Sirsi) o30894955;

035 a| (OCoLC)30894955;

040 a| DLCc| DLCd| EREd| UtOrBLW;

049 a| EREE;

050 00 a| T57.78b| .R47 1994;

082 00 a| 511/.52| 20;

100 1 a| Reinelt, G.q| (Gerhard)=| ^A358589;

245 14 a| The traveling salesman :b| computational solutions for TSP applications /c| Gerhard Reinelt.;

300 a| viii, 223 pages :b| illustrations ;c| 24 cm.;

336 a| text2| rdacontent;

337 a| unmediated2| rdamedia;

338 a| volume2| rdacarrier;

490 1 a| Lecture notes in computer science ;v| 840;

504 a| Includes bibliographical references (p. [214]-221) and index.;

650 0 a| Traveling salesman problem.=| ^A199374;

650 0 a| Heuristic programming.=| ^A158297;

650 0 a| Algorithms.=| ^A17554;

830 0 a| Lecture notes in computer sciencev| 840.=| ^A466336;

596 a| 1;

998 a| 567400;

999 a| T57.78 .R47 1994w| LCc| 1i| 30372008769058d| 11/12/2012f| 11/12/2012g| 1l| JGESm| JOYNERp| $37.00r| Ys| Yt| JGESBKu| 1/10/1995x| BOOKz| JSTACKSo| .STAFF. 0;

The traveling salesman : computational solutions for TSP applications / Gerhard Reinelt.

Author/creator	Reinelt, G.
Format	Book
Publication Info	Berlin ; New York : Springer-Verlag, ©1994.
Description	viii, 223 pages : illustrations ; 24 cm.
Subjects	Traveling salesman problem. Heuristic programming. Algorithms.

Series	Lecture notes in computer science ; 840 Lecture notes in computer science 840. ^A466336
Bibliography note	Includes bibliographical references (p. [214]-221) and index.
LCCN	94031562
ISBN	3540583343 (Berlin : acid-free paper)
ISBN	0387583343 (New York : acid-free paper)

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	T57.78 .R47 1994	✔ Available	Place Hold

The traveling salesman : computational solutions for TSP applications / Gerhard Reinelt.

Click here for more information about this title

Availability