|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-72792-7 |
| 003 |
DE-He213 |
| 005 |
20230221123615.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540727927
|9 978-3-540-72792-7
|
| 024 |
7 |
|
|a 10.1007/978-3-540-72792-7
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Integer Programming and Combinatorial Optimization
|h [electronic resource] :
|b 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings /
|c edited by Matteo Fischetti, David P. Williamson.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a IX, 502 p.
|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
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4513
|
| 505 |
0 |
|
|a Session 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 Continuous Mixing 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Probabilities.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Probability Theory.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Numerical Analysis.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
|
|a Fischetti, Matteo.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Williamson, David P.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540838913
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540727910
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4513
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-72792-7
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
