A tabu search heuristic for the generalized minimum spanning tree problem (Q933503): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ejor.2007.08.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017602820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group Steiner problems as Steiner problems. / 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: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering 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: Upper and lower bounding strategies for the generalized minimum spanning tree problem / 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: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / 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: Q4448919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the prize-collecting 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: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank

Latest revision as of 13:38, 28 June 2024

scientific article
Language Label Description Also known as
English
A tabu search heuristic for the generalized minimum spanning tree problem
scientific article

    Statements

    A tabu search heuristic for the generalized minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2008
    0 references
    0 references
    generalized minimum spanning tree
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references