Lagrangian relaxations and cutting planes in solving set partitioning problems
Lagrangian relaxations and cutting planes in solving set partitioning problems
Exact and heuristic algorithms for solving difficult problems related to computati...
Dual bounds and exact algorithms for minimum dilation problems in geometric graphs
Heuristics for entire programming with feasible and infeasible search paths
The study of theoretical and practical combinatorial optimization problems applied...
| Grant number: | 07/50336-4 |
| Support type: | Research Grants - Meeting - Abroad |
| Duration: | April 07, 2007 - April 09, 2007 |
| Field of knowledge: | Physical Sciences and Mathematics - Computer Science |
| Principal Investigator: | Cid Carvalho de Souza |
| Grantee: | Cid Carvalho de Souza |
| Home Institution: | Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |