000 05070nam a22005775i 4500
001 978-3-031-06901-7
003 DE-He213
005 20240730173135.0
007 cr nn 008mamaa
008 220527s2022 sz | s |||| 0|eng d
020 _a9783031069017
_9978-3-031-06901-7
024 7 _a10.1007/978-3-031-06901-7
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aInteger Programming and Combinatorial Optimization
_h[electronic resource] :
_b23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings /
_cedited by Karen Aardal, Laura Sanità.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIII, 456 p. 50 illus., 35 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13265
505 0 _aTotal 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.
520 _aThis 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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aMathematics
_xData processing.
_919904
650 0 _aDiscrete mathematics.
_912873
650 0 _aApplication software.
_9107083
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aComputational Mathematics and Numerical Analysis.
_931598
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer and Information Systems Applications.
_9107084
700 1 _aAardal, Karen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9107085
700 1 _aSanità, Laura.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9107086
710 2 _aSpringerLink (Online service)
_9107087
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031069000
776 0 8 _iPrinted edition:
_z9783031069024
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13265
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-06901-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88760
_d88760