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