LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))

DOI Web Site Web Site 被引用文献2件 参考文献42件 オープンアクセス

書誌事項

タイトル別名
  • LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS

この論文をさがす

説明

We develop an algorithm for the linear ordering problem, which has a large number of applications such as triangulation of input-output matrices, minimizing total weighted completion time in one-machine scheduling, and aggregation of individual preferences. The algorithm is based on the Lagrangian relaxation of a binary integer linear programming formulation of the problem. Since the number of the constraints is proportional to the third power of the number of items and grows rapidly, we propose a modified subgradient method that temporarily ignores a large part of the constraints and gradually adds constraints whose Lagrangian multipliers are likely to be positive at an optimal multiplier vector. We also propose an improvement on the ordinary pegging test by using the problem structure.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (42)*注記

もっと見る

キーワード

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

問題の指摘

ページトップへ