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 ...

J. A. Bennell, C. N. Potts, J. D. Whitehead, Local Search Algorithms for the Min-Max Loop Layout Problem, The Journal of the Operational Research Society, Vol. 53, No. 10, Special Issue: Applications ...

Post-Processing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems. IEEE Transactions on Quantum Engineering, 2024; 1 DOI: 10.1109/TQE.2024.3376721 ...

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do so for some critical optimization tasks.