Reduction tests for the prize-collecting Steiner problem (Q2466593): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2005.02.007 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Problem reduction methods and a tree generation algorithm for the steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the 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: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / 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: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing Steiner problems from VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3471884 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2005.02.007 / rank
 
Normal rank

Latest revision as of 20:51, 18 December 2024

scientific article
Language Label Description Also known as
English
Reduction tests for the prize-collecting Steiner problem
scientific article

    Statements

    Identifiers