Solving the swath segment selection problem through Lagrangean relaxation (Q2456644): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Three Scheduling Algorithms Applied to the Earth Observing Systems Domain / 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
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two exact algorithms for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank

Latest revision as of 11:21, 27 June 2024

scientific article
Language Label Description Also known as
English
Solving the swath segment selection problem through Lagrangean relaxation
scientific article

    Statements