Computational combinatorial optimization : optimal or provably near optimal solutions | Jünger, M. (Michael), Naddef, Denis, 1947-
Share on TelegramComputational combinatorial optimization : optimal or provably near optimal solutions
User Rating: Be the first one!
Author: Jünger, M. (Michael), Naddef, Denis, 1947-
Added by: sketch
Added Date: 2015-12-30
Publication Date: 2001
Language: eng
Subjects: Programming (Mathematics), Combinatorial optimization
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540428771
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 150.01 MB
PDF Size: 3.08 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 834
Views: 884
Total Files: 18
Media Type: texts
Description
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
Author: Michael Jünger, Denis Naddef
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42877-0
DOI: 10.1007/3-540-45586-8
Table of Contents:
Includes bibliographical references and index
Author: Michael Jünger, Denis Naddef
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42877-0
DOI: 10.1007/3-540-45586-8
Table of Contents:
- General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
- Projection and Lifting in Combinatorial Optimization
- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
- Lagrangian Relaxation
- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
- Branch, Cut, and Price: Sequential and Parallel
- TSP Cuts Which Do Not Conform to the Template Paradigm
Includes bibliographical references and index
