LEADER 06244nam 22007815 450 001 996466121403316 005 20200702122526.0 010 $a3-540-49245-3 024 7 $a10.1007/3-540-59408-6 035 $a(CKB)1000000000234273 035 $a(SSID)ssj0000324035 035 $a(PQKBManifestationID)11255471 035 $a(PQKBTitleCode)TC0000324035 035 $a(PQKBWorkID)10303983 035 $a(PQKB)10276960 035 $a(DE-He213)978-3-540-49245-0 035 $a(PPN)155221914 035 $a(EXLCZ)991000000000234273 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteger Programming and Combinatorial Optimization$b[electronic resource] $e4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings /$fedited by Egon Balas, Jens Clausen 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (X, 474 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v920 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-59408-6 327 $aImproved approximation algorithms for MAX k-CUT and MAX BISECTION -- Approximating minimum feedback sets and multi-cuts in directed graphs -- Nonlinear formulations and improved randomized approximation algorithms for multicut problems -- Separating clique tree and bipartition inequalities in polynomial time -- The interval order polytope of a digraph -- Separation problems for the stable set polytope -- Computational study of a family of mixed-integer quadratic programming problems -- A minimal algorithm for the Bounded Knapsack Problem -- A framework for tightening 0?1 programs based on extensions of pure 0?1 KP and SS problems -- Combining semidefinite and polyhedral relaxations for integer programs -- Distributed near-optimal matching -- The random linear bottleneck assignment problem -- On implementing push-relabel method for the maximum flow problem -- Use of hidden network structure in the set partitioning problem -- Generalized max flows and augmenting paths -- Oriented matroid polytopes and polyhedral fans are signable -- On combinatorial properties of binary spaces -- Coverings and delta-coverings -- The topological structure of maximal lattice free convex bodies: The general case -- The Hilbert basis of the cut cone over the complete graph K 6 -- GRIN: An implementation of Gröbner bases for integer programming -- Scheduling jobs of equal length: Complexity, facets and computational results -- Formulating a scheduling problem with almost identical jobs by using positional completion times -- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds -- A mickey-mouse decomposition theorem -- Minimum cost dynamic flows: The series-parallel case -- (0, ±1) ideal matrices -- Embedding graphs in the torus in linear time -- A characterization of Seymour graphs -- The Markov chain of colourings -- Packing algorithms for arborescences (and spanning trees) in capacitated graphs -- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem -- How to make a strongly connected digraph two-connected -- Polyhedra and optimization in connection with a weak majorization ordering -- Combining and strengthening Gomory cuts -- Sequence independent lifting of cover inequalities. 330 $aThis volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sponsorship of the Mathematical Programming Society. Integer programming and combinatorial optimization provide a fruitful theoretical and algorithmic basis for the solution of a number of optimization problems occuring in real-world situations, such as production planning and scheduling, routing, crew scheduling, or network construction. This volume presents 36 revised papers selected from a total of 105 submissions and offers a representative up-to-date snapshot on the state of the art in this interdisciplinary area of research and applications. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v920 606 $aComputers 606 $aProbabilities 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aAlgorithms 606 $aNumerical analysis 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 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aNumerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M14050 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aProbabilities. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aProbability Theory and Stochastic Processes. 615 24$aApplications of Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNumerical Analysis. 615 24$aCombinatorics. 676 $a519.7/7 702 $aBalas$b Egon$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aClausen$b Jens$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Integer and Combinatorial Optimization$d(4th :$f1995 :$eCopenhagen, Denmark) 906 $aBOOK 912 $a996466121403316 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNISA