001447287 000__ 05025cam\a2200565Ii\4500
001447287 001__ 1447287
001447287 003__ OCoLC
001447287 005__ 20230310004110.0
001447287 006__ m\\\\\o\\d\\\\\\\\
001447287 007__ cr\un\nnnunnun
001447287 008__ 220607s2022\\\\sz\a\\\\o\\\\\101\0\eng\d
001447287 019__ $$a1321899491$$a1323254537
001447287 020__ $$a9783031069017$$q(electronic bk.)
001447287 020__ $$a3031069013$$q(electronic bk.)
001447287 020__ $$z9783031069000
001447287 020__ $$z3031069005
001447287 0247_ $$a10.1007/978-3-031-06901-7$$2doi
001447287 035__ $$aSP(OCoLC)1325717650
001447287 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dOCLCF$$dUKAHL$$dOCLCQ
001447287 049__ $$aISEA
001447287 050_4 $$aT57.74
001447287 08204 $$a519.7/7$$223/eng/20220607
001447287 1112_ $$aConference on Integer Programming and Combinatorial Optimization$$n(23rd :$$d2022 :$$cEindhoven, Netherlands)
001447287 24510 $$aInteger programming and combinatorial optimization :$$b23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings /$$cKaren Aardal, Laura Sanità (eds.).
001447287 2463_ $$aIPCO 2022
001447287 264_1 $$aCham, Switzerland :$$bSpringer,$$c2022.
001447287 300__ $$a1 online resource (xiii, 456 pages) :$$billustrations (some color)
001447287 336__ $$atext$$btxt$$2rdacontent
001447287 337__ $$acomputer$$bc$$2rdamedia
001447287 338__ $$aonline resource$$bcr$$2rdacarrier
001447287 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13265
001447287 500__ $$aIncludes author index.
001447287 5050_ $$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.
001447287 506__ $$aAccess limited to authorized users.
001447287 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.
001447287 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed June 7, 2022).
001447287 650_0 $$aInteger programming$$vCongresses.
001447287 650_0 $$aCombinatorial optimization$$vCongresses.
001447287 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001447287 655_0 $$aElectronic books.
001447287 7001_ $$aAardal, K.$$q(Karen),$$eeditor.$$1https://orcid.org/0000-0001-5974-6219
001447287 7001_ $$aSanità, Laura,$$eeditor.
001447287 77608 $$iPrint version: $$z3031069005$$z9783031069000$$w(OCoLC)1313386997
001447287 830_0 $$aLecture notes in computer science ;$$v13265.$$x1611-3349
001447287 852__ $$bebk
001447287 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-06901-7$$zOnline Access$$91397441.1
001447287 909CO $$ooai:library.usi.edu:1447287$$pGLOBAL_SET
001447287 980__ $$aBIB
001447287 980__ $$aEBOOK
001447287 982__ $$aEbook
001447287 983__ $$aOnline
001447287 994__ $$a92$$bISE