Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3-5, 2024, Proceedings
| Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3-5, 2024, Proceedings |
| Autore | Vygen Jens |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing AG, , 2024 |
| Descrizione fisica | 1 online resource (474 pages) |
| Altri autori (Persone) | ByrkaJarosław |
| Collana | Lecture Notes in Computer Science Series |
| ISBN | 3-031-59835-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996601562503316 |
Vygen Jens
|
||
| Cham : , : Springer International Publishing AG, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings / / edited by Jens Vygen, Jarosław Byrka
| Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings / / edited by Jens Vygen, Jarosław Byrka |
| Autore | Vygen Jens |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (474 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) | ByrkaJarosław |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Mathematics - Data processing Discrete mathematics Application software Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Computer and Information Systems Applications |
| ISBN | 3-031-59835-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910864195903321 |
|
Vygen Jens
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||