Potential reduction algorithms for structured combinatorial optimization problems

Operations Research Letters

Volumn 21, Issue 2, 1997, Pages 55-64

  Warners, J P ^a   Terlaky, T ^a   Roos, C ^a   Jansen, B ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CQM BV   (Netherlands)

Author keywords

Binary programming; Combinatorial optimization; Interior point methods; Non linear optimization

Indexed keywords

EID: 0002058082     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(97)00031-X     Document Type: Article

References (12)

1. E.D. Andersen, J. Gondzio, C. Mészáros, X. Xu, Implementation of interior-point methods for large scale linear programs, in: T. Terlaky (Ed.), Interior Point Methods in Mathematical Programming, Kluwer Academic Publishers, Dordrecht, 1996, pp. 189-252.
2. H.P. van Benthem, GRAPH: Generating radiolink frequency assignment problems heuristically, Master's Thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 1995.
3. I.S. Duff, A.M. Erisman, J.K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, New York, 1989.
4. O.E. Flippo, B. Jansen, Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid, European J. Oper. Res. 94 (1996) 167-178.
5. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, M.G.C. Resende, Computational experience with an interior point algorithm on the Satisfiability problem, Ann. Oper. Res. 25 (1990) 43-58.
6. N. Karmarkar, An interior-point approach to NP-complete problems - Part I, Contemp. Math. 114 (1990) 297-308.
7. N. Karmarkar, M.G.C. Resende, K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Math. Programming 52 (1991) 597-618.
8. C. Roos, T. Terlaky, T.B. Trafalis, J.P. Warners, Solving linear systems with low-rank updates, Technical Report 96-149, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 1996.
9. C.-J. Shi, A. Vannelli, J. Vlach, An improvement on Karmarkar's algorithm for integer programming, COAL Bull. 21 (1992) 23-28.
10. D.C. Sörensen, Newton's method with a model trust region modifcation, SIAM J. Numer. Anal. 19 (1982) 409-426.
11. J.P. Warners, A potential reduction approach to the radio link frequency assignment problem, Master's Thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 1995.
12. Y. Zhang, LIPSOL - a MATLAB™ toolkit for linear programming interior-point solvers, Department of Mathematics and Statistics, University of Maryland Baltimore Country, Baltimore, Maryland (1994). FORTRAN routines written by E.G. Ng and B.W. Peyton (ORNL), J.W.H. Liu (Waterloo), Y. and D. Zhang (UMBC).