國立虎尾科技大學 |

Integer Programming and Combinatorial Optimization = 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Integer Programming and Combinatorial Optimization/ edited by Mohit Singh, David P. Williamson.
其他題名:	22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings /
其他作者:	Williamson, David P.
面頁冊數:	XI, 490 p. 51 illus., 34 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Software Engineering/Programming and Operating Systems. -
電子資源:	https://doi.org/10.1007/978-3-030-73879-2
ISBN:	9783030738792

Integer Programming and Combinatorial Optimization = 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings /
Integer Programming and Combinatorial Optimization22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings /[electronic resource] :edited by Mohit Singh, David P. Williamson. - 1st ed. 2021. - XI, 490 p. 51 illus., 34 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12707. - Theoretical Computer Science and General Issues ;9163.

Improving 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.

This 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.

ISBN: 9783030738792

Standard No.: 10.1007/978-3-030-73879-2doiSubjects--Topical Terms:

669780
Software Engineering/Programming and Operating Systems.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Integer Programming and Combinatorial Optimization = 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings /
LDR:04545nam a22004215i 4500 001 1053689
003 DE-He213
005 20210826161028.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030738792 $9 978-3-030-73879-2
024 7 $a 10.1007/978-3-030-73879-2 $2 doi
035 $a 978-3-030-73879-2
050 4 $a QA76.9.M35
072 7 $a UYA $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYA $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Integer Programming and Combinatorial Optimization $h [electronic resource] : $b 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / $c edited by Mohit Singh, David P. Williamson.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XI, 490 p. 51 illus., 34 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12707
505 0 $a Improving 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 $a This 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 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Computer Communication Networks. $3 669310
650 1 4 $a Mathematics of Computing. $3 669457
650 0 $a Software engineering. $3 562952
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Algorithms. $3 527865
650 0 $a Computer communication systems. $3 1115394
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Williamson, David P. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 837080
700 1 $a Singh, Mohit. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 837094
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030738785
776 0 8 $i Printed edition: $z 9783030738808
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-73879-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)