Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113875419, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for team orienteering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal solution procedure for the multiple tour maximum collection problem using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and effective heuristic for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the orienteering problem with time windows via the pulse framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem with variable profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the undirected selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orienteering Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong linear programming relaxations for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2956989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized orienteering problem with resource dependent rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Orienteering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-period orienteering problem with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank

Latest revision as of 17:09, 29 July 2024

scientific article
Language Label Description Also known as
English
Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
scientific article

    Statements

    Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (English)
    0 references
    0 references
    0 references
    22 July 2022
    0 references
    dynamic programming
    0 references
    bounding
    0 references
    multi-profit orienteering problem
    0 references
    exact approach
    0 references
    0 references
    0 references

    Identifiers