A Simulated Annealing Algorithm for General Zero-One Programming Problems

DOI10.1080/02522667.1991.10699071zbMath0732.90064OpenAlexW2328315787MaRDI QIDQ3360004

Reidun Helming, Kurt O. 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

simulated annealingbranch and boundcutting planeszero-one programmingmulticonstraint knapsack problemsPivot and Complement heuristic

Mathematics Subject Classification ID

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

Cites Work

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

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