Katalog der Deutschen Nationalbibliothek
Ergebnis der Suche nach: tit all "Integer and Combinatorial Optimization"
Treffer 2 von 49
|
|
| Link zu diesem Datensatz | https://d-nb.info/1330370252 |
| Titel | Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings / edited by Jens Vygen, Jarosław Byrka |
| Person(en) |
Vygen, Jens (Herausgeber) Byrka, Jarosław (Herausgeber) |
| Organisation(en) | SpringerLink (Online service) (Sonstige) |
| Ausgabe | 1st ed. 2024 |
| Verlag | Cham : Springer Nature Switzerland, Imprint: Springer |
| Zeitliche Einordnung | Erscheinungsdatum: 2024 |
| Umfang/Format | Online-Ressource, XIII, 462 p. 47 illus., 22 illus. in color. : online resource. |
| Andere Ausgabe(n) |
Printed edition:: ISBN: 978-3-031-59834-0 Printed edition:: ISBN: 978-3-031-59836-4 |
| Inhalt | 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 |
| Persistent Identifier |
URN: urn:nbn:de:101:1-2405230409242.591994992001 DOI: 10.1007/978-3-031-59835-7 |
| URL | https://doi.org/10.1007/978-3-031-59835-7 |
| ISBN/Einband/Preis | 978-3-031-59835-7 |
| Sprache(n) | Englisch (eng) |
| Beziehungen | Lecture Notes in Computer Science ; 14679 |
| DDC-Notation | 519.6 (maschinell ermittelte DDC-Kurznotation) |
| Sachgruppe(n) | 510 Mathematik |
| Online-Zugriff | Archivobjekt öffnen |
Treffer 2 von 49
Administration
