An exact algorithm for the minimum squared load assignment problem

Available
The embargo period has ended, and this item is now available.

Date

2019

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Computers and Operations Research

Print ISSN

0305-0548

Electronic ISSN

Publisher

Elsevier

Volume

106

Issue

Pages

76 - 90

Language

English

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
0
views
34
downloads

Series

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.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)