메뉴 건너뛰기




Volumn 17, Issue 1 PART 1, 2008, Pages

Large-scale task/target assignment for UAV fleets using a distributed branch and price optimization

Author keywords

Aerospace applications; Decentralization; Large scale optimization problems

Indexed keywords

ASSIGNMENT PROBLEMS; BRANCH AND PRICE; COLUMN GENERATION APPROACH; DECENTRALIZATION; DISTRIBUTED COORDINATION; DISTRIBUTED IMPLEMENTATION; FLIGHT PLANS; HARD REAL-TIME; LARGE SCALE OPTIMIZATION PROBLEMS; NUMERICAL VERIFICATION; POLYNOMIAL-TIME; PROBLEM SIZE; SUPPLY-DEMAND; WAYPOINTS;

EID: 79961018815     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20080706-5-KR-1001.2401     Document Type: Conference Paper
Times cited : (21)

References (25)
  • 7
    • 84889960231 scopus 로고    scopus 로고
    • A Primer in Column Generation
    • Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon
    • J. Desrosiers, M.E. Lbbecke, "A Primer in Column Generation", in Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation, 2005, pp. 1-32.
    • (2005) Column Generation , pp. 1-32
    • Desrosiers, J.1    Lbbecke, M.E.2
  • 9
    • 84889998910 scopus 로고    scopus 로고
    • Implementing Mixed Integer Column Generation
    • Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon
    • F. Vanderback, "Implementing Mixed Integer Column Generation", in Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation, 2005, pp. 331-358.
    • (2005) Column Generation , pp. 331-358
    • Vanderback, F.1
  • 11
    • 84889973397 scopus 로고    scopus 로고
    • Shortest Path Problems with Time Windows
    • Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon
    • S. Irnich, G. Desaulniers, "Shortest Path Problems with Time Windows", in Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation, 2005, pp. 33-66.
    • (2005) Column Generation , pp. 33-66
    • Irnich, S.1    Desaulniers, G.2
  • 12
    • 84889954151 scopus 로고    scopus 로고
    • Vehicle Routing Problem with Time Windows
    • Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon
    • B. Kallehauge, J. Larsden, O.B.G. Madsen, M.M. Solomon, "Vehicle Routing Problem with Time Windows", in Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation, 2005, pp. 67-98.
    • (2005) Column Generation , pp. 67-98
    • Kallehauge, B.1    Larsden, J.2    Madsen, O.B.G.3    Solomon, M.M.4
  • 13
    • 70449690198 scopus 로고    scopus 로고
    • Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
    • Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon
    • E. Donna, C.L. Pape, "Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows", in Eds. G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation, 2005, pp. 99-130.
    • (2005) Column Generation , pp. 99-130
    • Donna, E.1    Pape, C.L.2
  • 14
    • 32044469861 scopus 로고    scopus 로고
    • Vehicle Routing Problem with elementary shortest path based column generation
    • DOI 10.1016/j.cor.2005.02.029, PII S0305054805000857, Constrain Programming
    • A. Chabrier, "Vehicle Routing Problem with Elementary Shortest Path Based Column Generation", Computers and Operations Research, vol.33, 2006, pp. 2972-2990. (Pubitemid 43199835)
    • (2006) Computers and Operations Research , vol.33 , Issue.10 , pp. 2972-2990
    • Chabrier, A.1
  • 18
    • 32644453668 scopus 로고    scopus 로고
    • A Generic View of Dantzig-Wolfe Decomposition in Mixed Integer Programming
    • F. Vanderback, M.W.P. Savelsbergh, "A Generic View of Dantzig-Wolfe Decomposition in Mixed Integer Programming", Operations Research Letters, vol.34, 2006, pp. 296-306.
    • (2006) Operations Research Letters , vol.34 , pp. 296-306
    • Vanderback, F.1    Savelsbergh, M.W.P.2
  • 19
    • 31744439169 scopus 로고    scopus 로고
    • Decomposition and dynamic cut generation in integer linear programming
    • DOI 10.1007/s10107-005-0606-3
    • T.K. Ralphs, M.V. Galati, "Decomposition and Dynamic Cut Generation in Integer Linear Programming", Mathematical Programming A, vol.106, 2006, pp. 261-285. (Pubitemid 43177355)
    • (2006) Mathematical Programming , vol.106 , Issue.2 , pp. 261-285
    • Ralphs, T.K.1    Galati, M.V.2
  • 23
    • 0043064778 scopus 로고
    • A Class of Combinatorial Problems with Polynomially Solvable Large Scale Set Covering/Partitioning Relaxations
    • M. Minoux, "A Class of Combinatorial Problems with Polynomially Solvable Large Scale Set Covering/Partitioning Relaxations", RAIRO Rech. Opr., vol.21, 1987, pp. 105-136.
    • (1987) RAIRO Rech. Opr. , vol.21 , pp. 105-136
    • Minoux, M.1


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