LEADER 06514nam 22007695 450 001 996465616503316 005 20200705205250.0 010 $a3-540-68453-0 024 7 $a10.1007/3-540-61310-2 035 $a(CKB)1000000000234461 035 $a(SSID)ssj0000324036 035 $a(PQKBManifestationID)11236832 035 $a(PQKBTitleCode)TC0000324036 035 $a(PQKBWorkID)10303680 035 $a(PQKB)10464644 035 $a(DE-He213)978-3-540-68453-4 035 $a(PPN)155180428 035 $a(EXLCZ)991000000000234461 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteger Programming and Combinatorial Optimization$b[electronic resource] $e5th International IPCO Conference Vancouver, British Columbia, Canada June 3?5, 1996 Proceedings /$fedited by William H. Cunningham, S. Thomas McCormick, Maurice Queyranne 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (X, 514 p. 18 illus.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1084 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61310-2 327 $aColourful linear programming -- Test sets and inequalities for integer programs -- An optimal, stable continued fraction algorithm for arbitrary dimension -- Algorithms and extended formulations for one and two facility network design -- Integer multicommodity flow problems -- A heuristic algorithm for the set covering problem -- An ?-Relaxation method for generalized separable convex cost network flow problems -- Finding real-valued single-source shortest paths in o(n 3) expected time -- A network-flow technique for finding low-weight bounded-degree spanning trees -- Approximating k-set cover and complementary graph coloring -- On minimum 3-cuts and approximating k-cuts using Cut Trees -- Primal-dual approximation algorithms for feedback problems in planar graphs -- Cone-LP's and semidefinite programs: Geometry and a simplex-type method -- Quadratic knapsack relaxations using cutting planes and semidefinite programming -- A semidefinite bound for mixing rates of Markov chains -- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases -- On optimizing multiplications of sparse matrices -- Continuous relaxations for Constrained Maximum-Entropy Sampling -- A submodular optimization problem with side constraints -- Convexity and Steinitz's exchange property -- On ideal clutters, metrics and multiflows -- A supermodular relaxation for scheduling with release dates -- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds -- Implementation of a linear time algorithm for certain generalized traveling salesman problems -- On dependent randomized rounding algorithms -- Coloring bipartite hypergraphs -- Improved randomized approximation algorithms for lot-sizing problems -- Minimizing total completion time in a two-machine flowshop: Analysis of special cases -- A new approach to computing optimal schedules for the job-shop scheduling problem -- Optimal on-line algorithms for single-machine scheduling -- The strongest facets of the acyclic subgraph polytope are unknown -- Transitive packing -- A polyhedral approach to the feedback vertex set problem -- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time -- Separating maximally violated comb inequalities in planar graphs -- The travelling salesman and the PQ-tree. 330 $aThis volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1084 606 $aComputers 606 $aProbabilities 606 $aSoftware engineering 606 $aAlgorithms 606 $aCalculus of variations 606 $aCombinatorics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCalculus of Variations and Optimal Control; Optimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26016 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aProbabilities. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aCalculus of variations. 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aProbability Theory and Stochastic Processes. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCalculus of Variations and Optimal Control; Optimization. 615 24$aCombinatorics. 676 $a519.7/7 702 $aCunningham$b William H$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMcCormick$b S. Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aQueyranne$b Maurice$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Integer Programming and Combinatorial Optimization$d(5th :$f1996 :$eVancouver, B.C.) 906 $aBOOK 912 $a996465616503316 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNISA