000 | 04581nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-48777-7 | ||
003 | DE-He213 | ||
005 | 20240423132452.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540487777 _9978-3-540-48777-7 |
||
024 | 7 |
_a10.1007/3-540-48777-8 _2doi |
|
050 | 4 | _aQA297.4 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aMAT008000 _2bisacsh |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a511.1 _223 |
245 | 1 | 0 |
_aInteger Programming and Combinatorial Optimization _h[electronic resource] : _b7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings / _cedited by Gerard Cornuejols, Rainer E. Burkard, Gerhard J. Woeginger. |
250 | _a1st ed. 1999. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999. |
|
300 |
_aX, 462 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 ; _v1610 |
|
505 | 0 | _aMarket Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances -- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts -- Solving the Convex Cost Integer Dual Network Flow Problem -- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem -- Valid Inequalities for Problems with Additive Variable Upper Bounds -- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version) -- On the Separation of Maximally Violated mod-k Cuts -- Improved Approximation Algorithms for Capacitated Facility Location Problems -- Optimal 3-Terminal Cuts and Linear Programming -- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem -- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube -- Universally Maximum Flow with Piecewise-Constant Capacities -- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope -- An Orientation Theorem with Parity Conditions -- Parity Constrained k-Edge-Connected Orientations -- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs -- On the Chvátal Rank of Certain Inequalities -- The Square-Free 2-Factor Problem in Bipartite Graphs -- The m-Cost ATSP -- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem -- Edge-Splitting Problems with Demands -- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors -- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract) -- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms -- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow -- Approximation Algorithms for a Directed Network Design Problem -- Optimizing over AllCombinatorial Embeddings of a Planar Graph (Extended Abstract) -- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts -- Scheduling Two Machines with Release Times -- An Introduction to Empty Lattice Simplices -- On Optimal Ear-Decompositions of Graphs -- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract) -- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. | |
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aProbabilities. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 1 | 4 | _aDiscrete Mathematics. |
650 | 2 | 4 | _aProbability Theory. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aCornuejols, Gerard. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aBurkard, Rainer E. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aWoeginger, Gerhard J. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540660194 |
776 | 0 | 8 |
_iPrinted edition: _z9783662178744 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1610 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-48777-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188090 _d188090 |