A Simulated Annealing Algorithm for General Zero-One Programming Problems

DOI10.1080/02522667.1991.10699071MaRDI QIDQ3360004zbMATH OpenOpenAlexFDO

Authors Reidun Helming, Kurt Jörnsten

Publication date 1991

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1991.10699071

zbMATH Keywords

branch and boundcutting planesmulticonstraint knapsack problemsPivot and Complement heuristicsimulated annealingzero-one programming

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• General Purpose Simulated Annealing
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Simulated annealing for the 0/1 multidimensional knapsack problem
• A simulated annealing code for general integer linear programs

Cites work

• A note on the pivot and complement heuristic for 0-1 programming problems
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• Pivot and Complement–A Heuristic for 0-1 Programming

Cited in

(8)

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A simulated annealing code for general integer linear programs
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
• Simulated annealing for the 0/1 multidimensional knapsack problem
• scientific article; zbMATH DE number 151871 (Why is no real title available?)
• scientific article; zbMATH DE number 1203374 (Why is no real title available?)
• scientific article; zbMATH DE number 1293605 (Why is no real title available?)
• A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound

This page was built for publication: A Simulated Annealing Algorithm for General Zero-One Programming Problems

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