Muutke küpsiste eelistusi

Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings 2019 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 454 pages, kõrgus x laius: 235x155 mm, kaal: 712 g, 20 Illustrations, color; 293 Illustrations, black and white; XI, 454 p. 313 illus., 20 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11480
  • Ilmumisaeg: 18-Apr-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030179524
  • ISBN-13: 9783030179526
Teised raamatud teemal:
  • Pehme köide
  • Hind: 70,93 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 83,45 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings 2019 ed.Suurem pilt
  • Formaat: Paperback / softback, 454 pages, kõrgus x laius: 235x155 mm, kaal: 712 g, 20 Illustrations, color; 293 Illustrations, black and white; XI, 454 p. 313 illus., 20 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11480
  • Ilmumisaeg: 18-Apr-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030179524
  • ISBN-13: 9783030179526
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783030179526.html
Märksõnad:
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.
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.