An improved general procedure for lexicographic bottleneck problems-Reference-Cited by-同舟云学术

An improved general procedure for lexicographic bottleneck problems

Published:1999-05 Issue:4 Volume:24 Page:187-194
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Croce Federico Della,Paschos Vangelis Th.,Tsoukias Alexis

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference12 articles.

1. An algebraic approach to assignment problems;Burkard;Math. Programming,1977

2. Lexicographic bottleneck problems;Burkard;Oper. Res. Lett.,1991

3. R.E. Burkard, U. Zimmermann, Combinatorial optimization in linearly ordered semimodules: a survey, in: B. Korte (Ed.), Modern Applied Mathematics: Optimization and Operations Research, North-Holland, Amsterdam, 1982.

4. H.I. Calvete, P.M. Mateo, Lexicographic optimization in generalized network flow problems, J. Oper. Res. Soc. 49(5) (1998) 519–529.

5. N. Christophides, Graph Theory an Algorithmic Approach, Academic Press, New York, 1975.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem;European Journal of Operational Research;2017-08

2. Revisiting k-sum optimization;Mathematical Programming;2016-12-16

3. Bottleneck partial-matching Voronoi diagrams and applications;Computational Geometry;2016-01

4. Using the Sugeno Integral in Optimal Assignment Problems with Qualitative Utilities;FRONT ARTIF INTEL AP;2016

5. Fairness in Academic Course Timetabling;Lecture Notes in Economics and Mathematical Systems;2014-12-17