東華大學圖書館 |

Integer programming and combinatorial optimization = 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Integer programming and combinatorial optimization/ edited by Jens Vygen, Jarosław Byrka.
Reminder of title:	25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024 : proceedings /
remainder title:	IPCO 2024
other author:	Vygen, Jens.
corporate name:	Conference on Integer Programming and Combinatorial Optimization
Published:	Cham :Springer Nature Switzerland : : 2024.,
Description:	xiii, 462 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Sparsity and integrality gap transference bounds for integer programs -- Separating k-Median from the Supplier Version -- A Better-Than-1.6-Approximation for Prize-Collecting TSP -- On Matrices over a Polynomial Ring with Restricted Subdeterminants -- A First Order Method for Linear Programming Parameterized by Circuit Imbalance -- Approximately Packing Dijoins via Nowhere-Zero Flows -- Capacitated Facility Location with Outliers and Uniform Facility Costs -- Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones -- The Extension Complexity of Polytopes with Bounded Integral Slack Matrices -- Assortment Optimization with Visibility Constraints -- Adaptivity Gaps in Two-sided Assortment Optimization -- Two-Stage Stochastic Stable Matching -- Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory -- Fully-Dynamic Load Balancing -- Pairwise-Independent Contention Resolution -- An FPTAS for Connectivity Interdiction -- Tight Lower Bounds for Block-Structured Integer Programs -- A Lower Bound for the Max Entropy Algorithm for TSP -- On the Number of Degenerate Simplex Pivots -- On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms -- On the Congruency-Constrained Matroid Base -- Online Combinatorial Assignment in Independence Systems -- Decomposing Probability Marginals Beyond Affine Requirements -- Polynomial Algorithms to Minimize 2/3-Submodular Functions -- A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs -- Extending the primal-dual 2-approximation algorithm beyond uncrossable set families -- Network Flow Problems with Electric Vehicles -- Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack -- Relaxation strength for multilinear optimization: McCormick strikes back -- Online Algorithms for Spectral Hypergraph Sparsification -- Fast Combinatorial Algorithms for Efficient Sortation -- A New Branching Rule for Range Minimization Problems -- Sensitivity analysis for mixed binary quadratic programming.
Contained By:	Springer Nature eBook
Subject:	Integer programming - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-59835-7
ISBN:	9783031598357

Integer programming and combinatorial optimization = 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024 : proceedings /
Integer programming and combinatorial optimization25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024 : proceedings /[electronic resource] :IPCO 2024edited by Jens Vygen, Jarosław Byrka. - Cham :Springer Nature Switzerland :2024. - xiii, 462 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,146791611-3349 ;. - Lecture notes in computer science ;14679..

Sparsity and integrality gap transference bounds for integer programs -- Separating k-Median from the Supplier Version -- A Better-Than-1.6-Approximation for Prize-Collecting TSP -- On Matrices over a Polynomial Ring with Restricted Subdeterminants -- A First Order Method for Linear Programming Parameterized by Circuit Imbalance -- Approximately Packing Dijoins via Nowhere-Zero Flows -- Capacitated Facility Location with Outliers and Uniform Facility Costs -- Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones -- The Extension Complexity of Polytopes with Bounded Integral Slack Matrices -- Assortment Optimization with Visibility Constraints -- Adaptivity Gaps in Two-sided Assortment Optimization -- Two-Stage Stochastic Stable Matching -- Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory -- Fully-Dynamic Load Balancing -- Pairwise-Independent Contention Resolution -- An FPTAS for Connectivity Interdiction -- Tight Lower Bounds for Block-Structured Integer Programs -- A Lower Bound for the Max Entropy Algorithm for TSP -- On the Number of Degenerate Simplex Pivots -- On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms -- On the Congruency-Constrained Matroid Base -- Online Combinatorial Assignment in Independence Systems -- Decomposing Probability Marginals Beyond Affine Requirements -- Polynomial Algorithms to Minimize 2/3-Submodular Functions -- A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs -- Extending the primal-dual 2-approximation algorithm beyond uncrossable set families -- Network Flow Problems with Electric Vehicles -- Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack -- Relaxation strength for multilinear optimization: McCormick strikes back -- Online Algorithms for Spectral Hypergraph Sparsification -- Fast Combinatorial Algorithms for Efficient Sortation -- A New Branching Rule for Range Minimization Problems -- Sensitivity analysis for mixed binary quadratic programming.

This book constitutes the refereed proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2024, held in Wrocław, Poland, during July 3-5, 2024. The 33 full papers presented were carefully reviewed and selected from 101 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

ISBN: 9783031598357

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

844702
Integer programming
--Congresses.

LC Class. No.: T57.74

Dewey Class. No.: 519.77

Integer programming and combinatorial optimization = 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024 : proceedings /
LDR:03987nmm a2200349 a 4500 001 2371287
003 DE-He213
005 20240521125450.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031598357 $q (electronic bk.)
020 $a 9783031598340 $q (paper)
024 7 $a 10.1007/978-3-031-59835-7 $2 doi
035 $a 978-3-031-59835-7
040 $a GP $c GP
041 0 $a eng
050 4 $a T57.74
072 7 $a UYAM $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 519.77 $2 23
090 $a T57.74 $b .C748 2024
111 2 $a Conference on Integer Programming and Combinatorial Optimization $n (25th : $d 2024 : $c Wrocław, Poland) $3 3717196
245 1 0 $a Integer programming and combinatorial optimization $h [electronic resource] : $b 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024 : proceedings / $c edited by Jens Vygen, Jarosław Byrka.
246 3 $a IPCO 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xiii, 462 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 14679
505 0 $a Sparsity and integrality gap transference bounds for integer programs -- Separating k-Median from the Supplier Version -- A Better-Than-1.6-Approximation for Prize-Collecting TSP -- On Matrices over a Polynomial Ring with Restricted Subdeterminants -- A First Order Method for Linear Programming Parameterized by Circuit Imbalance -- Approximately Packing Dijoins via Nowhere-Zero Flows -- Capacitated Facility Location with Outliers and Uniform Facility Costs -- Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones -- The Extension Complexity of Polytopes with Bounded Integral Slack Matrices -- Assortment Optimization with Visibility Constraints -- Adaptivity Gaps in Two-sided Assortment Optimization -- Two-Stage Stochastic Stable Matching -- Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory -- Fully-Dynamic Load Balancing -- Pairwise-Independent Contention Resolution -- An FPTAS for Connectivity Interdiction -- Tight Lower Bounds for Block-Structured Integer Programs -- A Lower Bound for the Max Entropy Algorithm for TSP -- On the Number of Degenerate Simplex Pivots -- On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms -- On the Congruency-Constrained Matroid Base -- Online Combinatorial Assignment in Independence Systems -- Decomposing Probability Marginals Beyond Affine Requirements -- Polynomial Algorithms to Minimize 2/3-Submodular Functions -- A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs -- Extending the primal-dual 2-approximation algorithm beyond uncrossable set families -- Network Flow Problems with Electric Vehicles -- Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack -- Relaxation strength for multilinear optimization: McCormick strikes back -- Online Algorithms for Spectral Hypergraph Sparsification -- Fast Combinatorial Algorithms for Efficient Sortation -- A New Branching Rule for Range Minimization Problems -- Sensitivity analysis for mixed binary quadratic programming.
520 $a This book constitutes the refereed proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2024, held in Wrocław, Poland, during July 3-5, 2024. The 33 full papers presented were carefully reviewed and selected from 101 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
650 0 $a Integer programming $v Congresses. $3 844702
650 0 $a Combinatorial optimization $x Congresses. $3 705091
650 1 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 891040
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Computer and Information Systems Applications. $3 3538505
700 1 $a Vygen, Jens. $3 724479
700 1 $a Byrka, Jarosław. $3 3717197
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 14679. $3 3717198
856 4 0 $u https://doi.org/10.1007/978-3-031-59835-7
950 $a Computer Science (SpringerNature-11645)