A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / 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.1016/j.cor.2004.09.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026880805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem: II. Polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong lower bounds for the prize collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs with Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Graphical Steiner Tree Problem Using Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:48, 24 June 2024

scientific article
Language Label Description Also known as
English
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
scientific article

    Statements

    A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (English)
    0 references
    0 references
    30 June 2006
    0 references
    prize collecting Steiner tree
    0 references
    Lagrangian decomposition
    0 references
    volume algorithm
    0 references
    genetic algorithm
    0 references

    Identifiers