no code implementations • 16 Mar 2018 • Othar Hansson, Andrew Mayer, Marco Valtorta
In this paper, we review the traditional definition of problem relaxation and show that searching in the abstraction hierarchy created by problem relaxation will not reduce the computational effort required to find optimal solutions to the base- level problem, unless the relaxed problem found in the hierarchy can be transformed by some optimization (e. g., subproblem factoring).
