When solving an OP instance via the exact solver across independent runs, a small number of extreme cases yield clearly infeasible solutions that violate the time budget constraint. These infeasible solutions correspond to node subsets whose indices appear in strictly ascending order. It seems that there are bugs in the code.
When solving an OP instance via the exact solver across independent runs, a small number of extreme cases yield clearly infeasible solutions that violate the time budget constraint. These infeasible solutions correspond to node subsets whose indices appear in strictly ascending order. It seems that there are bugs in the code.