Research Article
List of Optimal Solutions of the Minimum Cost for Minimum Time Assignment Problem
@INPROCEEDINGS{10.1007/978-3-031-44668-9_7, author={Lasko M. Laskov and Marin L. Marinov}, title={List of Optimal Solutions of the Minimum Cost for Minimum Time Assignment Problem}, proceedings={Computer Science and Education in Computer Science. 19th EAI International Conference, CSECS 2023, Boston, MA, USA, June 28--29, 2023, Proceedings}, proceedings_a={CSECS}, year={2023}, month={10}, keywords={Pareto optimal Assignment problem Branch and bound}, doi={10.1007/978-3-031-44668-9_7} }- Lasko M. Laskov
Marin L. Marinov
Year: 2023
List of Optimal Solutions of the Minimum Cost for Minimum Time Assignment Problem
CSECS
Springer
DOI: 10.1007/978-3-031-44668-9_7
Abstract
One of the fundamental problems in the disciplines of combinatorial optimization and operation research is theassignment problem(AP). Even though the AP and its variants has been explored extensively in the specialized literature, most of the resources are focused on the calculation of a single optimal solution. In this paper we propose an approach that generates a list of optimal solutions.
We focus on the bi-criteria variant of the AP in which two objectives are minimized:costandtime. Our approach finds the maximal subset of assignments that are Pareto optimal, and have minimal cost. In particular, the method finds a list of all assignments that are optimal with respect to the cost criterion.
Copyright © 2023–2025 ICST
