Heuristic improvement methods: How should starting solutions be chosen?

DOI10.1007/BFb0120914zbMath0442.90057MaRDI QIDQ3885514

C. Pursglove, T. Brian Boffey

Publication date: 1980

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

zbMATH Keywords

discrete optimizationhill climbingchoice of starting solutionsheuristic improvement methods

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

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