An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
From MaRDI portal
Publication:1429768
DOI10.1016/S0045-7906(01)00026-XzbMath1048.90153OpenAlexW2057967912MaRDI QIDQ1429768
Publication date: 27 May 2004
Published in: Computers and Electrical Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0045-7906(01)00026-x
Related Items (2)
A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process ⋮ A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex
This page was built for publication: An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
