Author:
Geißler Björn,Martin Alexander,Morsi Antonio,Schewe Lars
Reference32 articles.
1. A. Balakrishnan and S.C. Graves, A composite algorithm for a concave-cost network flow problem, Networks, 19 (1989), pp. 175–202.
2. J.J. Bartholdi III and P. Goldsman, The vertex-adjacency dual of a triangulated irregular network has a hamiltonian cycle, Operations Research Letters, 32 (2004), pp. 304–308.
3. E.M.L. Beale and J.J.H. Forrest, Global optimization using special ordered sets, Math. Programming, 10 (1976), pp. 52–69.
4. E.M.L. Beale and J.A. Tomlin, Special facilitiess in a general mathematical programming system for non-convex problems using ordered sets of variables,in OR 69, J. Lawrence, ed., International Federation of Operational Research Societies, Travistock Publications, 1970, pp. 447–454.
5. A. Ben-Tal and A. Nemirovski, On polyhedral approximations of the secondorder cone, Math. Oper. Res., 26 (2001), pp. 193–205.
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献