Publication:3478275
From MaRDI portal
DOI<327::AID-NAV3220370210>3.0.CO;2-U 10.1002/1520-6750(199004)37:2<327::AID-NAV3220370210>3.0.CO;2-UzbMath0699.90090MaRDI QIDQ3478275
Publication date: 1990
upper boundsLagrangian relaxationparametrizationlower boundsheuristicsubgradient optimizationfixed charge network problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
COLE: a new heuristic approach for fixed charge problem computational results, A tabu search heuristic procedure for the fixed charge transportation problem
Cites Work