Verwandte Artikel zu Integer Programming and Combinatorial Optimization:...

Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings - Softcover

 
9783319592510: Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings

Zu dieser ISBN ist aktuell kein Angebot verfügbar.

Inhaltsangabe

The Two-point Fano and Ideal Binary Clutters.- On Scheduling Coflows.- Integrality Gaps of Integer Knapsack Problems.- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut.- Approximation of Corner Polyhedra with Families of Intersection Cuts.- The Structure of the Infinite Models in Integer Programming.- Mixed-integer Linear Representability, Disjunctions, and Variable Elimination.- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.- Cutting Planes from Wide Split Disjunctions.- The Salesman's Improved Tours for Fundamental Classes.- The Heterogeneous Capacitated k-Center Problem.- Local Guarantees in Graph Cuts and Clustering.- Verifying Integer Programming Results.- Long term Behavior of Dynamic Equilibria in uid Queuing Networks.- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.- Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems.- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing.- Discrete Newton's Algorithm for Parametric Submodular Function Minimization.- Stochastic Online Scheduling on Unrelated Machines.- Online Matroid Intersection: Beating Half for Random Arrival.- Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector.- An Improved Deterministic Rescaling for Linear Programming Algorithms.- Min-Max Theorems for Packing and Covering Odd (u; v)-trails.- Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization.- A Quasi-Polynomial Approximation for the Restricted Assignment Problem.- Adaptive Submodular Ranking.- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem.- Minimum Birkhoff-von Neumann Decomposition.- Maximum Matching in the Online Batch-Arrival Model.- Budget Feasible Mechanisms on Matroids.- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method.- Mixed-integer Convex Representability.- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts.- Enumeration of Integer Points in Projections of Unbounded Polyhedral.- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings.- Equilibrium Computation in Atomic Splittable Singleton Congestion Games. 

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

(Keine Angebote verfügbar)

Buch Finden:



Kaufgesuch aufgeben

Sie kennen Autor und Titel des Buches und finden es trotzdem nicht auf ZVAB? Dann geben Sie einen Suchauftrag auf und wir informieren Sie automatisch, sobald das Buch verfügbar ist!

Kaufgesuch aufgeben

Weitere beliebte Ausgaben desselben Titels

9783319592497: Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings: ... Computer Science and General Issues)

Vorgestellte Ausgabe

ISBN 10:  3319592491 ISBN 13:  9783319592497
Verlag: Springer, 2017
Softcover