Title of article
Primal-dual simplex method for shooting
Author/Authors
Shim، نويسنده , , Sangho and Johnson، نويسنده , , Ellis L. and Cao، نويسنده , , Wenwei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
719
To page
726
Abstract
Gomory [R.E. Gomory, Some polyhedra related to combinatorial problems, Linear Algebra and its Applications 2 (1969), 451–558] solved the cyclic group problem by a dynamic programming algorithm. We discuss its complexity and introduce a (fractional) cutting plane algorithm as an alternative algorithm. Each cutting plane is generated by solving a shooting linear programming problem. We implement primal-dual simplex method to solve the shooting linear programming problem. A computational result is given on a Wong-Coppersmith digraph.
Keywords
cyclic group problem , Cutting plane algorithm , primal-dual simplex method
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455496
Link To Document