FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• We introduce a conceptually new method of generating strong cuts for the simple plant location problem. Based on the simple structure of the problem, we generate inequalities which even cut off part of the integer feasible region but still provide valid and sharp lower bounds of the problem when added to its linear programming relaxation. Also shown is the relation between such inequalities and the conventional valid inequalities of the problem.

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

著者

• Tcha Dong-wan

  Korea Advanced Institute Of Science And Technology

• Myung Young-Soo

  Department of Business Administration, Dankook University

• Myung Young-soo

  Department Of Business Administration Dankook University

関連論文

• FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM

スポンサーリンク