메뉴 건너뛰기




Volumn 47, Issue 6, 1999, Pages 849-861

Rendezvous search on the line with limited resources: Maximizing the probability of meeting

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RESOURCE ALLOCATION;

EID: 0033315889     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.6.849     Document Type: Article
Times cited : (11)

References (18)
  • 1
    • 0029306635 scopus 로고
    • The rendezvous search problem
    • Alpern, S. 1995. The rendezvous search problem. SIAM J. Control and Optim. 33 (3) 673-683.
    • (1995) SIAM J. Control and Optim. , vol.33 , Issue.3 , pp. 673-683
    • Alpern, S.1
  • 2
    • 0031223743 scopus 로고    scopus 로고
    • Rendezvous search on the line with bounded resources: Minimizing expected meeting time
    • _, A. Beck. 1997. Rendezvous search on the line with bounded resources: minimizing expected meeting time. European J. Oper. Res. 101 588-597.
    • (1997) European J. Oper. Res. , vol.101 , pp. 588-597
    • Beck, A.1
  • 4
    • 0000877171 scopus 로고
    • Rendezvous search on the line with distinguishable players
    • _, S. Gal. 1995. Rendezvous search on the line with distinguishable players. SIAM. J. Control and Optimiz. 33 (4) 1270-1276.
    • (1995) SIAM. J. Control and Optimiz. , vol.33 , Issue.4 , pp. 1270-1276
    • Gal, S.1
  • 5
    • 0000877172 scopus 로고
    • Rendezvous search on the line with indistinguishable players
    • Anderson, E. J., S. Essegaier. 1995. Rendezvous search on the line with indistinguishable players. SIAM J. Control and Optimiz. 33 1637-1642.
    • (1995) SIAM J. Control and Optimiz. , vol.33 , pp. 1637-1642
    • Anderson, E.J.1    Essegaier, S.2
  • 6
    • 0000607486 scopus 로고
    • The rendezvous problem on discrete locations
    • _, R.R. Weber. 1990. The rendezvous problem on discrete locations. J. Appl. Probab. 28 839-851.
    • (1990) J. Appl. Probab. , vol.28 , pp. 839-851
    • Weber, R.R.1
  • 7
    • 0033114860 scopus 로고    scopus 로고
    • Two rendezvous search problems
    • Baston, V.J. 1999. Two rendezvous search problems. Naval Res. Logistics 46 335-340.
    • (1999) Naval Res. Logistics , vol.46 , pp. 335-340
    • Baston, V.J.1
  • 8
    • 51249165285 scopus 로고
    • On the linear search problem
    • Beck, A. 1964. On the linear search problem. Israel. J Math. 2 221-228.
    • (1964) Israel. J Math. , vol.2 , pp. 221-228
    • Beck, A.1
  • 9
    • 0343327265 scopus 로고    scopus 로고
    • A survey of the linear search problem
    • Bruce, F.T., J.B. Robertson. 1998. A survey of the linear search problem. Math. Scientist 13 75-89.
    • (1998) Math. Scientist , vol.13 , pp. 75-89
    • Bruce, F.T.1    Robertson, J.B.2
  • 11
    • 0004194991 scopus 로고
    • Academic Press, New York
    • Gal, S. 1980. Search Games. Academic Press, New York.
    • (1980) Search Games
    • Gal, S.1
  • 12
    • 0033345946 scopus 로고    scopus 로고
    • Rendezvous search on the line
    • this issue
    • _. 1999. Rendezvous search on the line. Oper. Res. 47 (6) this issue.
    • (1999) Oper. Res. , vol.47 , Issue.6
  • 13
    • 0032594157 scopus 로고    scopus 로고
    • Rendezvous search on the interval and the circle
    • Howard, J. 1999. Rendezvous search on the interval and the circle. Oper. Res. 47 (4) 550-558.
    • (1999) Oper. Res. , vol.47 , Issue.4 , pp. 550-558
    • Howard, J.1
  • 15
    • 0031145497 scopus 로고    scopus 로고
    • Rendezvous search on the line with more than two players
    • _, _, A. Beck. 1997. Rendezvous search on the line with more than two players. Oper. Res. 45 (3) 357-364.
    • (1997) Oper. Res. , vol.45 , Issue.3 , pp. 357-364
    • Beck, A.1
  • 18
    • 0030686726 scopus 로고    scopus 로고
    • Searching for targets who want to be found
    • Thomas, L.C., P.B. Hulme. 1997. Searching for targets who want to be found. J. Oper. Res. Society 48 (1) 44-50.
    • (1997) J. Oper. Res. Society , vol.48 , Issue.1 , pp. 44-50
    • Thomas, L.C.1    Hulme, P.B.2


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