000			04728nam a22004335i 4500
988			_aSpringer_Computer_2022
999			_c382957 _d382957 _x1
001			382957
003			ES-MaUEC
005			20230102122030.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			221008s2022 sz | s |1|| 0|eng d
020			_a9783031069017
024	7		_a10.1007/978-3-031-06901-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aT57.74 _b2022 EB
245	0	0	_aInteger Programming and Combinatorial Optimization : _b23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings _cedited by Karen Aardal, Laura Sanità
250			_aFirst edition 2022
264		1	_aCham _bSpringer International Publising _c2022
300			_a1 recurso en línea (XIII, 456 páginas) _b50 ilustraciones, 35 ilustraciones a color
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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		7	_2embne _9143837 _aProgramación lineal _vCongresos y asambleas
650		7	_2embne _9157651 _aOptimización combinatoria _vCongresos y asambleas
700	1		_aAardal, Karen _eeditor literario _0(orcid)0000-0001-5974-6219 _1https://orcid.org/0000-0001-5974-6219 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aSanità, Laura _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt
776	0	8	_iPrinted edition: _z9783031069000
776	0	8	_iPrinted edition: _z9783031069024
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-06901-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b10/2022 _dz _eIG _zSI