Integer programming and combinatorial optimization : 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings /: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings. (2019)

• Record Type: Book
• Other Titles: IPCO 2019
• Further Information: Note: Edited by Andrea Lodi, Viswanath Nagarajan.
• Editors: Lodi, Andrea; Nagarajan, Viswanath
• Other Names: Conference on Integer Programming and Combinatorial Optimization, 20th
• Contents: Identically Self-Blocking Clutters.- Min-Max Correlation Clustering via .- Strong Mixed-Integer Programming Formulations for Trained Neural.- Extended Formulations from Communication Protocols in Output-Efficient.- Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry.- Intersection Cuts for Polynomial Optimization.- Fixed-Order Scheduling on Parallel Machines.- Online Submodular Maximization: Beating 1/2 Made Simple.- Improving the Integrality Gap for Multiway Cut.- nell 1-sparsity Approximation Bounds for Packing Integer Programs.- A General Framework for Handling Commitment in Online Throughput Maximization.- Lower Bounds and A New Exact Approach for the Bilevel Knapsack with Interdiction Constraints.- On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.- Tight Approximation Ratio for Minimum Maximal Matching.- Integer Programming and Incidence Treedepth.- A Bundle Approach for SDPs with Exact Subgraph Constraints.- Dynamic Flows with Adaptive Route Choice.- The Markovian Price of Information.- On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem.- On Compact Representations of Voronoi Cells of Lattices.- An Efficient Characterization of Submodular Spanning Tree Games.- The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio.- Approximate Multi-Matroid Intersection via Iterative Refinement.- An Exact Algorithm for Robust Influence Maximization.- A New Contraction Technique with Applications to Congruency-Constrained Cuts.- Sparsity of Integer Solutions in the Average Case.- A Generic Exact Solver for Vehicle Routing and Related Problems.- Earliest Arrival Transshipments in Networks With Multiple Sinks.- Intersection Cuts for Factorable MINLP.- Linear Programming Using Limited-Precision Oracles.- Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time.- Breaking Symmetries to Rescue SoS: The Case of Makespan Scheduling.- Random Projections for Quadratic Programs over a Euclidean Ball.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2019
• Extent: 1 online resource (xi, 454 pages), illustrations (some color)
• Subjects: 519.7/7; Integer programming -- Congresses; Combinatorial optimization -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030179533; 3030179532
• Related ISBNs: 9783030179526
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed May 10, 2019).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.