Incremental network optimization: theory and algorithms
From MaRDI portal
Recommendations
Cited in
(18)- Network optimization: algorithms and applications
- Optimal consistent network updates in polynomial time
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Dominance-based linear formulation for the anchor-robust project scheduling problem
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Recoverable robust spanning tree problem under interval uncertainty representations
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty
- Incremental network design with shortest paths
- The capacity expansion path problem in networks
- Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure
- Some recent contributions to network optimization
- Approximating incremental combinatorial optimization problems
- A modified active set algorithm for transportation discrete network design bi-level problem
- scientific article; zbMATH DE number 6469194 (Why is no real title available?)
- Independent set under a change constraint from an initial solution
- Recoverable robust shortest path problem under interval budgeted uncertainty representations
- Computational complexity of the recoverable robust shortest path problem with discrete recourse
- Incremental network design with maximum flows
This page was built for publication: Incremental network optimization: theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100369)
