000 | 04940nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-72792-7 | ||
003 | DE-He213 | ||
005 | 20240730195828.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540727927 _9978-3-540-72792-7 |
||
024 | 7 |
_a10.1007/978-3-540-72792-7 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aInteger Programming and Combinatorial Optimization _h[electronic resource] : _b12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings / _cedited by Matteo Fischetti, David P. Williamson. |
250 | _a1st ed. 2007. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
300 |
_aIX, 502 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4513 |
|
505 | 0 | _aSession 1 -- Inequalities from Two Rows of a Simplex Tableau -- Cuts for Conic Mixed-Integer Programming -- Sequential-Merge Facets for Two-Dimensional Group Problems -- Session 2 -- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) -- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization -- Finding a Polytope from Its Graph in Polynomial Time -- Session 3 -- Orbitopal Fixing -- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing -- Orbital Branching -- Session 4 -- Distinct Triangle Areas in a Planar Point Set -- Scheduling with Precedence Constraints of Low Fractional Dimension -- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems -- Session 5 -- On Integer Programming and the Branch-Width of the Constraint Matrix -- Matching Problems in Polymatroids Without Double Circuits -- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) -- Session 6 -- On a Generalization of the Master Cyclic Group Polyhedron -- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications -- On the Exact Separation of Mixed Integer Knapsack Cuts -- Session 7 -- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization -- On Convex Minimization over Base Polytopes -- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems -- Session 8 -- Generating Multiple Solutions for Mixed Integer Programming Problems -- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations -- DINS, a MIP Improvement Heuristic -- Session 9 -- Mixed-Integer Vertex Covers on Bipartite Graphs -- On the MIR Closure of Polyhedra -- The Intersection of ContinuousMixing Polyhedra and the Continuous Mixing Polyhedron with Flows -- Session 10 -- Simple Explicit Formula for Counting Lattice Points of Polyhedra -- Characterizations of Total Dual Integrality -- Sign-Solvable Linear Complementarity Problems -- Session 11 -- An Integer Programming Approach for Linear Programs with Probabilistic Constraints -- Infrastructure Leasing Problems -- Robust Combinatorial Optimization with Exponential Scenarios -- Session 12 -- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities -- Optimal Efficiency Guarantees for Network Design Mechanisms -- The Set Connector Problem in Graphs. | |
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aProbabilities. _94604 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aTheory of Computation. _9161451 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aProbability Theory. _917950 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
700 | 1 |
_aFischetti, Matteo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9161452 |
|
700 | 1 |
_aWilliamson, David P. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _973084 |
|
710 | 2 |
_aSpringerLink (Online service) _9161453 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540727910 |
776 | 0 | 8 |
_iPrinted edition: _z9783540838913 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4513 _9161454 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-72792-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c95795 _d95795 |