Gotowa bibliografia na temat „Heuristic”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Heuristic”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Heuristic"
Sanggala, Ekra, i Muhammad Ardhya Bisma. "Perbandingan Savings Algorithm dengan Nearest Neighbour dalam Menyelesaikan Russian TSP Instances". Jurnal Media Teknik dan Sistem Industri 7, nr 1 (31.03.2023): 27. http://dx.doi.org/10.35194/jmtsi.v7i1.3039.
Pełny tekst źródłaSeipp, Jendrik. "Better Orders for Saturated Cost Partitioning in Optimal Classical Planning". Proceedings of the International Symposium on Combinatorial Search 8, nr 1 (1.09.2021): 149–53. http://dx.doi.org/10.1609/socs.v8i1.18438.
Pełny tekst źródłaWilt, Christopher, i Wheeler Ruml. "Effective Heuristics for Suboptimal Best-First Search". Journal of Artificial Intelligence Research 57 (31.10.2016): 273–306. http://dx.doi.org/10.1613/jair.5036.
Pełny tekst źródłaUrsani, Ziauddin, i David W. Corne. "Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem". Journal of Optimization 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/4786268.
Pełny tekst źródłaShperberg, Shahaf, Ariel Felner, Lior Siag i Nathan R. Sturtevant. "On the Properties of All-Pair Heuristics". Proceedings of the International Symposium on Combinatorial Search 17 (1.06.2024): 127–33. http://dx.doi.org/10.1609/socs.v17i1.31550.
Pełny tekst źródłaChen, Dillon Z., i Sylvie Thiébaux. "Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning". Proceedings of the International Symposium on Combinatorial Search 17 (1.06.2024): 203–7. http://dx.doi.org/10.1609/socs.v17i1.31559.
Pełny tekst źródłaÖzcan, Ender, Mustafa Misir, Gabriela Ochoa i Edmund K. Burke. "A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling". International Journal of Applied Metaheuristic Computing 1, nr 1 (styczeń 2010): 39–59. http://dx.doi.org/10.4018/jamc.2010102603.
Pełny tekst źródłaKuroiwa, Ryo, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro i J. Christopher Beck. "LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions". Proceedings of the International Conference on Automated Planning and Scheduling 31 (17.05.2021): 210–18. http://dx.doi.org/10.1609/icaps.v31i1.15964.
Pełny tekst źródłaBOUZY, BRUNO. "HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO". New Mathematics and Natural Computation 02, nr 02 (lipiec 2006): 139–46. http://dx.doi.org/10.1142/s1793005706000427.
Pełny tekst źródłaWilt, Christopher, i Wheeler Ruml. "Speedy Versus Greedy Search". Proceedings of the International Symposium on Combinatorial Search 5, nr 1 (1.09.2021): 184–92. http://dx.doi.org/10.1609/socs.v5i1.18320.
Pełny tekst źródłaRozprawy doktorskie na temat "Heuristic"
Peake, Katharine Louise. "Composition heuristics and theories and a proposed heuristic for business writing". CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3282.
Pełny tekst źródłaAmbrogi, Timothy. "Heuristic counterpoint". Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.
Pełny tekst źródłaMurthy, Sapna Guniguntla. "Disaster recovery heuristic : a mapping heuristic for optimum retrieval /". Online version of thesis, 2009. http://hdl.handle.net/1850/10733.
Pełny tekst źródłaGUTIERRES, RICARDO. "ADAPTIVE HEURISTIC CONTROLLERS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9409@1.
Pełny tekst źródłaUm controlador Heurístico Adaptativo baseia-se num conjunto de regras lingüísticas para conduzir um processo com modelo impreciso ou complexo ao estado desejado. O comportamento do processo deve respeitar os requisitos de performance predefinidos. Para satisfazer estes objetivos, a estrutura interna do controle sofre mudanças para adequá- la as condições vigentes no processo. Os métodos de adaptação abordados consideram a modificação de uma estrutura matricial interpretada como as correções incrementais, compatíveis com os ajustes a serem efetuados sobre o processo, ou como regras, constituídas por variáveis nebulosas, que requerem manipulações adicionais para produzir a saída do controlador. Em qualquer dos casos, a adaptação é realizada a partir de uma Tabela de Índices de Performance. Para facilitar a sua obtenção é implementado um procedimento, que fornece a representação matricial das regras lingüísticas, concatenadas na forma de um Algoritmo Lingüístico de Controle. O comportamento dinâmico do Sistema, composto pelos Controladores Heurísticos e por processos com modelos distintos, é considerado para Tabelas de índices de Performance com várias dimensões. As regras lingüísticas, correlacionadas com estas tabelas, foram elaboradas com diversas classes de atributos. As simulações realizadas concentram-se sobre os parâmetros dos controladores, que influenciam significativa- Os estudos abordam também o comportamento da estrutura interna destes controladores e o seu desempenho em termos da velocidade de atuação sobre o processo.
A heuristic Controller uses a set of linguistic rules, which are derived from expertise or human operators´ skills, in order to achieve control of processes that have inaccurate or complex models. An adaptative Heuristic Controller adjusts the set of rules in an automatic and continuous way, aiming to achieve prescribed objectives indicated by a performance measure. The adaptative procedures modify a matrix, the elements of which are either incremental corrections or numeric rules associated with fuzzy variables. In both cases a Performance Index Table and a learning method are employed to correct that matrix. The Performance Table is a matrix calculated from a set of linguistic rules. The controllers are implemented with different Performance Tables, considering various sets of linguistic values and quantization levels. The dynamic behaviour of overdamped and underdamped processes is investigated. The performance of simulated systems is analyzed with respect to relevant parameters that affect their behaviour.
Perry, Kristine. "Heuristic weighted voting /". Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2120.pdf.
Pełny tekst źródłaMonteith, Kristine Perry. "Heuristic Weighted Voting". BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/1206.
Pełny tekst źródłaSilva, Renato Teixeira da [UNESP]. "Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção". Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/93081.
Pełny tekst źródłaCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD`s) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego “normal”. Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados...
The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a “normal” job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
Silva, Renato Teixeira da. "Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção /". Guaratinguetá : [s.n.], 2012. http://hdl.handle.net/11449/93081.
Pełny tekst źródłaBanca: Marcos Antonio Pereira
Banca: Anibal Tavares de Azevedo
Resumo: A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD's) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego "normal". Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a "normal" job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
Mestre
Hosny, Manar Ibrahim. "Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems". Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/55181/.
Pełny tekst źródłaSanusi, Afeez Ayinla. "Train Dispatching: Heuristic Optimization". Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4107.
Pełny tekst źródłaKsiążki na temat "Heuristic"
Salhi, Saïd. Heuristic Search. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8.
Pełny tekst źródłaIppoliti, Emiliano, red. Heuristic Reasoning. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-09159-4.
Pełny tekst źródłaTahin, Gábor. Heuristic Rhetoric. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98482-3.
Pełny tekst źródłaNirmal, Arvind P. Heuristic explorations. Madras: Published for Gurukul Lutheran Theological College & Research Institute by Christian Literature Society, 1990.
Znajdź pełny tekst źródłaClancey, William J. Heuristic classification. [Alexandria, Va.]: DTIC, 1985.
Znajdź pełny tekst źródłaLappin, Gerald F. Heuristic symbolic integration. [S.l: The Author], 1987.
Znajdź pełny tekst źródłaDasgupta, Pallab, P. P. Chakrabarti i S. C. DeSarkar. Multiobjective Heuristic Search. Wiesbaden: Vieweg+Teubner Verlag, 1999. http://dx.doi.org/10.1007/978-3-322-86853-4.
Pełny tekst źródłaMoustakas, Clark E. Heuristic research: Design, methodology, and applications. Newbury Park: Sage Publications, 1990.
Znajdź pełny tekst źródłaLee, Kwang Y., i Mohamed A. El-Sharkawi, red. Modern Heuristic Optimization Techniques. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2008. http://dx.doi.org/10.1002/9780470225868.
Pełny tekst źródłaHegeman, J. H. Justifying policy: A heuristic. Amsterdam: Free University Press, 1989.
Znajdź pełny tekst źródłaCzęści książek na temat "Heuristic"
Pirrone, Angelo, Peter C. R. Lane, Laura Bartlett, Noman Javed i Fernand Gobet. "Heuristic Search of Heuristics". W Artificial Intelligence XL, 407–20. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-47994-6_36.
Pełny tekst źródłaGass, Saul I., i Carl M. Harris. "heuristic". W Encyclopedia of Operations Research and Management Science, 731. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_905.
Pełny tekst źródłaGass, Saul I., i Carl M. Harris. "heuristic". W Encyclopedia of Operations Research and Management Science, 731. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_906.
Pełny tekst źródłaWeik, Martin H. "heuristic". W Computer Science and Communications Dictionary, 721. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8330.
Pełny tekst źródłaXiang, Yao, i Yan Guoli. "Heuristic". W The ECPH Encyclopedia of Psychology, 1–2. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-6000-2_311-1.
Pełny tekst źródłaSalhi, Saïd. "Introduction". W Heuristic Search, 1–18. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_1.
Pełny tekst źródłaSalhi, Saïd. "Improvement-Only Heuristics". W Heuristic Search, 19–47. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_2.
Pełny tekst źródłaSalhi, Saïd. "Not Necessary Improving Heuristics". W Heuristic Search, 49–76. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_3.
Pełny tekst źródłaSalhi, Saïd. "Population-Based Heuristics". W Heuristic Search, 77–128. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_4.
Pełny tekst źródłaSalhi, Saïd. "Hybridisation Search". W Heuristic Search, 129–56. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_5.
Pełny tekst źródłaStreszczenia konferencji na temat "Heuristic"
Hitomi, Nozomi, i Daniel Selva. "The Effect of Credit Definition and Aggregation Strategies on Multi-Objective Hyper-Heuristics". W ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47445.
Pełny tekst źródłaPuentes, Lucas, Jonathan Cagan i Christopher McComb. "Automated Heuristic Induction From Human Design Data". W ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22151.
Pełny tekst źródłaKoriche, Frederic, Christophe Lecoutre, Anastasia Paparrizou i Hugues Wattez. "Best Heuristic Identification for Constraint Satisfaction". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/258.
Pełny tekst źródłaLiang, Jia, Hari Govind, Pascal Poupart, Krzysztof Czarnecki i Vijay Ganesh. "An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/745.
Pełny tekst źródłaBercher, Pascal, Gregor Behnke, Daniel Höller i Susanne Biundo. "An Admissible HTN Planning Heuristic". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/68.
Pełny tekst źródłaYokoyama, Soichiro, Ikuo Suzuki, Masahito Yamamoto i Masashi Furukawa. "A New Heuristic for Traveling Salesman Problem Based on LCO". W ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7227.
Pełny tekst źródłaHu, Shuli, i Nathan R. Sturtevant. "Direction-Optimizing Breadth-First Search with External Memory Storage". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/175.
Pełny tekst źródłaCohen, Liron, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig i T. K. Satish Kumar. "The FastMap Algorithm for Shortest Path Computations". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/198.
Pełny tekst źródłaRenan de Carvalho, Vinicius, i Jaime Simão Sichman. "Multi-Agent Election-Based Hyper-Heuristics". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/833.
Pełny tekst źródłaLi, Ya-zhou, Jin Wang, Li-qin Hu i Yi-can Wu. "A Variable Ordering Heuristic Based on Zero-Suppressed Binary Decision Diagrams". W 18th International Conference on Nuclear Engineering. ASMEDC, 2010. http://dx.doi.org/10.1115/icone18-30070.
Pełny tekst źródłaRaporty organizacyjne na temat "Heuristic"
Feigenbaum, Edward A., i Bruce G. Buchanan. Heuristic Programming Project. Fort Belvoir, VA: Defense Technical Information Center, marzec 1986. http://dx.doi.org/10.21236/ada165995.
Pełny tekst źródłaCarter, Lynn. Probability driven heuristic nets. Portland State University Library, styczeń 2000. http://dx.doi.org/10.15760/etd.1998.
Pełny tekst źródłaEvett, Matthew, James Hendler, Ambuj Mahanti i Dana Nau. PRA: Massively Parallel Heuristic Search. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1991. http://dx.doi.org/10.21236/ada454848.
Pełny tekst źródłaHirshleifer, David, Yaron Levi, Ben Lourie i Siew Hong Teoh. Decision Fatigue and Heuristic Analyst Forecasts. Cambridge, MA: National Bureau of Economic Research, luty 2018. http://dx.doi.org/10.3386/w24293.
Pełny tekst źródłaSkiena, Steven S. Heuristic Approaches to Optimization with Applications. Fort Belvoir, VA: Defense Technical Information Center, sierpień 2001. http://dx.doi.org/10.21236/ada390374.
Pełny tekst źródłaSkiena, Steven S. Heuristic Approaches to Optimization With Applications. Fort Belvoir, VA: Defense Technical Information Center, sierpień 2000. http://dx.doi.org/10.21236/ada382413.
Pełny tekst źródłaNemhauser, George L., i Martin W. Savelsbergh. Combining Exact and Heuristic Approaches for Discrete Optimization. Fort Belvoir, VA: Defense Technical Information Center, luty 2009. http://dx.doi.org/10.21236/ada495432.
Pełny tekst źródłaKaku, Bharat K., Thomas E. Morton i Gerald L. Thompson. A Heuristic Algorithm for the Facilities Layout Problem. Fort Belvoir, VA: Defense Technical Information Center, maj 1988. http://dx.doi.org/10.21236/ada196093.
Pełny tekst źródłaNemhauser, George L. Combining Exact ad Heuristic Approaches for Discrete Optimization. Fort Belvoir, VA: Defense Technical Information Center, grudzień 2011. http://dx.doi.org/10.21236/ada567596.
Pełny tekst źródłaMartínez Martínez, Luis Enrique, i Juan M. Monserrat Gauchi. Heuristic Evaluation of Optical and Optometry Franchise Websites. Revista Latina de Comunicación Social, 2010. http://dx.doi.org/10.4185/rlcs-65-2010-884-071-088-en.
Pełny tekst źródła