๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A dynamic programming solution to the n-queens problem

โœ Scribed by Igor Rivin; Ramin Zabih


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
361 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Dynamic programming approaches to the mu
โœ Kathrin Klamroth; Margaret M. Wiecek ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 251 KB ๐Ÿ‘ 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul