Using xQx to model and solve the uncapacitated task allocation problem

Authors:
Mark Lewis;Bahram Alidaee;Gary Kochenberger
Affiliations:
Hearin Center for Enterprise Science, School of Business, University of Mississippi, University, MS, USA;Hearin Center for Enterprise Science, School of Business, University of Mississippi, University, MS, USA;School of Business, University of Colorado, Denver, CO, USA
Venue:
Operations Research Letters
Year:
2005

Citing 11
Cited 2

Heuristic Algorithms for Task Assignment in Distributed Systems

IEEE Transactions on Computers
An efficient algorithm for a task allocation problem

Journal of the ACM (JACM)
A decomposition method for quadratic zero-one programming

Management Science
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
A scatter search approach to unconstrained quadratic binary programs

New ideas in optimization
A hybrid heuristic to solve a task allocation problem

Computers and Operations Research
Task Allocation on a Network of Processors

IEEE Transactions on Computers
Pseudo-boolean optimization

Discrete Applied Mathematics
Multiprocessor Scheduling with the Aid of Network Flow Algorithms

IEEE Transactions on Software Engineering
Task Allocation in Distributed Data Processing

Computer
An algorithm for the multiprocessor assignment problem

Operations Research Letters

A new modeling and solution approach for the set-partitioning problem

Computers and Operations Research
Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper illustrates how large instances of the unconstrained task allocation problem can be effectively modeled and efficiently solved as unconstrained quadratic binary programs. Computational experience and a comparison to the state-of-the-art commercial code (CPLEX) illustrate the attractiveness of our approach.