A branch and cut approach to the orienteering problem with mandatory visits and conflicts
This work proposed a Branch and Cut (B&C) method to solve the Orienteering Problem with Mandatory Visits and Conflicts (OPMVC), which is a combinatorial optimization problem that has extensive applicability in logistics, transportation, and network design, to mention a few. The goal is to fin...
| Autor principal: | |
|---|---|
| Formato: | Tesis |
| Lenguaje: | Spanish / Castilian |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | http://eprints.uanl.mx/30650/1/1080287350.pdf |
Search Result 1
