Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Algorithmic Challenges. Plenary Lecture at the The Nineth International SP Conference (August 28, 2001)
Автор: Suvrajeet Sen
Аннотация:
This Presentation: Transitions from Continuous to Discrete
1. Lessons from successful algorithms
• Convexity and Decomposition
• Special structure
• Sampling
• Inexact “solves”
2. “Informal” exploration of challenges in multi-stage problems