scientific article; zbMATH DE number 3550435

zbMATH Open0353.90030MaRDI QIDQ4124571FDOQ4124571

Boris V. Cherkassky

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (20)

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

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)