{
"item_title" : "Linear and Integer Programming Vs Linear Integration and Counting",
"item_author" : [" Jean-Bernard Lasserre "],
"item_description" : "I Linear Integration and Linear Programming.- The Linear Integration Problem I.- Comparing the Continuous Problems P and I.- II Linear Counting and Integer Programming.- The Linear Counting Problem I.- Relating the Discrete Problems P and I with P.- III Duality.- Duality and Gomory Relaxations.- Barvinok#x2019;s Counting Algorithm and Gomory Relaxations.- A Discrete Farkas Lemma.- The Integer Hull of a Convex Rational Polytope.- Duality and Superadditive Functions.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/44/191/853/1441918531_b.jpg",
"price_data" : {
"retail_price" : "109.99", "online_price" : "109.99", "our_price" : "109.99", "club_price" : "109.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Linear and Integer Programming Vs Linear Integration and Counting : A Duality Viewpoint
Overview
I Linear Integration and Linear Programming.- The Linear Integration Problem I.- Comparing the Continuous Problems P and I.- II Linear Counting and Integer Programming.- The Linear Counting Problem I.- Relating the Discrete Problems P and I with P.- III Duality.- Duality and Gomory Relaxations.- Barvinok#x2019;s Counting Algorithm and Gomory Relaxations.- A Discrete Farkas Lemma.- The Integer Hull of a Convex Rational Polytope.- Duality and Superadditive Functions.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9781441918536
- ISBN-10: 1441918531
- Publisher: Springer
- Publish Date: December 2010
- Dimensions: 10 x 7 x 0.39 inches
- Shipping Weight: 0.73 pounds
- Page Count: 168
Related Categories
