Efficient computation of tolerances in the weighted independent set problem for trees (Q378171): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q373206 / rank
Normal rank
 
Property / author
 
Property / author: Dmitriy S. Malyshev / rank
Normal rank
 
Property / author
 
Property / author: Boris I. Goldengorin / rank
 
Normal rank
Property / author
 
Property / author: Dmitriy S. Malyshev / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6225239 / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic progamming
Property / zbMATH Keywords: dynamic progamming / rank
 
Normal rank
Property / zbMATH Keywords
 
weighted independent set problem
Property / zbMATH Keywords: weighted independent set problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Three-Index Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal time algorithm for finding a maximum weight independent set in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower tolerance-based branch and bound algorithms for the ATSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc tolerances in shortest path and network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance-based branch and bound algorithms for the ATSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addendum on: ``Sensitivity analysis of the optimal assignment'' / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:38, 7 July 2024

scientific article
Language Label Description Also known as
English
Efficient computation of tolerances in the weighted independent set problem for trees
scientific article

    Statements