Partial enumeration in heuristics for some combinatorial optimization problems

A Volgenant () and I Y Zwiers
Additional contact information
A Volgenant: University of Amsterdam
I Y Zwiers: University of Amsterdam

Journal of the Operational Research Society, 2007, vol. 58, issue 1, 73-79

Abstract: Abstract We consider partial enumeration as a routine to improve heuristics in practice. For the multidimensional 0–1 knapsack problem and the single-machine weighted tardiness problem, known heuristics have been extended with partial enumeration. Various variants have been compared. The results show improvements in the obtained solutions at a modest extra effort in implementation and computing time.

Keywords: heuristics; partial enumeration; generalized knapsack problem; scheduling; single-machine weighted tardiness (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602102 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:58:y:2007:i:1:d:10.1057_palgrave.jors.2602102

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

DOI: 10.1057/palgrave.jors.2602102

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 ().