Since combinatorial optimization problems (COPs) are a class of non-deterministic polynomial-time (NP)-hard problems, it is impracticable to solve them in brute-force searches, which results in high ...
Abstract: The multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with many real-life applications. In this article, a memetic algorithm based on probability ...
Chalkbeat Ideas is a new section featuring reported columns on the big ideas and debates shaping American schools. Sign up for the Ideas newsletter to follow our work. An obscure university report has ...
Undergraduate students across North America sat down on Saturday to write a grueling six-hour math exam, many of them unlikely to solve a single problem. The notoriously brutal William Lowell Putnam ...
remove-circle Internet Archive's in-browser bookreader "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback