1 resultado para Information Search and Filtering
em Dalarna University College Electronic Archive
Filtro por publicador
- JISC Information Environment Repository (3)
- Repository Napier (3)
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Aberdeen University (3)
- Aberystwyth University Repository - Reino Unido (18)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Applied Math and Science Education Repository - Washington - USA (1)
- Aquatic Commons (2)
- Archive of European Integration (54)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (20)
- 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) (1)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (21)
- Boston University Digital Common (5)
- Brock University, Canada (7)
- Bulgarian Digital Mathematics Library at IMI-BAS (39)
- CaltechTHESIS (3)
- Cambridge University Engineering Department Publications Database (22)
- CentAUR: Central Archive University of Reading - UK (39)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (9)
- Cochin University of Science & Technology (CUSAT), India (6)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (34)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- CUNY Academic Works (3)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (102)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons @ Winthrop University (1)
- Digital Commons at Florida International University (13)
- DigitalCommons@The Texas Medical Center (8)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (4)
- Duke University (8)
- eScholarship Repository - University of California (2)
- Greenwich Academic Literature Archive - UK (5)
- Helda - Digital Repository of University of Helsinki (15)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (4)
- Indian Institute of Science - Bangalore - Índia (25)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (7)
- Massachusetts Institute of Technology (4)
- Memoria Académica - FaHCE, UNLP - Argentina (6)
- National Center for Biotechnology Information - NCBI (7)
- Nottingham eTheses (1)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (1)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (45)
- Queensland University of Technology - ePrints Archive (199)
- Repositorio Académico de la Universidad Nacional de Costa Rica (5)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (14)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (19)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- School of Medicine, Washington University, United States (1)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (15)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (4)
- University of Canberra Research Repository - Australia (2)
- University of Connecticut - USA (1)
- University of Michigan (52)
- University of Queensland eSpace - Australia (22)
- University of Southampton, United Kingdom (3)
- University of Washington (3)
- WestminsterResearch - UK (2)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few studies have advocated and tested statistical bounds as a method for assessment. These studies indicate that statistical bounds are superior to the more widely known and used deterministic bounds. However, the previous studies have been limited to a few metaheuristics and combinatorial problems and, hence, the general performance of statistical bounds in combinatorial optimization remains an open question. This work complements the existing literature on statistical bounds by testing them on the metaheuristic Greedy Randomized Adaptive Search Procedures (GRASP) and four combinatorial problems. Our findings confirm previous results that statistical bounds are reliable for the p-median problem, while we note that they also seem reliable for the set covering problem. For the quadratic assignment problem, the statistical bounds has previously been found reliable when obtained from the Genetic algorithm whereas in this work they found less reliable. Finally, we provide statistical bounds to four 2-path network design problem instances for which the optimum is currently unknown.