Results
eNauka >
Results >
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
| Title: | An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem | Authors: | Bogdanović, Milena   |
Issue Date: | 2010 | Publication: | Computers and Mathematics with Applications | ISSN: | 0898-1221 Computers and Mathematics with Applications Search Idenfier |
Type: | Article | Collation: | vol. 59 br. 9 str. 3029-3038 | DOI: | 10.1016/j.camwa.2010.02.021 | WoS-ID: | 000277850400001 | Scopus-ID: | 2-s2.0-77951023326 | URI: | https://enauka.gov.rs/handle/123456789/327038 | Metadata source: | (Preuzeto iz ORCID-a) Bogdanović, Milena Migrirano iz RIS podataka |
M-category: | 21M21 |
Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.