16 resultados para efficient algorithm
Filtro por publicador
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (7)
- Aston University Research Archive (16)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (66)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (12)
- Brock University, Canada (9)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- CentAUR: Central Archive University of Reading - UK (28)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (4)
- Cochin University of Science & Technology (CUSAT), India (49)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (2)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (98)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (4)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons at Florida International University (11)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (59)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (1)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (78)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (2)
- Martin Luther Universitat Halle Wittenberg, Germany (5)
- Massachusetts Institute of Technology (16)
- Nottingham eTheses (1)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (38)
- Repositório da Produção Científica e Intelectual da Unicamp (6)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (26)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (33)
- School of Medicine, Washington University, United States (1)
- Scielo Saúde Pública - SP (29)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (3)
- Universidad de Alicante (3)
- Universidad Politécnica de Madrid (23)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (24)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (4)
- Universitat de Girona, Spain (8)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (10)
- Université de Lausanne, Switzerland (113)
- Université de Montréal (2)
- Université de Montréal, Canada (37)
- Université Laval Mémoires et thèses électroniques (1)
- University of Queensland eSpace - Australia (69)
Resumo:
We compare a broad range of optimal product line design methods. The comparisons take advantage of recent advances that make it possible to identify the optimal solution to problems that are too large for complete enumeration. Several of the methods perform surprisingly well, including Simulated Annealing, Product-Swapping and Genetic Algorithms. The Product-Swapping heuristic is remarkable for its simplicity. The performance of this heuristic suggests that the optimal product line design problem may be far easier to solve in practice than indicated by complexity theory.