Pages that link to "Item:Q5668604"
From MaRDI portal
The following pages link to A generalized upper bounding algorithm for multicommodity network flow problems (Q5668604):
Displaying 14 items.
- Tree network design avoiding congestion (Q646180) (← links)
- The basis suppression method (Q918407) (← links)
- The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
- \({\mathcal H}_ 2\) guaranteed cost control for uncertain continuous-time linear systems (Q1199067) (← links)
- Extreme points and adjacency relationship in the flow polytope (Q1257824) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- Multicommodity network flow with jump constraints (Q1356790) (← links)
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem (Q2336751) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Basis characterisation for linear multicommodity network programs (Q4836775) (← links)
- (Q5020877) (← links)
- (Q5020878) (← links)
- Some problems in discrete optimization (Q5636690) (← links)
- A partitioning algorithm for the multicommodity network flow problem (Q5668269) (← links)
