Strengthened 0-1 linear formulation for the daily satellite mission planning (Q2369977): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Node packings on cocomparability graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Earth observation satellite management / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bounds for the SPOT 5 daily photograph scheduling problem / rank | |||
Normal rank |
Latest revision as of 09:23, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strengthened 0-1 linear formulation for the daily satellite mission planning |
scientific article |
Statements
Strengthened 0-1 linear formulation for the daily satellite mission planning (English)
0 references
21 June 2007
0 references
integer programming
0 references
stable set polytope
0 references
satellite mission planning
0 references
cocomparability graph
0 references