Mostrar el registro sencillo del ítem
Recent harmony search algorithms for 0–1 optimization problems
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Guzmán N. | |
dc.contributor.author | Johnson F. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:15:37Z | |
dc.date.available | 2020-09-02T22:15:37Z | |
dc.date.issued | 2015 | |
dc.identifier | 10.1007/978-3-319-21380-4_96 | |
dc.identifier.citation | 528, , 567-572 | |
dc.identifier.issn | 18650929 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4133 | |
dc.description | The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search. © Springer International Publishing Switzerland 2015. | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Stephanidis C. | |
dc.subject | Harmony search algorithm | |
dc.subject | Metaheuristics | |
dc.subject | Set covering problem | |
dc.subject | Algorithms | |
dc.subject | Combinatorial optimization | |
dc.subject | Factory automation | |
dc.subject | Heuristic algorithms | |
dc.subject | Human computer interaction | |
dc.subject | Integer programming | |
dc.subject | Learning algorithms | |
dc.subject | Optimization | |
dc.subject | Boolean expressions | |
dc.subject | Harmony search | |
dc.subject | Harmony search algorithms | |
dc.subject | Integer programming problems | |
dc.subject | Meta heuristics | |
dc.subject | Optimization problems | |
dc.subject | Production line | |
dc.subject | Set covering problem | |
dc.subject | Problem solving | |
dc.title | Recent harmony search algorithms for 0–1 optimization problems | |
dc.type | Conference Paper |