We develop the theory and method to solve the MIPs of real-world multi-module PESPs (Periodic Event Scheduling Problems) with nested modules. To this end, we introduce the concept of sharp trees which we show to be a prerequisite for strong cycle basis formulations of the PESP. We show how sharp trees can be found in case of nested divisors. Computations testify the effectiveness of our method.
Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems
GALLI, LAURA;
2010-01-01
Abstract
We develop the theory and method to solve the MIPs of real-world multi-module PESPs (Periodic Event Scheduling Problems) with nested modules. To this end, we introduce the concept of sharp trees which we show to be a prerequisite for strong cycle basis formulations of the PESP. We show how sharp trees can be found in case of nested divisors. Computations testify the effectiveness of our method.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
