Cantitate/Preț
Produs
Total produse
Vezi coșul
Integer Programming and Combinatorial Optimization: 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings de Jens Vygen

Integer Programming and Combinatorial Optimization: 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings: Lecture Notes in Computer Science, cartea 14679

Editat de Jens Vygen, Jarosław Byrka
en Limba Engleză Paperback – 22 mai 2024
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.
 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 47202 lei

Preț vechi: 59002 lei
-20% Nou

Puncte Express: 708
Preț estimativ în valută:
9034€ • 9406$ • 7634£

Carte indisponibilă temporar


Wish list
Gift list
Am citit!
Adaugă în listă
Doresc să fiu notificat când acest titlu va fi disponibil:
Trimite
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031598340
ISBN-10: 3031598342
Pagini: 462
Ilustrații: XIII, 462 p. 47 illus., 22 illus. in color.
Dimensiuni: 155 x 235 mm
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.