An improved general procedure for lexicographic bottleneck problems
暂无分享,去创建一个
Alexis Tsoukiàs | Federico Della Croce | Vangelis Th. Paschos | F. D. Croce | V. Paschos | A. Tsoukiás
[1] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[3] Franz Rendl,et al. Lexicographic bottleneck problems , 1991, Oper. Res. Lett..
[4] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[5] Denis Bouyssou,et al. Multicriteria decision‐aid, Vincke, Ph., Chichester: Wiley, 1992 , 1994 .
[6] Herminia I. Calvete,et al. Lexicographic optimisation in generalised network flow problems , 1998, J. Oper. Res. Soc..
[7] Rainer E. Burkard,et al. Combinatorial optimization in linearly ordered semimodules: A survey , 1982 .
[8] Abraham P. Punnen,et al. Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem , 1994, Discret. Appl. Math..
[9] Peter C. Fishburn,et al. LEXICOGRAPHIC ORDERS, UTILITIES AND DECISION RULES: A SURVEY , 1974 .
[10] Uwe Zimmermann. Some Partial Orders Related to Boolean Optimization and the Greedy Algorithm , 1977 .
[11] Patrick Suppes,et al. Foundational aspects of theories of measurement , 1958, Journal of Symbolic Logic.
[12] Nicos Christofides,et al. Graph theory: An algorithmic approach (Computer science and applied mathematics) , 1975 .
[13] Rainer E. Burkard,et al. An algebraic approach to assignment problems , 1977, Math. Program..
[14] Philippe Vincke,et al. Multicriteria Decision-aid , 1993 .