scientific article; zbMATH DE number 1342118

zbMath0948.90116MaRDI QIDQ4263700

James B. Orlin, Ravindra K. Ahuja, Dorit S. Hochbaum

Publication date: 22 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrangian relaxationconvex optimizationnetwork flow problemminimum cost flow problemcost scaling algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Deterministic network models in operations research (90B10)

Related Items

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method ⋮ On project scheduling with irregular starting time costs ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ A Note on Appointment Scheduling with Piecewise Linear Cost Functions ⋮ PERT scheduling with convex cost functions. ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations