1. F. Ben Abdelaziz, J. Chaouachi, and S. Krichen. A hybrid heuristic for multiobjective knapsack problems. In S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 205–212. Kluwer Academic Publishers, Dordrecht, 1999.
2. S.S. Abhyankar, T.L. Morin, and T. Trafalis. Efficient faces of polytopes: Interior point algorithms, parametrization of algebraic varieties, and multiple objective optimization. Contemporary Mathematics, 114:319–341, 1990.
3. K.K. Achary. A direct simplex type method for determining all efficient solution pairs of time-cost transportation problem. Econ. Comput. Econ. Cybern. Stud. Res., 24(2/3):139–150, 1989.
4. B. Aghezzaf. Efficiency and duality in multiobjective fractional programming. Opsearch, 32(1):31–43, 1995.
5. B. Aghezzaf. Second-order necessary conditions of the Kuhn-Tucker type in multiobjective programming problems. Control and Cybernetics, 28(2):213–224, 1999.