Integer Programming and Combinatorial Optimization
Springer International Publishing (Verlag)
978-3-031-06900-0 (ISBN)
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 beta -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.
Erscheinungsdatum | 03.06.2022 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XIII, 456 p. 50 illus., 35 illus. in color. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 718 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Mathematik / Informatik ► Mathematik ► Analysis | |
Schlagworte | Adaptive Algorithms • Applications • approximation algorithms • approximation ratios • approximation scheme • Approximation Theory • Artificial Intelligence • Combinatorial Mathematics • combinatorial optimization • Combinatorial Problems • Computer Science • Computer systems • conference proceedings • Correlation Analysis • Engineering • graph theory • Informatics • Internet • Mathematics • Optimization • polynomial approximation • Research • Signal Processing • theoretical computer science |
ISBN-10 | 3-031-06900-5 / 3031069005 |
ISBN-13 | 978-3-031-06900-0 / 9783031069000 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich