Pages that link to "Item:Q3100369"
From MaRDI portal
The following pages link to Incremental Network Optimization: Theory and Algorithms (Q3100369):
Displaying 15 items.
- Incremental network design with shortest paths (Q296857) (← links)
- The capacity expansion path problem in networks (Q364264) (← links)
- A modified active set algorithm for transportation discrete network design bi-level problem (Q506465) (← links)
- Incremental network design with maximum flows (Q726224) (← links)
- Network optimization: algorithms and applications (Q1373740) (← links)
- Optimal consistent network updates in polynomial time (Q1660929) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Dominance-based linear formulation for the anchor-robust project scheduling problem (Q2239841) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- Some recent contributions to network optimization (Q4812397) (← links)
- Approximating Incremental Combinatorial Optimization Problems (Q5002607) (← links)
- (Q5501312) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)
