Heuristic improvement methods: How should starting solutions be chosen?

From MaRDI portal

Revision as of 19:25, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3885514

Jump to:navigation, search

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 optimization hill climbing choice of starting solutions heuristic improvement methods

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (3)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3885514&oldid=17525185"