AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE

• Shigeno Maiko

  University of Tsukuba

抄録

A robust approach to solving discrete optimization problems with uncertain data has recently been extensively studied and extended. This paper presents a new robust optimization model, called the adjustable robust optimization model, where a small perturbation for a solution is permitted after the uncertain parameters are realized. We apply this model to a 1-median location problem under uncertainty and give a polynomial time algorithm to determine robust solutions in the case of a tree graph.

収録刊行物

• 日本オペレーションズ・リサーチ学会論文誌

  日本オペレーションズ・リサーチ学会論文誌 51 (2), 127-135, 2008

  公益社団法人 日本オペレーションズ・リサーチ学会

キーワード

• Discrete optimization
• robust optimization
• location problem

詳細情報

• CRID: 1390001204109179648
• NII論文ID: 110006792048
• NII書誌ID: AA00703935
• DOI: 10.15807/jorsj.51.127
• ISSN: 21888299
• ISSN: 04534514
• NDL書誌ID: 9544518
• Web Site: http://id.ndl.go.jp/bib/9544518
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I9544518
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/51/2/51_KJ00004960690/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可