Contact
How to shop
Delivery
Shopping guide
Towards the optimum by semidefinite and copositive programming
New approach to approximate hard optimization problems
English
152 b
Up to 30 days for returns
Customers also purchased
/
Hardback
140.08
€
273.97 лв
/
Paperback
35.63
€
69.69 лв
/
Paperback
17.92
€
35.04 лв
/
Paperback
39.38
€
77.02 лв
/
Paperback
25.67
€
50.21 лв
/
Paperback
15.86
€
31.02 лв
/
Paperback
13.91
€
27.21 лв
Semidefinite and copositive programming have attained an§important role in combinatorial optimization in the§last two decades.§There is a strong evidence that semidefinite and§copositive§approximation models are significantly stronger than§the purely§linear ones for many combinatorial problems. In some§cases the§copositive models give even the exact value of the§problem.§§§The first part of the book contains beside a survey of§standard results from linear algebra and conic§programming also a new§method to solve semidefinite programs, based on the§augmented§Lagrangian method. This method named the Boundary§point method§goes far beyond the reach of interior point methods§when the linear§constraints are nearly orthogonal.§§The second part demonstrates the application of§semidefinite and§copositive programming to the following NP-hard§problems from§combinatorial optimization: the bandwidth problem,§the quadratic§assignment problem, the min-cut problem and the§general graph§partitioning problem. The book also provides the§ideas how to extend the approach§to some other 0-1 problems, like the§ stability number problem and the balanced vertex§separator problem.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
25.05
€
49.00 лв
/
Hardback
26.49
€
51.81 лв
/
Paperback
24.03
€
46.99 лв
/
Paperback
18.02
€
35.24 лв
Hi! I'm Libroamiko, your book advisor.
How can I help you?