Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization

, by
Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization by Tuncel, Levent, 9780821833520
Write a Review
Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
  • ISBN: 9780821833520 | 0821833529
  • Cover: Hardcover
  • Copyright: 11/28/2010

  • Rent

    (Recommended)

    $55.49
     
    Term
    Due
    Price
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

  • Buy New

    Usually Ships in 3-5 Business Days

    $79.79

Introduction Duality theory Ellipsoid method Primal-dual interior-point methods Approximation algorithms based on SDP Geometric representations of graphs Lift-and-project procedures for combinatorial optimization problems Lift-and-project ranks for combinatorial optimzation Successive convex relaxation methods Connections to other areas of mathematics An application to discrepancy theory SDP representability Bibliography Index
Loading Icon

Please wait while the item is added to your bag...
Continue Shopping Button
Checkout Button
Loading Icon
Continue Shopping Button