Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Efficient Implementation Techniques the Dual Simplex Method

쌍대단체법의 효율적인 구현을 위한 기법

  • Published : 1999.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

The purpose of this paper is to develope efficient techniques for implementing the dual simplex method. In this paper we proposed one artificial row technique to get an initial dual feasible basic solution, a dual steepest-edge method coupled with a dropping row selection rule, and an anti-degeneracy technique which resembles the EXPAND procedure for the primal simplex method. The efficiency of the above techniques is shown by experiments. Finally, the dual simplex method is shown to be superior to the primal simplex method when it is used in the integer programming.

Keywords

References

  1. 서울대학교 대학원 공학박사 학위논문 수송네트워크에서 최대물동량경로에 관한 연구 성기석
  2. Transportation Research-B v.20B no.4 Bus Network Design Ceder,A.;N.H.M.Wilson
  3. European J. of Operational Research v.26 Multi-Objective Design of Transportation Nertworks : Taxonomy and Annotation Current,J.R.;H.Min
  4. Transportation Science v.21 no.3 The Median Shortest Path Problem : A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks Current,J.R.;C.S.Revelle;J.L.Cohon
  5. Transportation Science v.22 no.4 The Design of a Hierarchical Transportation Network with Transshipment Facilities Current,J.R.
  6. Networks v.14 Shortest Path Algorithms : Taxonomy Annotation Deo,N.;C.Pang
  7. Operations Research v.17 An Apprisal of Some Shortest-Path Algorithms Dreyfus,S.E.
  8. Operations Reseanch v.26 Data Structures and Computer Science Techniques in Operations Research Fox,B.L.
  9. Computers and Intractability-A guide to the theory of NP-Completeness Garey,M.R.;D.S.Johnson
  10. Networks v.7 Deterministic Network Optimization-A Bibliography Golden,B.L.;T.L.Magnanti
  11. Networks v.12 An Efficient algorithm for K Shortest Simple Path Katoh,N.;T.Ibaraki;H.Mine
  12. Management Science v.18 no.7 A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem Lawler,E.L.
  13. European J. of Operational Research v.5 Evaluation and Optimization of Urban Public Transportation Networks Mandl,C.E.
  14. Transportation Science v.18 Network Design and Transportation Planning : Modeis and Algorithms Magnanti,T.L.;R.T.Wong
  15. European J. of Operational Research v.18 An Algorithm for Ranking Paths that may contain Cycles Martins,E.Q.V.
  16. Networks v.5 Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems(1956~1974) Pierce,A.R.
  17. Networks v.16 Implementation of Algorithms for K Shortest Loopless Paths Perko,A.
  18. Comm. ACM v.17 On Computing Sets of Shortest Paths in a Graph Minieka,E.
  19. Networks v.9 On Algorithms for Finding the K-Shortest Paths in a Network Shier,D.R.
  20. Networks v.6 An Algebra for Determining All Path-Values in a Network with Application to K-Shortest-Paths Problems Wongseelashote,A.
  21. Management Science v.17 Finding the K Shortest Loopless Paths in a Network Yen,J.Y.