Pages that link to "Item:Q5896938"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896938):
Displaying 16 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- Combinatorial approaches to multiflow problems (Q1080357) (← links)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- A heuristic solution procedure for multicommodity integer flows (Q1905088) (← links)
- Combinatorial approximation algorithms for generalized flow problems (Q2709797) (← links)
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558) (← links)
- Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- Multicommodity flow problems with a bounded number of paths: A flow deviation approach (Q3418124) (← links)
- The Multicommodity Multilevel Bottleneck Assignment Problem (Q3439124) (← links)
- Integer multicommodity flow problems (Q4645913) (← links)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
