Conference paper

Optimal solution stability in dynamic, distributed constraint optimization

We define the distributed continuous-time combinatorial optimization problem. We propose a new notion of solution stability in aynamic optimization, based on the cost Of change from an already-implemented solution to the new one. Change costs are modeled with stability constraints, and can evolve over time.


  • There is no available fulltext. Please contact the lab or the authors.

Related material