A two-level metaheuristic for the all colors shortest path problem (Q1616945): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Francesco Carrabs / rank
 
Normal rank
Property / author
 
Property / author: Raffaele Cerulli / rank
 
Normal rank
Property / author
 
Property / author: Rosa Pentangelo / rank
 
Normal rank
Property / author
 
Property / author: Andrea Raiconi / 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-018-0014-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2806379636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric generalized traveling salesman polytope / 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: Heuristic Search for the Generalized Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class Steiner trees and VLSI-design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new relaxation method for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle swarm optimization-based algorithms for TSP and generalized TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random-key genetic algorithm for the generalized traveling salesman problem / rank
 
Normal rank

Revision as of 07:32, 17 July 2024

scientific article
Language Label Description Also known as
English
A two-level metaheuristic for the all colors shortest path problem
scientific article

    Statements

    A two-level metaheuristic for the all colors shortest path problem (English)
    0 references
    7 November 2018
    0 references
    0 references
    shortest path
    0 references
    colored graph
    0 references
    variable neighboord search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references