Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-008-9220-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052389493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for revenue maximization in a satellite scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earth observation satellite management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified tabu search heuristic for vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the value of a space mission / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / 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:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
scientific article

    Statements

    Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2010
    0 references
    0 references
    tabu search
    0 references
    consistent neighborhood
    0 references
    dynamic programming
    0 references
    0 references