What do you think?
Rate this book
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
General Mixed Integer 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 Sequential and Parallel.- TSP Cuts Which Do Not Conform to the Template Paradigm.
320 pages, Paperback
Published March 12, 2014
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.