Cantitate/Preț
Produs
Total produse
Vezi coșul
Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings de Andrea Lodi

Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11480

Editat de Andrea Lodi, Viswanath Nagarajan
en Limba Engleză Paperback – 18 apr 2019
This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019.
The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 47940 lei

Preț vechi: 56400 lei
-15% Nou

Puncte Express: 719
Preț estimativ în valută:
9174€ • 9566$ • 7625£

Carte tipărită la comandă

Livrare economică 21 martie-04 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030179526
ISBN-10: 3030179524
Pagini: 445
Ilustrații: XI, 454 p. 313 illus., 20 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.65 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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 toRescue SoS: The Case of Makespan Scheduling.- Random Projections for Quadratic Programs over a Euclidean Ball.