EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3098. Some results on an extension of the vertex cover problem
Invited abstract in session TD-52: Integer Programming and Combinatorial Optimization: Complexity Questions and Algorithms, stream Combinatorial Optimization.
Tuesday, 14:30-16:00Room: 8003 (building: 202)
Authors (first author is the speaker)
| 1. | Juan F. Correcher
|
| Estadística i Investigació Operativa, Universitat de València | |
| 2. | Mercedes Landete
|
| Departamento de Estadística y Matemática Aplicada, University Miguel Hernández of Elche | |
| 3. | Juanjo Peiró
|
| Estadística i Investigació Operativa, Universitat de València | |
| 4. | Hande Yaman
|
| ORSTAT, KU Leuven |
Abstract
The relationship between locations and their connections can be modeled by using some extensions of the vertex cover problem. In this talk, we revisit some of these extensions and provide new ideas that can be used in solution methods. The applicability of our proposals is tested in a branch-and-cut algorithm on several computational experiments, the results of which will also be discussed.
Keywords
- Combinatorial Optimization
- Branch and Cut
- Location
Status: accepted
Back to the list of papers