Heuristic improvement methods: How should starting solutions be chosen?

DOI10.1007/BFB0120914MaRDI QIDQ3885514zbMATH OpenFDO

Authors C. Pursglove, T. B. Boffey

Publication date 1980

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0120914

zbMATH Keywords

choice of starting solutionsdiscrete optimizationheuristic improvement methodshill climbing

Mathematics Subject Classification ID

Boolean programming (90C09)

Cited in

(3)

• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• The multidimensional 0-1 knapsack problem: an overview.
• Heuristic methods and applications: A categorized survey

This page was built for publication: Heuristic improvement methods: How should starting solutions be chosen?

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