Combinatorial approaches to multiflow problems

Recommendations

Combinatorial approximation algorithms for generalized flow problems
Approximation and Online Algorithms
scientific article; zbMATH DE number 108290
Solving a combinatorial problem with network flows
Combinatorial algorithms for the unsplittable flow problem
scientific article; zbMATH DE number 515936
A combinatorial approximation algorithm for concurrent flow problem and its application
Combinatorial continuous maximum flow
Combinatorial algorithms for inverse network flow problems
scientific article; zbMATH DE number 1086903

Cited in

(68)

Tight spans of distances and the dual fractionality of undirected multiflow problems
Families of cuts with the MFMC-property
Polyhedra related to undirected multicommodity flows
Short proofs on multicommodity flows and cuts
A canonical decomposition theory for metrics on a finite set
Maximum concurrent flows and minimum cuts
A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
Minimum cost multiflows in undirected networks
Multiflows and disjoint paths of minimum total cost
A T_X-approach to some results on cuts and metrics
Packing odd circuits in Eulerian graphs
On return path packing.
Maximum balanced flow in a network
On one maximum multiflow problem and related metrics
Network loading problem: valid inequalities from 5- and higher partitions
Methods of the convex cone theory in the feasibility problem of multicommodity flow
Fixed charge multicommodity network design using p-partition facets
Sums of cuts and bipartite metrics
On extremal multiflows
On multiflow lexicographics
Application of cut polyhedra. I
Applications of cut polyhedra. II
Graphic vertices of the metric polytope
One-third-integrality in the max-cut problem
On the fractionality of the path packing problem
Min-cost multiflows in node-capacitated undirected networks
On tight spans for directed distances
Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
On the complexity of the disjoint paths problem
Free multiflows in bidirected and skew-symmetric graphs
Generalization of the Ford-Fulkerson theorem to multigraphs
New approaches for optimizing over the semimetric polytope
The maximum integer multiterminal flow problem in directed graphs
Combinatorial approximation algorithms for generalized flow problems
The maximum multiflow problems with bounded fractionality
Multiflow Feasibility: An Annotated Tableau
Polyhedral structure of the 4-node network design problem
A note on multiflow locking theorem
A combinatorial algorithm for the planar multiflow problem with demands located on three holes
Folder complexes and multiflow combinatorial dualities
scientific article; zbMATH DE number 4212067 (Why is no real title available?)
Robust Metric Inequalities for Network Loading Under Demand Uncertainty
scientific article; zbMATH DE number 3906192 (Why is no real title available?)
scientific article; zbMATH DE number 3952461 (Why is no real title available?)
scientific article; zbMATH DE number 3970465 (Why is no real title available?)
scientific article; zbMATH DE number 3982882 (Why is no real title available?)
scientific article; zbMATH DE number 66623 (Why is no real title available?)
scientific article; zbMATH DE number 1327275 (Why is no real title available?)
Solving survivable two-layer network design problems by metric inequalities
Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems
On ideal clutters, metrics and multiflows
Criticality for multicommodity flows
Multicommodity network flows: a survey. I: Applications and formulations
Multicommodity network flows: A survey. II: Solution methods
Designing multi-commodity flow trees
When do Gomory-Hu subtrees exist?
Half-integral five-terminus flows
The projected pairwise multicommodity flow polyhedron
On the binary solitaire cone
Combinatorial acyclicity models for potential‐based flows
Cut-sufficient directed 2-commodity multiflow topologies
Ideal clutters
Cut-sufficient directed 2-commodity multiflow topologies
Multiflows in symmetric digraphs
Railway scheduling by network optimization
About Lagrangian methods in integer optimization
New methods for multi-commodity flows
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard

This page was built for publication: Combinatorial approaches to multiflow problems

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