Partial enumeration in heuristics for some combinatorial optimization problems

DOI10.1057/PALGRAVE.JORS.2602102MaRDI QIDQ5292805zbMATH OpenOpenAlexFDO

Authors A. Volgenant, I. Y. Zwiers

Publication date 25 June 2007

Published in The 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

generalized knapsack problemheuristicspartial enumerationschedulingsingle-machine weighted tardiness

Mathematics Subject Classification ID

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

Recommendations

• An improved partial enumeration algorithm for integer programming problems
• A partial enumeration algorithm for pure nonlinear integer programming
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• A partial enumeration algorithm for solving PNS problems
• A partial enumeration heuristic for multi-objective flowshop scheduling problems

Cited in

(6)

• An improved partial enumeration algorithm for integer programming problems
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Complexity indices for the multidimensional knapsack problem
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A partial enumeration algorithm for pure nonlinear integer programming
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem

This page was built for publication: Partial enumeration in heuristics for some combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292805)