1. Andersen K, Jörnsten K, Lind M (1996) On bicriterion minimal spanning trees: an approximation. Comput Oper Res 23(12):1171–1182
2. Bachelet V (1999) Métaheuristiques paralleles hybrides: Application au probleme d'affectation quadratique. Dissertation, Université des Sciences et Technologies de Lille, France
3. Borges PC, Hansen MP (2000) A study of global convexity for a multiple objective travelling salesman problem. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dorderecht, pp 129–150
4. Caprara A (1997) Sorting by reversals is difficult. In: Proceedings of the first annual international conference on computational molecular biology. ACM, New York, NY, pp 75–83
5. Ehrgott M, Klamroth K (1997) Connectedness of efficient solutions in multi criteria combinatorial optimization. Eur J Oper Res 97:159–166