|
|
|
|
| LEADER |
03936nam a22003855i 4500 |
| 001 |
000285625 |
| 005 |
20210824155703.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170523s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319592503
|
| 024 |
7 |
|
|a 10.1007/978-3-319-59250-3
|2 doi
|
| 040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
| 245 |
1 |
0 |
|a Integer Programming and Combinatorial Optimization :
|b 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings /
|c edited by Friedrich Eisenbrand, Jochen Koenemann.
|
| 250 |
|
|
|a 1st ed. 2017.
|
| 260 |
# |
# |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a XI, 456 p. 34 illus. :
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 10328
|
| 505 |
0 |
|
|a 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. .
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Numeric Computing.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 700 |
1 |
|
|a Eisenbrand, Friedrich.
|e editor.
|
| 700 |
1 |
|
|a Koenemann, Jochen.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|