메뉴 건너뛰기




Volumn 29, Issue 1, 2003, Pages 245-249

An improved stepsize of the subgradient algorithm for solving the lagrangian relaxation problem

Author keywords

Lagrangian relaxation; Optimization; Subgradient

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

EID: 0036332649     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7906(01)00026-X     Document Type: Article
Times cited : (16)

References (6)
  • 1
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • (1981) Mgmt Sci , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 4
    • 0022031091 scopus 로고
    • An application oriented guide to Lagrangian relaxation
    • (1985) Interfaces , vol.15 , Issue.2 , pp. 10-21
    • Fisher, M.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.