scientific article; zbMATH DE number 3550435

MaRDI QIDQ4124571zbMATH OpenFDO

Authors Boris V. Cherkassky

Publication date 1977

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10)

Cited in

(20)

• A linear programming formulation of Mader's edge-disjoint paths problem
• Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity
• Polyhedra related to undirected multicommodity flows
• Free multiflows in bidirected and skew-symmetric graphs
• On multiflow lexicographics
• The Lovász-Cherkassky theorem in infinite graphs
• L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
• The generalized terminal backup problem
• A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
• Minimum weight \((T,d)\)-joins and multi-joins
• A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
• Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
• Tight spans of distances and the dual fractionality of undirected multiflow problems
• Multiterminal flows and cuts
• Combinatorial approaches to multiflow problems
• Bit threads and holographic monogamy
• The Lovász-Cherkassky theorem for locally finite graphs with ends
• The Lovász-Cherkassky theorem in countable graphs
• On return path packing.
• Approximating the generalized terminal backup problem via half-integral multiflow relaxation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124571)