The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local Search (Jul., 2004), pp. 705-716 (12 pages) The Bin Packing Problem and the Cutting Stock Problem are two ...
Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue, researchers ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback