An exact algorithm for the minimum squared load assignment problem

•We study the minimum squared load assignment problem.•We formulate the problem as a mixed integer linear programming model.•We present a branch and bound algorithm for its solution.•Our computational experiments show the satisfactory behavior of the algorithm. In this study, we consider an assignme...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 106; s. 76 - 90
Hlavní autoři: Karsu, Özlem, Azizoglu, Meral
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.06.2019
Pergamon Press Inc
Témata:
Algorithms
Assignment problem
Batch processing
Bound
Branch
Formulations
Linear programming
Mixed integer
Operations research
Squared load
Squared load
Bound
Assignment problem
Branch
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We study the minimum squared load assignment problem.•We formulate the problem as a mixed integer linear programming model.•We present a branch and bound algorithm for its solution.•Our computational experiments show the satisfactory behavior of the algorithm. 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2019.02.011