Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions /

Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions /

Show other versions (2)

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation a...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Jünger, M (Michael) (Editor, http://id.loc.gov/vocabulary/relators/edt), Naddef, Denis, 1947- (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: Book
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001
Edition:First edition 2001
Series:Computer Science (Springer-11645)
Lecture notes in computer science 2241
Subjects:
Algorithms
Business > Data processing
Combinatorial analysis
Computer science > Mathematics
Data structures (Computer science)
Information technology
Mathematical optimization
Optimization
Algorithm Analysis and Problem Complexity
Combinatorics
Data Structures
Discrete Mathematics in Computer Science
IT in Business

Internet

This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.

Similar Items