Integer Programming and Combinatorial Optimization 8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001: Proceedings

Author/creator Aardal, K. Author
Other author Gerards, A. M. H. Author
Format Electronic
Publication InfoNew York : Springer
DescriptionXI, 423 p. ill 23.500 x 015.500 cm.
Supplemental ContentFull text available from Springer Books
Supplemental ContentFull text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present)
Subjects

SeriesLecture Notes in Computer Science Vol. 2081
Summary Annotation This book constitutes the reviewed proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2001, held in Utrecht, The Netherlands in June 2001. The 32 revised full papers presented were carefully reviewed and selected from a total of 108 submissions. The proceedings reflect most current directions in integer programming and optimization research. Among the topics covered are approximation algorithms, branch and bound algorithms, computational biology, computational complexity, algorithmic geometry, cutting plane algorithms, diophantine equations, geometry of members, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semidefinite programs.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
LCCN 2001041094
ISBN9783540422259
ISBN3540422250 (Trade Paper) Active Record
Standard identifier# 9783540422259
Stock number3540422250 00024965

Availability

Library Location Call Number Status Item Actions
Electronic Resources ✔ Available