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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Shigeno Maiko

  University Of Tsukuba

関連論文

• AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE
• A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(Network Design, Control and Optimization)

スポンサーリンク