scientific article; zbMATH DE number 3354799
From MaRDI portal
zbMath0223.90010MaRDI QIDQ5629416
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Projecting the flow variables for hub location problems, Combinatorial approaches to multiflow problems, A generalized cut-condition for multiflows in matroids, Routing of uncertain traffic demands, The multi-layered network design problem, Applications of cut polyhedra. II, The robust network loading problem with dynamic routing, Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem, Benders decomposition of the passive optical network design problem, Network loading problem: valid inequalities from 5- and higher partitions, New discoveries of domination between traffic matrices, Affine recourse for the robust network design problem: Between static and dynamic routing, A polyhedral study of the capacity formulation of the multilayer network design problem, One-third-integrality in the max-cut problem, A \(T_X\)-approach to some results on cuts and metrics, Separating tight metric inequalities by bilevel programming, Fixed charge multicommodity network design using \(p\)-partition facets, Solving survivable two-layer network design problems by metric inequalities, Improved approximations for the minimum-cut ratio and the flux, LP-Based Algorithms for Capacitated Facility Location, On the minimum cost multiple-source unsplittable flow problem, Computing extreme rays of the metric cone for seven points, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Metric inequalities and the network loading problem, Metric inequalities for routings on direct connections with application to line planning, Cutting planes in integer and mixed integer programming, The projected pairwise multicommodity flow polyhedron, A constraint generation algorithm for large scale linear programs using multiple-points separation, Polyhedral structure of the 4-node network design problem, On describing the routing capacity regions of networks, Engpässe, Staustellen und glatte homogene Ströme in Netzen, On cut-based inequalities for capacitated network design polyhedra, Benders Decomposition for Capacitated Network Design, Projections of the capacitated network loading problem, Tight spans of distances and the dual fractionality of undirected multiflow problems, Metrics and undirected cuts, A heuristic for the continuous capacity and flow assignment
