Pages that link to "Item:Q3812008"
From MaRDI portal
The following pages link to Dual Algorithms for Pure Network Problems (Q3812008):
Displaying 17 items.
- Updating network flows given multiple, heterogeneous arc attribute changes (Q655194) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Knowledge integration using problem spaces: A study in resource-constrained project scheduling (Q880537) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- A new dual based procedure for the transportation problem (Q1577109) (← links)
- Optimization of primal and dual network models of distribution (Q1579585) (← links)
- Simultaneous lotsizing and scheduling on parallel machines (Q1604070) (← links)
- Obtaining a good primal solution to the uncapacitated transportation problem (Q1869409) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach (Q2366088) (← links)
- The quickest flow problem (Q4031968) (← links)
- (Q4352220) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)