The following pages link to (Q4305228):
Displaying 13 items.
- On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- Short proofs on multicommodity flows and cuts (Q1186123) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- Two commodity flows (Q1332945) (← links)
- On one maximum multiflow problem and related metrics (Q1584451) (← links)
- A heuristic solution procedure for multicommodity integer flows (Q1905088) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← 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)
- (Q4464681) (← links)
- Integer multicommodity flow problems (Q4645913) (← links)
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)