Login / Signup

An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine.

Wojciech BozejkoJaroslaw PemperaMariusz UchronskiMieczyslaw Wodecki
Published in: PCC (2) (2023)
Keyphrases
  • branch and bound algorithm
  • lower bound
  • np hard
  • genetic algorithm
  • branch and bound
  • optimal solution
  • randomly generated problems