期刊
JOURNAL OF COMBINATORIAL OPTIMIZATION
卷 7, 期 1, 页码 87-103出版社
SPRINGER
DOI: 10.1023/A:1021950608048
关键词
bounds; partition; constraint relaxation; tabu search; branch & bound
This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the divide and pas conquer principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplex-based linear programming relaxation and a relaxed knapsack approach for the problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据