000			05369nam a22006135i 4500
001			978-3-030-73879-2
003			DE-He213
005			20240423125404.0
007			cr nn 008mamaa
008			210408s2021 sz | s |||| 0|eng d
020			_a9783030738792 _9978-3-030-73879-2
024	7		_a10.1007/978-3-030-73879-2 _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] : _b22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / _cedited by Mohit Singh, David P. Williamson.
250			_a1st ed. 2021.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021.
300			_aXI, 490 p. 51 illus., 34 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		_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12707
505	0		_aImproving the Approximation Ratio for Capacitated Vehicle Routing -- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual -- Approximating the discrete time-cost tradeoff problem with bounded depth -- Sum-of-squares hierarchies for binary polynomial optimization -- Complexity, Exactness, and Rationality in Polynomial Optimization -- On the Geometry of Symmetry Breaking Inequalities -- Affinely representable lattices, stable matchings, and choice functions -- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows -- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices -- On the implementation and strengthening of intersection cuts for QCQPs -- Lifting Convex Inequalities for Bipartite Bilinear Programs -- A Computational Status Update for Exact Rational Mixed Integer Programming -- New Exact Techniques Applied to a Class of Network Flow Formulations -- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets -- Semi-Streaming Algorithms for Submodular Matroid Intersection -- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems -- On the recognition of {a,b,c}-modular matrices -- On the Power of Static Assignment Policies for Robust Facility Location Problems -- Robust k-Center with Two Types of Radii -- Speed-Robust Scheduling - Rocks, Bricks, and Sand -- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs -- Fast Quantum Subroutines for the Simplex Method -- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators -- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem -- Fixed Parameter Approximation Scheme for Min-max k-cut -- Computational Aspects of Relaxation Complexity -- Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II -- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs -- Proximity bounds for random integer programs -- On the Integrality Gap of Binary Integer Programs with Gaussian Data -- Linear Regression with Mismatched Data: a Provably Optimal Local Search Algorithm -- A New Integer Programming Formulation of the Graphical Traveling Salesman Problem -- Implications, conflicts, and reductions for Steiner trees.
520			_aThis book constitutes the proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization, IPCO 2021, which took place during May 19-21, 2021. The conference was organized by Georgia Institute of Technology and planned to take place it Atlanta, GA, USA, but changed to an online format due to the COVID-19 pandemic. The 33 papers included in this book were carefully reviewed and selected from 90 submissions. 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.
650		0	_aComputer networks .
650		0	_aAlgorithms.
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650		0	_aSoftware engineering.
650	1	4	_aMathematics of Computing.
650	2	4	_aComputer Communication Networks.
650	2	4	_aDesign and Analysis of Algorithms.
650	2	4	_aData Structures and Information Theory.
650	2	4	_aSoftware Engineering.
700	1		_aSingh, Mohit. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aWilliamson, David P. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783030738785
776	0	8	_iPrinted edition: _z9783030738808
830		0	_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12707
856	4	0	_uhttps://doi.org/10.1007/978-3-030-73879-2
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c177391 _d177391