scientific article; zbMATH DE number 3550435
From MaRDI portal
Publication:4124571
zbMath0353.90030MaRDI QIDQ4124571
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity, Combinatorial approaches to multiflow problems, Free multiflows in bidirected and skew-symmetric graphs, Polyhedra related to undirected multicommodity flows, Minimum weight \((T,d)\)-joins and multi-joins, Multiterminal flows and cuts, Bit threads and holographic monogamy, The Generalized Terminal Backup Problem, Finding Maximum Edge-Disjoint Paths Between Multiple Terminals, The Lovász-Cherkassky theorem for locally finite graphs with ends, The Lovász-Cherkassky theorem in countable graphs, On return path packing., A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem, L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem, Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation, Tight spans of distances and the dual fractionality of undirected multiflow problems, A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem, A linear programming formulation of Mader's edge-disjoint paths problem, On multiflow lexicographics
