DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden_US
dc.contributor.authorDrezner, Zvien_US
dc.contributor.authorBrimberg, Jacken_US
dc.contributor.authorUrošević, Draganen_US
dc.date.accessioned2022-12-06T16:25:17Z-
dc.date.available2022-12-06T16:25:17Z-
dc.date.issued2022-
dc.identifier.isbn978-3-030-96934-9-
dc.identifier.isbn978-3-030-96935-6-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4902-
dc.description.abstractGenerally speaking, the phrase “Less is more” implies that we use as few resources as possible in doing something while providing the best possible outcome. This approach has been applied successfully in almost all the scientific and art disciplines. The idea has also been recently explored with success in solving hard optimization problems. In this chapter, we first give the main principles of the less is more approach (LIMA) in solving continuous and combinatorial Global Optimization problems, and then explain in more detail some of its successful implementations.en_US
dc.publisherPalgrave Macmillanen_US
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleLess Is More Approach in Heuristic Optimizationen_US
dc.typeBook Chapteren_US
dc.relation.publicationThe Palgrave Handbook of Operations Researchen_US
dc.identifier.doi10.1007/978-3-030-96935-6_14-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage469-
dc.relation.lastpage499-
item.cerifentitytypePublications-
item.openairetypeBook Chapter-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

2
checked on Jun 8, 2023

Page view(s)

24
checked on Jun 8, 2023

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons