Cantitate/Preț
Produs
Total produse
Vezi coșul
Integer Programming and Combinatorial Optimization de Karen Aardal

Integer Programming and Combinatorial Optimization: Lecture Notes in Computer Science

Editat de Karen Aardal, Laura Sanità
en Limba Engleză Paperback – 28 mai 2022
This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 53186 lei

Preț vechi: 66482 lei
-20%

Puncte Express: 798
Preț estimativ în valută:
9403€ • 11277$ • 8174£

Carte disponibilă

Livrare economică 20 februarie-06 martie
Livrare express 05-11 februarie pentru 4305 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031069000
ISBN-10: 3031069005
Pagini: 472
Ilustrații: XIII, 456 p. 50 illus., 35 illus. in color.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.71 kg
Ediția:1st edition 2022
Editura: Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.