Loading...
Projects / Programmes
Heuristics - theory and applications 3
Research activity
| Code | Science | Field | Subfield |
|---|---|---|---|
| 2.07.00 | Engineering sciences and technologies | Computer science and informatics |
| Code | Science | Field |
|---|---|---|
| P170 | Natural sciences and mathematics | Computer science, numerical analysis, systems, control |
Keywords
algorithm, heuristics, optimization, network design, resource allocation,
Evaluation
(metodology)
Citations
Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
Organisations (1) , Researchers (8)
0101 Institute of Mathematics, Physics and Mechanics
| no. | Code | Name and surname | Research area | Role | Period | No. of publicationsNo. of publications |
|---|---|---|---|---|---|---|
| 1. | 23201 | Mathematics | Researcher | 2005 - 2008 | 199 | |
| 2. | 21754 | Mathematics | Researcher | 2005 - 2007 | 30 | |
| 3. | 26533 | Educational studies | Young researcher | 2006 - 2008 | 217 | |
| 4. | 20495 | Mathematics | Researcher | 2005 - 2008 | 97 | |
| 5. | 23341 | Mathematics | Researcher | 2006 - 2008 | 201 | |
| 6. | 11666 | Computer intensive methods and applications | Researcher | 2005 - 2008 | 351 | |
| 7. | 03430 | Mathematics | Head | 2005 - 2008 | 820 | |
| 8. | 15571 | Mathematics | Researcher | 2005 - 2008 | 254 |
Abstract
Heuristic algorithms for optimization problems in general and on examples such as the graph coloring problem(s), the traveling salesman problem, the frequency assignment problem(s), etc., will be studied. The main working hypothesis is: repeated fast construction (or generation) and fast (local) optimization of feasible solutions is a promising general randomized heuristics for NP-hard problems. We are also interested in the existence of efficient algorithms on restricted domains.