000 | 04614nam a22006615i 4500 | ||
---|---|---|---|
001 | 978-3-540-25960-2 | ||
003 | DE-He213 | ||
005 | 20240423125653.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540259602 _9978-3-540-25960-2 |
||
024 | 7 |
_a10.1007/b97946 _2doi |
|
050 | 4 | _aQA273.A1-274.9 | |
072 | 7 |
_aPBT _2bicssc |
|
072 | 7 |
_aPBWL _2bicssc |
|
072 | 7 |
_aMAT029000 _2bisacsh |
|
072 | 7 |
_aPBT _2thema |
|
072 | 7 |
_aPBWL _2thema |
|
082 | 0 | 4 |
_a519.2 _223 |
245 | 1 | 0 |
_aInteger Programming and Combinatorial Optimization _h[electronic resource] : _b10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings / _cedited by George Nemhauser, Daniel Bienstock. |
250 | _a1st ed. 2004. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
300 |
_aXII, 448 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3064 |
|
505 | 0 | _aSession 1 -- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem -- Metric Inequalities and the Network Loading Problem -- Valid Inequalities Based on Simple Mixed-Integer Sets -- Session 2 -- The Price of Anarchy when Costs Are Non-separable and Asymmetric -- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem -- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games -- Session 3 -- A Robust Optimization Approach to Supply Chain Management -- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems -- Scheduling an Industrial Production Facility -- Session 4 -- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs -- A TDI Description of Restricted 2-Matching Polytopes -- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems -- Session 5 -- Semi-continuous Cuts for Mixed-Integer Programming -- Combinatorial Benders’ Cuts -- A Faster Exact Separation Algorithm for Blossom Inequalities -- Session 6 -- LP-based Approximation Algorithms for Capacitated Facility Location -- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem -- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization -- Session 7 -- Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions -- The Path-Packing Structure of Graphs -- More on a Binary-Encoded Coloring Formulation -- Session 8 -- Single Machine Scheduling with Precedence Constraints -- The Constrained Minimum Weighted Sum of Job Completion Times Problem -- Session 9 -- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption -- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.-All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables -- Session 10 -- A Capacity Scaling Algorithm for M-convex Submodular Flow -- Integer Concave Cocirculations and Honeycombs -- Minsquare Factors and Maxfix Covers of Graphs -- Session 11 -- Low-Dimensional Faces of Random 0/1-Polytopes -- On Polyhedra Related to Even Factors -- Optimizing over Semimetric Polytopes. | |
650 | 0 | _aProbabilities. | |
650 | 0 | _aMathematics. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aProbability Theory. |
650 | 2 | 4 | _aApplications of Mathematics. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aNemhauser, George. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aBienstock, Daniel. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540221135 |
776 | 0 | 8 |
_iPrinted edition: _z9783662198117 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3064 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b97946 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c180474 _d180474 |