On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
DOI10.2298/YJOR181015034BzbMath1474.65162WikidataQ128748981 ScholiaQ128748981MaRDI QIDQ3388417
Vadim Teplyakov, Anton Valentinovich Eremeev, Mikhail Vorozhtsov, Pavel Borisovsky, Sergei Hrushev
Publication date: 5 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
linear programmingcomputational experimentgreedy heuristicfully polynomial-time approximation schemesoftware defined satellite network
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
- Interior-point solver for convex separable block-angular problems
- On the minimum cost multiple-source unsplittable flow problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Length-bounded cuts and flows
- Improved bounds for the unsplittable flow problem
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- The solution of the multi-product problem with integer-valued flows
- Solving Multicommodity Flow Problems by an Approximation Scheme
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
This page was built for publication: On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
