Algoritmi branch-and-bound (B&B) e schemi di approssimazione tempo-polinomiale
(PTAS) sono due aree apparentemente distanti dell’ottimizzazione combinatoria. We intend
A (parzialmente) bridge the gap between them while expanding the boundary of
theoretical knowledge on the B&quadro B. Algoritmi branch-and-bound
typically guarantee that an optimal solution is eventually found. Tuttavia, Noi
show that the standard implementation of branch-and-bound for certain knapsack
and scheduling problems also exhibits PTAS-like behavior, yielding increasingly
better solutions within polynomial time. Our findings are supported by
computational experiments and comparisons with benchmark methods. This paper is
an extended version of a paper accepted at ICALP 2025.

Questo articolo esplora i giri e le loro implicazioni.

Scarica PDF: