Publication
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
| datacite.subject.fos | Ciências Naturais::Ciências da Computação e da Informação | |
| datacite.subject.fos | Ciências Naturais::Matemáticas | |
| datacite.subject.fos | Ciências Sociais::Economia e Gestão | |
| datacite.subject.sdg | 07:Energias Renováveis e Acessíveis | |
| datacite.subject.sdg | 09:Indústria, Inovação e Infraestruturas | |
| datacite.subject.sdg | 11:Cidades e Comunidades Sustentáveis | |
| dc.contributor.author | Silva, Carlos Gomes da | |
| dc.contributor.author | Clímaco, João | |
| dc.contributor.author | Filho, Adiel Almeida | |
| dc.date.accessioned | 2025-12-17T20:05:44Z | |
| dc.date.available | 2025-12-17T20:05:44Z | |
| dc.date.issued | 2009-10-15 | |
| dc.description.abstract | The small world phenomenon, Milgram (1967) has inspired the study of real networks such as cellular networks, telephone call networks, citation networks, power and neural networks, etc. The present work is about the study of the graphs produced by efficient solutions of the bi-objective {0,1}-knapsack problem. The experiments show that these graphs exhibit properties of small world networks. The importance of the supported and non-supported solutions in the entire efficient graph is investigated. The present research could be useful for developing more effective search strategies in both exact and approximate solution methods of {0,1} multi-objective combinatorial optimization problems. | eng |
| dc.description.sponsorship | The authors would like to thank to the editor of the 4OR and to the anonymous referees for their comments and suggestions. | |
| dc.identifier.citation | Gomes da Silva, C., Clímaco, J. & Filho, A.A. The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem. 4OR-Q J Oper Res 8, 195–211 (2010). https://doi.org/10.1007/s10288-009-0110-3. | |
| dc.identifier.doi | 10.1007/s10288-009-0110-3 | |
| dc.identifier.eissn | 1614-2411 | |
| dc.identifier.issn | 1619-4500 | |
| dc.identifier.uri | http://hdl.handle.net/10400.8/15144 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | |
| dc.publisher | Springer Nature | |
| dc.relation.hasversion | https://link.springer.com/article/10.1007/s10288-009-0110-3 | |
| dc.relation.ispartof | 4OR | |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Networks | |
| dc.subject | Small world measures | |
| dc.subject | {0 1} Multi-objective combinatorial optimization problems | |
| dc.title | The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem | eng |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 211 | |
| oaire.citation.startPage | 195 | |
| oaire.citation.title | 4OR: A Quarterly Journal of Operations Research | |
| oaire.citation.volume | 8 | |
| oaire.version | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |
| person.familyName | Gomes da Silva | |
| person.givenName | Carlos | |
| person.identifier.orcid | 0000-0002-7405-9502 | |
| relation.isAuthorOfPublication | af344878-0953-4a5c-82c7-4edffd17b9b6 | |
| relation.isAuthorOfPublication.latestForDiscovery | af344878-0953-4a5c-82c7-4edffd17b9b6 |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- The small world of efficient solutions Empirical evidence from the bi-objective {0,1}-knapsack problem.pdf
- Size:
- 498.47 KB
- Format:
- Adobe Portable Document Format
- Description:
- The small world phenomenon, Milgram (1967) has inspired the study of real networks such as cellular networks, telephone call networks, citation networks, power and neural networks, etc. The present work is about the study of the graphs produced by efficient solutions of the bi-objective {0,1}-knapsack problem. The experiments show that these graphs exhibit properties of small world networks. The importance of the supported and non-supported solutions in the entire efficient graph is investigated. The present research could be useful for developing more effective search strategies in both exact and approximate solution methods of {0,1} multi-objective combinatorial optimization problems.
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.32 KB
- Format:
- Item-specific license agreed upon to submission
- Description: