The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
From MaRDI portal
Publication:2901023
DOI10.1287/ijoc.1070.0253zbMath1243.90095OpenAlexW2121110351MaRDI QIDQ2901023
Kim Allan Andersen, Christian Roed Pedersen, Lars Relund Nielsen
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0253
Related Items (5)
A population-based algorithm for solving linear assignment problems with two objectives ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Bicriterion Shortest Paths in Stochastic Time-Dependent Networks
This page was built for publication: The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
