Tools

LEADER 02572cam 22005054a 4500

001 ocm48449671;

003 OCoLC;

005 20141212162620.0;

007 cr un---------;

008 011109s2001 gw a b 101 0 eng ;

010 a| 2001057557;

015 a| GBA2-11567;

016 7 a| 9628794012| GyFmDB;

020 a| 3540428771 (softcover : alk. paper);

035 a| (Sirsi) o48449671;

035 a| (OCoLC)48449671;

042 a| pcc;

049 a| EREE;

050 00 a| T57.7b| .C66 2001;

072 7 a| QA2| lcco;

082 00 a| 519.72| 21;

245 00 a| Computational combinatorial optimization :b| optimal or provably near-optimal solutions /c| Michael Jun̈ger, Denis Naddef (eds.).;

300 a| viii, 303 pages ;c| 24 cm.;

336 a| text2| rdacontent;

337 a| computer2| rdamedia;

338 a| online resource2| rdacarrier;

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

504 a| Includes bibliographical references and index.;

505 0 a| General mixed integer programming : computational issues for branch-and-cut algorithms / Alexander Martin -- Projection and lifting in combinatorial optimization / Egon Balas -- Mathematical programming models and formulations for deterministic production planning problems / Yves Pochet -- Lagrangian relaxation / Claude Lemaréchal -- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS / Matthias Elf ... [et al.] -- Branch, cut, and price : sequential and parallel / Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter, Jr. -- TSP cuts which do not conform to the template paradigm / David Applegate, Robert Bixby, Vašek Chvátal.;

530 a| Also available via the World Wide Web.;

650 0 a| Programming (Mathematics)v| Congresses.=| ^A518188;

650 0 a| Combinatorial optimizationv| Congresses.=| ^A1236747;

700 1 a| Jünger, M.q| (Michael)=| ^A518189;

700 1 a| Naddef, Denis,d| 1947-=| ^A518190;

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

856 41 u| http://link.springer-ny.com/link/service/series/0558/tocs/t2241.htmz| Restricted to Springer LINK subscribers;

994 a| X0b| ERE;

910 a| PromptCat;

938 a| Otto Harrassowitzb| HARRn| har010086500c| 83.46 DEM;

980 a| 2002-05-22b| 49d| 3.03e| 46.55f| 26602;

596 a| 1;

998 a| 879253;

999 a| T57.7 .C66 2001w| LCc| 1i| 30372011572994d| 11/12/2012f| 11/12/2012g| 1l| JGESm| JOYNERp| $46.55r| Ys| Yt| JGESBKu| 7/22/2002x| BOOKz| JSTACKSo| .STAFF. 0;

Computational combinatorial optimization : optimal or provably near-optimal solutions / Michael Jun̈ger, Denis Naddef (eds.).

Other author	Jünger, M. (Michael)
Other author	Naddef, Denis, 1947-
Format	Electronic
Publication Info	Berlin ; New York : Springer, ©2001.
Description	viii, 303 pages ; 24 cm.
Supplemental Content	Restricted to Springer LINK subscribers
Subjects	Programming (Mathematics)--Congresses. Combinatorial optimization--Congresses.

Series	Lecture notes in computer science ; 2241 Lecture notes in computer science 2241. ^A466336
Contents	General mixed integer programming : computational issues for branch-and-cut algorithms / Alexander Martin -- Projection and lifting in combinatorial optimization / Egon Balas -- Mathematical programming models and formulations for deterministic production planning problems / Yves Pochet -- Lagrangian relaxation / Claude Lemaréchal -- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS / Matthias Elf ... [et al.] -- Branch, cut, and price : sequential and parallel / Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter, Jr. -- TSP cuts which do not conform to the template paradigm / David Applegate, Robert Bixby, Vašek Chvátal.
Bibliography note	Includes bibliographical references and index.
Other forms	Also available via the World Wide Web.
LCCN	2001057557
ISBN	3540428771 (softcover : alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	T57.7 .C66 2001	✔ Available	Place Hold

Computational combinatorial optimization : optimal or provably near-optimal solutions / Michael Jun̈ger, Denis Naddef (eds.).

Click here for more information about this title

Availability