An interactive procedure using domination cones for bicriterion shortest path problems

[1]  Michael D. Intriligator,et al.  Mathematical optimization and economic theory , 1971 .

[2]  R. Benayoun,et al.  Linear programming with multiple objective functions: Step method (stem) , 1971, Math. Program..

[3]  Arthur M. Geoffrion,et al.  An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department , 1972 .

[4]  G. Leitmann,et al.  Compromise Solutions, Domination Structures, and Salukvadze’s Solution , 1974 .

[5]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[6]  R. Soland.  MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS* , 1979 .

[7]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[8]  Sowmyanarayanan Sadagopan,et al.  Interactive solution of bi‐criteria mathematical programs , 1982 .

[9]  D. J. White,et al.  The set of efficient solutions for multiple objective shortest path problems , 1982, Comput. Oper. Res..

[10]  S. Zionts,et al.  Solving the Discrete Multiple Criteria Problem using Convex Cones , 1984 .

[11]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[12]  R. Soland,et al.  An interactive branch-and-bound algorithm for multiple criteria optimization , 1986 .

[13]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[14]  S. Zionts,et al.  Preference structure representation using convex cones in multicriteria integer programming , 1989 .