An adaptive memory matheuristic for the set orienteering problem (Q6112827): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2023.02.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2023.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4319868504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clustered orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the family traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for the set 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: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Generalized Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedures for travelling salesman problems with additional constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible space exploring matheuristic for the production routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the family traveling salesperson problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random-key genetic algorithm for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory programming: a unified view of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: POPMUSIC for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the vehicle routing problem with adaptive memory programming methodology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the undirected capacitated arc routing problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated distribution and loading planning via a compact metaheuristic algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2023.02.008 / rank
 
Normal rank

Latest revision as of 18:34, 30 December 2024

scientific article; zbMATH DE number 7709384
Language Label Description Also known as
English
An adaptive memory matheuristic for the set orienteering problem
scientific article; zbMATH DE number 7709384

    Statements

    An adaptive memory matheuristic for the set orienteering problem (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2023
    0 references
    transportation
    0 references
    routing
    0 references
    set orienteering
    0 references
    matheuristic
    0 references

    Identifiers