Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2010.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087987937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / 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: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / 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: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches / 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: The node-weighted steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of two Steiner arborescence polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route problem with constraints / rank
 
Normal rank

Latest revision as of 12:11, 6 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic expedients for the prize collecting Steiner tree problem
scientific article

    Statements

    Algorithmic expedients for the prize collecting Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    31 May 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    reduction techniques
    0 references
    worst-case analysis
    0 references
    valid inequalities
    0 references
    0 references