1 resultado para Mixed-integer nonlinear programming
em Instituto Politécnico de Bragança
Filtro por publicador
- Aberdeen University (1)
- Academic Archive On-line (Mid Sweden University; Sweden) (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (9)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (21)
- Biblioteca de Teses e Dissertações da USP (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (19)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (13)
- Boston University Digital Common (1)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (5)
- Cambridge University Engineering Department Publications Database (16)
- CentAUR: Central Archive University of Reading - UK (9)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (10)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons at Florida International University (9)
- Digital Peer Publishing (2)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (9)
- DRUM (Digital Repository at the University of Maryland) (4)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (1)
- Indian Institute of Science - Bangalore - Índia (78)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (41)
- Memorial University Research Repository (1)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (15)
- Queensland University of Technology - ePrints Archive (293)
- Repositorio Academico Digital UANL (2)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (4)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Institucional da Universidade de Aveiro - Portugal (10)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (188)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Universidad de Alicante (15)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (13)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Montréal (2)
- Université de Montréal, Canada (13)
- University of Michigan (14)
- University of Queensland eSpace - Australia (8)
- University of Washington (2)
Relevância:
Resumo:
The BBMCSFilter method was developed to solve mixed integer nonlinear programming problems. This kind of problems have integer and continuous variables and they appear very frequently in process engineering problems. The objective of this work is to analyze the performance of the method when the coordinate searches are interrupted in the context of the multistart strategy. From the numerical experiments, we observed a reduction on the number of function evaluations and on the CPU time.