000 04720nam a22006015i 4500
001 978-3-540-69346-8
003 DE-He213
005 20240423132432.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540693468
_9978-3-540-69346-8
024 7 _a10.1007/3-540-69346-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aInteger Programming and Combinatorial Optimization
_h[electronic resource] :
_b6th International IPCO Conference Houston, Texas, June 22–24, 1998 Proceedings /
_cedited by Robert E. Bixby, Andrew E. Boyd, Roger Z. Rios-Mercado.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aIX, 435 p. 55 illus., 18 illus. in color.
_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 ;
_v1412
505 0 _a0,1 Matrices, Matroids -- The Packing Property -- A Characterization of Weakly Bipartite Graphs -- Bipartite Designs -- Characterizing Noninteger Polyhedra with 0–1 Constraints -- A Theorem of Truemper -- The Generalized Stable Set Problem for Claw-Free Bidirected Graphs -- On a Min-max Theorem of Cacti -- Edge Connectivity -- Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs -- A New Bound for the 2-Edge Connected Subgraph Problem -- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs -- Algorithms -- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width -- Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs -- Approximation Algorithms for the Mixed Postman Problem -- Improved Approximation Algorithms for Uncapacitated Facility Location -- The Maximum Traveling Salesman Problem Under Polyhedral Norms -- Integer Programming Applications -- Polyhedral Combinatorics of Benzenoid Problems -- Consecutive Ones and a Betweenness Problem in Computational Biology -- Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables -- Integer Programming Computation -- The Intersection of Knapsack Polyhedra and Extensions -- New Classes of Lower Bounds for Bin Packing Problems -- Solving Integer and Disjunctive Programs by Lift and Project -- A Class of Hard Small 0—1 Programs -- Network Flows -- Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time -- Simple Generalized Maximum Flow Algorithms -- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem -- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow -- Scheduling -- Non-approximability Resultsfor Scheduling Problems with Minsum Criteria -- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems -- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines -- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems -- Quadratic Assignment Problems -- Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations -- Incorporating Inequality Constraints in the Spectral Bundle Method.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aMathematical optimization.
650 0 _aCalculus of variations.
650 1 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aCalculus of Variations and Optimization.
650 2 4 _aDiscrete Mathematics.
700 1 _aBixby, Robert E.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aBoyd, Andrew E.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRios-Mercado, Roger Z.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540645900
776 0 8 _iPrinted edition:
_z9783662189962
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1412
856 4 0 _uhttps://doi.org/10.1007/3-540-69346-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187722
_d187722