Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6080
Editat de Friedrich Eisenbrand, Bruce Shepherden Limba Engleză Paperback – iun 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei - 20%
Preț: 629.71 lei -
Preț: 395.25 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 342.61 lei - 20%
Preț: 327.36 lei - 20%
Preț: 336.86 lei - 20%
Preț: 487.46 lei - 20%
Preț: 324.19 lei - 20%
Preț: 432.78 lei - 20%
Preț: 293.24 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 850.42 lei - 20%
Preț: 328.94 lei - 20%
Preț: 573.45 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 679.09 lei - 20%
Preț: 373.16 lei - 20%
Preț: 782.57 lei - 20%
Preț: 434.17 lei - 20%
Preț: 489.11 lei - 20%
Preț: 904.16 lei - 20%
Preț: 375.72 lei - 20%
Preț: 400.17 lei - 20%
Preț: 631.96 lei - 20%
Preț: 373.80 lei - 20%
Preț: 556.96 lei - 20%
Preț: 731.97 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 15%
Preț: 558.12 lei - 20%
Preț: 400.77 lei - 20%
Preț: 488.90 lei - 20%
Preț: 340.04 lei - 20%
Preț: 403.00 lei - 20%
Preț: 327.36 lei - 20%
Preț: 330.54 lei - 20%
Preț: 568.70 lei - 20%
Preț: 563.29 lei - 20%
Preț: 315.62 lei - 20%
Preț: 355.27 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 519.32 lei
Preț: 330.54 lei
Preț vechi: 413.16 lei
-20%
Puncte Express: 496
Preț estimativ în valută:
58.45€ • 68.60$ • 50.70£
58.45€ • 68.60$ • 50.70£
Carte disponibilă
Livrare economică 16 februarie-02 martie
Specificații
ISBN-13: 9783642130359
ISBN-10: 3642130356
Pagini: 479
Ilustrații: XIII, 466 p. 45 illus.
Greutate: 0.73 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642130356
Pagini: 479
Ilustrații: XIII, 466 p. 45 illus.
Greutate: 0.73 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Solving LP Relaxations of Large-Scale Precedence Constrained Problems.- Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings.- Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems.- Restricted b-Matchings in Degree-Bounded Graphs.- Zero-Coefficient Cuts.- Prize-Collecting Steiner Network Problems.- On Lifting Integer Variables in Minimal Inequalities.- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities.- On Generalizations of Network Design Problems with Degree Bounds.- A Polyhedral Study of the Mixed Integer Cut.- Symmetry Matters for the Sizes of Extended Formulations.- A 3-Approximation for Facility Location with Uniform Capacities.- Secretary Problems via Linear Programming.- Branched Polyhedral Systems.- Hitting Diamonds and Growing Cacti.- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs.- Universal Sequencing on a Single Machine.- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.- Integer Quadratic Quasi-polyhedra.- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs.- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.- Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain.- The Price of Collusion in Series-Parallel Networks.- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron.- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.- On Column-Restricted and Priority Covering Integer Programs.- On k-Column Sparse Packing Programs.- Hypergraphic LP Relaxations for Steiner Trees.-Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.- Efficient Algorithms for Average Completion Time Scheduling.- Experiments with Two Row Tableau Cuts.- An OPT?+?1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.- On the Rank of Cutting-Plane Proof Systems.