國立虎尾科技大學 |

Integer Programming and Combinatorial Optimization = 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Integer Programming and Combinatorial Optimization/ edited by Karen Aardal, Laura Sanità.
其他題名:	23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings /
其他作者:	Sanità, Laura.
面頁冊數:	XIII, 456 p. 50 illus., 35 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer and Information Systems Applications. -
電子資源:	https://doi.org/10.1007/978-3-031-06901-7
ISBN:	9783031069017

Integer Programming and Combinatorial Optimization = 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings /
Integer Programming and Combinatorial Optimization23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings /[electronic resource] :edited by Karen Aardal, Laura Sanità. - 1st ed. 2022. - XIII, 456 p. 50 illus., 35 illus. in color.online resource. - Lecture Notes in Computer Science,132651611-3349 ;. - Lecture Notes in Computer Science,9324.

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

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

ISBN: 9783031069017

Standard No.: 10.1007/978-3-031-06901-7doiSubjects--Topical Terms:

1365732
Computer and Information Systems Applications.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Integer Programming and Combinatorial Optimization = 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings /
LDR:04247nam a22004095i 4500 001 1086668
003 DE-He213
005 20220527013832.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031069017 $9 978-3-031-06901-7
024 7 $a 10.1007/978-3-031-06901-7 $2 doi
035 $a 978-3-031-06901-7
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
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 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings / $c edited by Karen Aardal, Laura Sanità.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIII, 456 p. 50 illus., 35 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 Lecture Notes in Computer Science, $x 1611-3349 ; $v 13265
505 0 $a Total 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 $a This 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 2 4 $a Computer and Information Systems Applications. $3 1365732
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 1 4 $a Mathematics of Computing. $3 669457
650 0 $a Application software. $3 528147
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Mathematics—Data processing. $3 1365953
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Sanità, Laura. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1266047
700 1 $a Aardal, Karen. $e editor. $1 https://orcid.org/0000-0001-5974-6219 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1393514
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031069000
776 0 8 $i Printed edition: $z 9783031069024
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-06901-7
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)