6976 search results - page 143 / 1396 » The Oil Searching Problem |
198
click to vote
AAAI
2000
15 years 7 months ago
2000
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
169
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
220
click to vote
EVOW
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
183
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
164
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...