1. Adenso-Díaz, B., Laguna, M.: Fine-tuning of algorithms using partial experimental designs and local search. Oper. Res. 54(1), 99–114 (2006)
2. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: A Perl program to create time-to-target plots. Optim. Lett. 1, 355–366 (2008)
3. Becker, O.: Das Helmstädtersche Reihenfolgeproblem—die Effizienz verschiedener Näherungsverfahren. In: Computer Uses in the Social Sciences. Bericht einer Working Conference, Wien, January 1967
4. Benvenuto, N., Carnevale, G., Tomasin, S.: Optimum power control and ordering in SIC receivers for uplink CDMA systems. In: IEEE-ICC 2005, Seoul, Korea, 2005
5. Bertacco, L., Brunetta, L., Fischetti, M.: The linear ordering problem with cumulative costs. Eur. J. Oper. Res. 189(3), 1345–1357 (2008)