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...

Full description

Bibliographic Details
Main Author: Pérez Franco, Marlene
Format: Tesis
Language:Spanish / Castilian
Published: 2025
Subjects:
Online Access:http://eprints.uanl.mx/30650/1/1080287350.pdf

Similar Items