%0 Journal Article %1 journals/ol/YangY18 %A Yang, Yaguang %A Yamashita, Makoto %D 2018 %J Optim. Lett. %K dblp %N 4 %P 781-798 %T An arc-search $$O(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming. %U http://dblp.uni-trier.de/db/journals/ol/ol12.html#YangY18 %V 12

@article{journals/ol/YangY18, added-at = {2020-07-03T00:00:00.000+0200}, author = {Yang, Yaguang and Yamashita, Makoto}, biburl = {https://www.bibsonomy.org/bibtex/2629ffbea98b3a1a6c62a44634b656314/dblp}, ee = {https://doi.org/10.1007/s11590-017-1142-9}, interhash = {0dcb95e3de302c7e89b63f5e18307325}, intrahash = {629ffbea98b3a1a6c62a44634b656314}, journal = {Optim. Lett.}, keywords = {dblp}, number = 4, pages = {781-798}, timestamp = {2020-07-04T11:48:32.000+0200}, title = {An arc-search $${\mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming.}, url = {http://dblp.uni-trier.de/db/journals/ol/ol12.html#YangY18}, volume = 12, year = 2018 }