Preprocessing rules for integer programming solutions to the generalised assignment problem

Kong M-T () and N Shah ()
Additional contact information
Kong M-T: Imperial College of Science, Technology and Medicine
N Shah: Imperial College of Science, Technology and Medicine

Journal of the Operational Research Society, 2001, vol. 52, issue 5, 567-575

Abstract: Abstract Several preprocessing rules to reduce integer programming problem size are proposed and examined for the generalised assignment problem. The rules make use of the linear programming relaxation and ranking on the basis of a combined resource/cost metric. Computational experiments with commercial branch and bound solvers have been performed using publicly available problem data from the OR library. Results are promising as the preprocessed problem solves to within 1% of the full problem with significantly less CPU time for most of the test problems examined.

Keywords: assignment; optimisation; heuristics; preprocessing rules (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601111 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:52:y:2001:i:5:d:10.1057_palgrave.jors.2601111

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601111

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().