Skip to content

Computational Combinatorial Optimization Optimal or Provably Near-Optimal
Stock Photo: Cover May Be Different

Computational Combinatorial Optimization Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science) Paperback - 2001 - 2001st Edition

by Jünger, Michael [Editor]; Naddef, Denis [Editor];


From the publisher

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

First line

A general mixed integer program (MIP) is the problem of optimizing a linear objective function subject to a system of linear constraints, where some or all of the variables are required to be integer.

Details

  • Title Computational Combinatorial Optimization Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)
  • Author Jünger, Michael [Editor]; Naddef, Denis [Editor];
  • Binding Paperback
  • Edition number 2001st
  • Edition 2001
  • Language ENG
  • Publisher Springer
  • Date December 18, 2001
  • ISBN 9783540428770
Back to Top

More Copies for Sale

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture...
Stock Photo: Cover May Be Different

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241)

  • Used
  • as new
  • Paperback
Condition
As New
Binding
Paperback
ISBN 10 / ISBN 13
9783540428770 / 3540428771
Quantity Available
1
Seller
Seattle, Washington, United States
Seller rating:
This seller has earned a 4 of 5 Stars rating from Biblio customers.
Item Price
$28.00
$4.45 shipping to USA

Show Details

Description:
Springer, 2001. Trade Paperback. As New. As new in publisher's original shrink wrap.
Item Price
$28.00
$4.45 shipping to USA
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture...
Stock Photo: Cover May Be Different

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)

  • Used
  • good
  • Paperback
Condition
Used - Good
Binding
Paperback
ISBN 10 / ISBN 13
9783540428770 / 3540428771
Quantity Available
1
Seller
Simi Valley, California, United States
Seller rating:
This seller has earned a 3 of 5 Stars rating from Biblio customers.
Item Price
$48.25
$3.99 shipping to USA

Show Details

Description:
Springer, 2001-12-18. Paperback. Good. 0.7008 9.2008 6.0984. Ex- library book with stamps/ stickers\r\n
Item Price
$48.25
$3.99 shipping to USA
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions

Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions

by Michael Jünger

  • New
Condition
New
ISBN 10 / ISBN 13
9783540428770 / 3540428771
Quantity Available
774
Seller
Uxbridge, Greater London, United Kingdom
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$67.32
$10.12 shipping to USA

Show Details

Description:
New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions.
Item Price
$67.32
$10.12 shipping to USA
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
Stock Photo: Cover May Be Different

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

by Michael Junger

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9783540428770 / 3540428771
Quantity Available
10
Seller
Southport, Merseyside, United Kingdom
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$74.50
$12.61 shipping to USA

Show Details

Description:
Paperback / softback. New. This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches.
Item Price
$74.50
$12.61 shipping to USA
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture...
Stock Photo: Cover May Be Different

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241)

by Jünger, Michael [Editor]; Naddef, Denis [Editor];

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9783540428770 / 3540428771
Quantity Available
5
Seller
campbelltown, Florida, United States
Seller rating:
This seller has earned a 2 of 5 Stars rating from Biblio customers.
Item Price
$104.00
$10.00 shipping to USA

Show Details

Description:
Springer. paperback. New. 6x0x9. Brand New Book in Publishers original Sealing
Item Price
$104.00
$10.00 shipping to USA