{
"item_title" : "Integer Programming and Combinatorial Optimization",
"item_author" : [" Michel Goemans", "José Correa "],
"item_description" : "On the Structure of Reduced Kernel Lattice Bases.- Constant Integrality Gap LP formulations of Unsplittable Flow on a Path.- Content Placement via the Exponential Potential Function Method.- Blocking Optimal Arborescences.- Matroid and Knapsack Center Problems.- On Some Generalizations of the Split Closure.- An Improved Integrality Gap for Asymmetric TSP Paths.- Two Dimensional Optimal Mechanism Design for a Sequencing Problem.- The Euclidean k-Supplier Problem.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/64/236/693/3642366937_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Integer Programming and Combinatorial Optimization : 16th International Conference, Ipco 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings
by Michel Goemans and José Correa
Overview
On the Structure of Reduced Kernel Lattice Bases.- Constant Integrality Gap LP formulations of Unsplittable Flow on a Path.- Content Placement via the Exponential Potential Function Method.- Blocking Optimal Arborescences.- Matroid and Knapsack Center Problems.- On Some Generalizations of the Split Closure.- An Improved Integrality Gap for Asymmetric TSP Paths.- Two Dimensional Optimal Mechanism Design for a Sequencing Problem.- The Euclidean k-Supplier Problem.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783642366932
- ISBN-10: 3642366937
- Publisher: Springer
- Publish Date: February 2013
- Dimensions: 9.21 x 6.14 x 0.85 inches
- Shipping Weight: 1.27 pounds
- Page Count: 400
Related Categories
