A Mathematical Programming Algorithm for Planning and Scheduling an Earth Observing SAR Constellation
Nicola Bianchessi, Giovanni Righini · 2006
We consider the planning and scheduling problem of the COSMO-SkyMed constellation for the observation of the Earth. We define a simplified problem which only takes into account the most binding constraints of the real problem. We present a Lagrangean relaxation algorithm that provides up-per bounds and we show that it can also be used to guide an existing heuristic algorithm to find better solutions to the real problem.