Watch the Dallas Symposium LIVE, and fundraiser auction
Ticket proceeds support mindat.org! - click here...
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Bogdanović, Milena (2010) An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem. Computers & Mathematics with Applications, 59. 3029-3038 doi:10.1016/j.camwa.2010.02.021

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleAn ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
JournalComputers & Mathematics with Applications
AuthorsBogdanović, MilenaAuthor
Year2010 (May)Volume59
PublisherElsevier BV
DOIdoi:10.1016/j.camwa.2010.02.021Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6573786Long-form Identifiermindat:1:5:6573786:0
GUID0
Full ReferenceBogdanović, Milena (2010) An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem. Computers & Mathematics with Applications, 59. 3029-3038 doi:10.1016/j.camwa.2010.02.021
Plain TextBogdanović, Milena (2010) An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem. Computers & Mathematics with Applications, 59. 3029-3038 doi:10.1016/j.camwa.2010.02.021
In(n.d.) Computers & Mathematics with Applications Vol. 59. Elsevier BV

See Also

These are possibly similar items as determined by title/reference text matching only.

Allahverdi, Ali, Aydilek, Harun (2010) Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. Computers & Mathematics with Applications, 60. 1374-1384 doi:10.1016/j.camwa.2010.06.019
Norman Katz, I., Vogl, Steven R. (2010) A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem. Computers & Mathematics with Applications, 59. 399-410 doi:10.1016/j.camwa.2009.07.007
Haupt, S.E. (2006) A quadratic empirical model formulation for dynamical systems using a genetic algorithm. Computers & Mathematics with Applications, 51. 431-440 doi:10.1016/j.camwa.2005.10.005
Aydilek, Harun, Allahverdi, Ali (2010) Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & Mathematics with Applications, 59. 684-693 doi:10.1016/j.camwa.2009.10.025
Laskri, Yamina, Tatar, Nasser-eddine (2010) The critical exponent for an ordinary fractional differential problem. Computers & Mathematics with Applications, 59. 1266-1270 doi:10.1016/j.camwa.2009.06.031
Kiguradze, Tariel (2010) The Vallée-Poussin problem for higher order nonlinear hyperbolic equations. Computers & Mathematics with Applications, 59. 994-1002 doi:10.1016/j.camwa.2009.09.009
Yan, Lisa Jing, Cercone, Nick (2010) Bayesian network modeling for evolutionary genetic structures. Computers & Mathematics with Applications, 59. 2541-2551 doi:10.1016/j.camwa.2009.12.039
Wang, Guangmin, Zhu, Kejun, Wan, Zhongping (2010) An approximate programming method based on the simplex method for bilevel programming problem. Computers & Mathematics with Applications, 59. 3355-3360 doi:10.1016/j.camwa.2010.03.027
Cheng, Wei, Zhao, Ling-Ling, Fu, Chu-Li (2010) Source term identification for an axisymmetric inverse heat conduction problem. Computers & Mathematics with Applications, 59. 142-148 doi:10.1016/j.camwa.2009.08.038
Khan, Safeer Hussain, Yildirim, Isa, Ozdemir, Murat (2010) Convergence of an implicit algorithm for two families of nonexpansive mappings. Computers & Mathematics with Applications, 59. 3084-3091 doi:10.1016/j.camwa.2010.02.029
Manouzi, H. (2005) A mixed variational formulation for the navier-stokes problem with hyper-dissipation. Computers & Mathematics with Applications, 50. 1639-1646 doi:10.1016/j.camwa.2005.06.007
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: August 21, 2025 13:02:13
Go to top of page