An exact algorithm for the minimum squared load assignment problem
buir.contributor.author | Karsu, Özlem | |
dc.citation.epage | 90 | en_US |
dc.citation.spage | 76 | en_US |
dc.citation.volumeNumber | 106 | en_US |
dc.contributor.author | Karsu, Özlem | en_US |
dc.contributor.author | Azizoglu, M. | en_US |
dc.date.accessioned | 2020-01-28T07:57:55Z | |
dc.date.available | 2020-01-28T07:57:55Z | |
dc.date.issued | 2019 | |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | In this study, we consider an assignment problem with the objective to minimize the sum of squared loads over all agents. We provide mixed integer nonlinear and linear programming formulations of the problem and present a branch and bound algorithm for their solution. The results of our computational experiment have shown the satisfactory behavior of our branch and bound algorithm. | en_US |
dc.embargo.release | 2022-06-01 | |
dc.identifier.doi | 10.1016/j.cor.2019.02.011 | en_US |
dc.identifier.issn | 0305-0548 | |
dc.identifier.uri | http://hdl.handle.net/11693/52865 | |
dc.language.iso | English | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.isversionof | https://dx.doi.org/10.1016/j.cor.2019.02.011 | en_US |
dc.source.title | Computers and Operations Research | en_US |
dc.subject | Assignment problem | en_US |
dc.subject | Squared load | en_US |
dc.subject | Branch | en_US |
dc.subject | Bound | en_US |
dc.title | An exact algorithm for the minimum squared load assignment problem | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- An_exact_algorithm_for_the_minimum_squared_load_assignment_problem.pdf
- Size:
- 925.52 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: