Partial enumeration in heuristics for some combinatorial optimization problems

DOI10.1057/palgrave.jors.2602102zbMath1156.90029OpenAlexW2035992748MaRDI QIDQ5292805

A. Volgenant, I. Y. Zwiers

Publication date: 25 June 2007

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602102

zbMATH Keywords

heuristicsschedulingpartial enumerationgeneralized knapsack problemsingle-machine weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, Complexity indices for the multidimensional knapsack problem, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem