Integer Programming and Combinatorial Optimization

Language: English

Published by Springer, Springer Mai 2022, 2022

3031069005 / 9783031069000

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

View this seller's items
Softcover

Condition: New

£ 80.36

£ 51.48 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -Total dual dyadicness and dyadic generating sets.- Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing.- On the maximal number of columns of a ¿ -modular matrix.- A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem.- aster Connectivity in Low-rank Hypergraphs via Expander Decomposition.- Improving the Cook et al. Proximity Bound Given Integral Valued Constraints.- Sparse Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary Variables.- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.- Optimal item pricing in online combinatorial auctions.- On Circuit Diameter Bounds via Circuit Imbalances.- A Simple Method for Convex Optimization in the Oracle Model.- On the Complexity of Separation From the Knapsack Polytope.- Simple odd ß -cycle inequalities for binary polynomial optimization.- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems.- Intersecting and dense restrictions of clutters in polynomial time.- LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization.- Generalized Malleable Scheduling under Concave Processing Speeds.- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.- Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation.- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs.- Matroid-Based TSP Rounding for Half-Integral Solutions.- The Two-Stripe Symmetric Circulant TSP is in P.- Jin and David Williamson An Abstract Model for Branch-and-Cut.- Neural networks with linear threshold activations: structure and algorithms.- A PTAS for the Horizontal Rectangle Stabbing Problem.- Lattice-free simplices with lattice width 2d - o(d) .- Graph Coloring and Semidefinite Rank.- .A Competitive Algorithm for Throughput Maximization on Identical Machines.- The Limits of Local Search for Weighted k-Set Packing.- The Secretary Problem with Distributions.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 472 pp. Englisch.

Seller Inventory # 9783031069000

Title
Integer Programming and Combinatorial Optimization
Author
Karen Aardal
Publisher
Springer, Springer Mai 2022
Publication year
2022
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3031069005
ISBN 13
9783031069000
Item weight
709 grams
Dimensions
235x155x26 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 51.48£ 64.34
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany