The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results

References

• da Silva C. G., Clímaco J., Figueira J. A scatter search method for bi-criteria {0, 1}-knapsack problems. Eur. J. Oper. Res. (2006) 169:373–391Crossref, Google Scholar
• Ehrgott M.Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems (2000) 491(Springer-Verlag, Berlin) Google Scholar
• Gandibleux X., Morita H., Katoh N. Use of genetic heritage for solving the assignment problem with two objectives. Lecture Notes in Computer Science (2003) 2632(Springer, Berlin) 43–57Crossref, Google Scholar
• Gandibleux X., Morita H., Katoh N. A population-based metaheuristic for solving assignment problems with two objectives. J. Math. Model. Algorithms (2005) . ForthcomingGoogle Scholar
• Hansen P. Bicriterion path problems. Multiple Criteria Decision Making, Theory and Application, Lecture Notes in Economics and Mathematical Systems (1979) 177(Springer-Verlag, Berlin) 109–127Google Scholar
• Jonker R., Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing (1987) 38:325–340Crossref, Google Scholar
• Murty K. G. An algorithm for ranking all the assignments in order of increasing cost. Oper. Res. (1968) 16:682–687Link, Google Scholar
• Nielsen L. R., Pedersen C. R. APGen—An assignment problem generator. (2006) . Reference manual, University of Aarhus, Aarhus, Denmark. http://www.research.relund.dkGoogle Scholar
• Nielsen L. R., Andersen K. A., Pretolani D. Bicriterion shortest hyperpaths in random time-dependent networks. IMA J. Management Math. (2003) 14:271–303Crossref, Google Scholar
• Pedersen C. R. Multicriteria discrete optimization—And related topics. (2006) . Ph.D. thesis, Department of Operations Research, University of Aarhus, Aarhus, DenmarkGoogle Scholar
• Pedersen C. R., Nielsen L. R., Andersen K. A. A note on ranking assignments using reoptimization. (2005a) . Working Paper 2005/2, Department of Operations Research, University of Aarhus, Aarhus, Denmark. http://www.imf.au.dk/publs?id=585Google Scholar
• Pedersen C. R., Nielsen L. R., Andersen K. A. On the bicriterion multi modal assignment problem. (2005b) . Working Paper 2005/3, Department of Operations Research, University of Aarhus, Aarhus, Denmark. http://www.imf.au.dk/publs?id=586Google Scholar
• Pedersen C. R., Nielsen L. R., Andersen K. A. An algorithm for ranking assignments using reoptimization. doi 10.1016/j.cor.2007.04.008. Comput. Oper. Res. (2007) . ForthcomingGoogle Scholar
• Przybylski A., Gandibleux X., Ehrgott M. The biobjective integer minimum cost flow problem—Incorrectness of Sedeño-Noda and González-Martín's algorithm. Comput. Oper. Res. (2006) 33:1459–1463Crossref, Google Scholar
• Przybylski A., Gandibleux X., Ehrgott M. Two phase algorithms for the biobjective assignment problem. Eur. J. Oper. Res. (2008) 185(2):509–533Crossref, Google Scholar
• Serafini P., Jahn J., Krabs W. Some considerations about computational complexity for multi objective combinatorial problems. Recent Advances and Historical Development of Vector Optimization, Lecture Notes in Economics and Mathematical Systems (1986) 294(Springer, Berlin) 222–232Google Scholar
• Tuyttens D., Teghem J., Fortemps P., Van Nieuwenhuyze K. Performance of the MOSA method for the bicriteria assignment problem. J. Heuristics (2000) 6:295–310Crossref, Google Scholar
• Ulungu E. L., Teghem J. The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations Comput. Decision Sci. (1995) 20:149–165Google Scholar
• Warburton A. Approximation of Pareto optima in multiple-objective, shortest-path problems. Oper. Res. (1987) 35:70–79Link, Google Scholar