A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts

被引：75

作者：

Gabrel, V

Moulet, A

Murat, C

Paschos, VT

机构：

[1] UNIV PARIS 09, LAMSADE, F-75775 PARIS 16, FRANCE

[2] LRBA, F-27200 VERNON, FRANCE

来源：

ANNALS OF OPERATIONS RESEARCH | 1997年 / 69卷 / 0期

关键词：

Graph Theory; Planning Problem; Single Model; Algorithmic Solution; Theory Concept;

D O I：

10.1023/A:1018920709696

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The satellite shot sequencing problem consists in choosing the pictures to be completed by defining sequences of shots which must respect technical constraints and limits. We propose a graph-theoretic model for both the medium- and the short-term sequencing and present algorithmic solutions by using properties of the model.

引用

页码：115 / 134

页数：20

共 11 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2]

Berge C, 1973, GRAPHS HYPERGRAPHS

[3]

CARLIER J, 1993, RAIRO-RECH OPER, V27, P77

[4]

FABIANI F, 1992, PLANIFICATION MISSIO

[5]

FUCHS JF, 1990, P INT C EXP PLANN SY

[6]

GABREL V, 1995, RAIRO-RECH OPER, V29, P155

[7]

GABREL V, 1994, THESIS U PARIS DAUPH

[8]

GASPIN C, 1989, J TELEMATICS INFOLRM, V6, P159

[9]

Gondran M., 1985, GRAPHES ALGORITHMES

[10]

MOORE JE, 1975, AIIE T MAR, P35

← 1 2 →