\input zb-basic
\input zb-ioport
\iteman{io-port 06033989}
\itemau{Shim, Sangho; Johnson, Ellis L.; Cao, Wenwei}
\itemti{Primal-dual simplex method for shooting.}
\itemso{Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24--26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 719-726 (2010).}
\itemab
Summary: {\it R. E. Gomory} [Linear Algebra Appl. 2, 451--558 (1969; Zbl 0184.23103)] 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.
\itemrv{~}
\itemcc{}
\itemut{cyclic group problem; cutting plane algorithm; primal-dual simplex method}
\itemli{doi:10.1016/j.endm.2010.05.091}
\end