0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.) Loot Price: R1,398
Discovery Miles 13 980
Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.): Boris I. Goldengorin, Panos M. Pardalos

Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.)

Boris I. Goldengorin, Panos M. Pardalos

Series: SpringerBriefs in Optimization

 (sign in to rate)
Loot Price R1,398 Discovery Miles 13 980 | Repayment Terms: R131 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

"Data Correcting Approaches in Combinatorial Optimization" focuses on algorithmic applications of thewell known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and findwhich element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems. "

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: SpringerBriefs in Optimization
Release date: October 2012
First published: 2012
Authors: Boris I. Goldengorin • Panos M. Pardalos
Dimensions: 235 x 155 x 6mm (L x W x T)
Format: Paperback
Pages: 114
Edition: 2012 ed.
ISBN-13: 978-1-4614-5285-0
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Science & Mathematics > Mathematics > Optimization > General
Promotions
LSN: 1-4614-5285-6
Barcode: 9781461452850

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,431 Discovery Miles 54 310
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,278 Discovery Miles 72 780
Forbidden Configurations in Discrete…
David Eppstein Hardcover R3,401 Discovery Miles 34 010
Fixed Point Theory and Graph Theory…
Monther Alfuraidan, Qamrul Ansari Hardcover R1,973 Discovery Miles 19 730
Bent Functions - Results and…
Natalia Tokareva Paperback R1,547 Discovery Miles 15 470
Probability - Risk Management…
Daniel Covington Hardcover R994 Discovery Miles 9 940
Introduction to Graph Theory
Robin J. Wilson Paperback R1,369 Discovery Miles 13 690
Spectral Radius of Graphs
Dragan Stevanovic Paperback R1,014 Discovery Miles 10 140
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,951 Discovery Miles 49 510
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R3,140 Discovery Miles 31 400
Counting: Solutions Manual (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R1,164 Discovery Miles 11 640
Counting (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R803 Discovery Miles 8 030

See more

Partners