FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM

DOI Web Site Web Site 参考文献22件

書誌事項

タイトル別名
  • Feasible Region Reduction Cuts for the

この論文をさがす

説明

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.

収録刊行物

参考文献 (22)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ