Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Branch‐and‐cut algorithms for the traveling salesman problem with job times
Branch‐and‐cut algorithms for the traveling salesman problem with job times
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Pablo Gutiérrez‐Aguirre
,
Carlos Contreras‐Bolton
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
International Transactions in Operational Research
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Description
DOI:
10.1111/itor.70092
Similar Items
Dynamic open time‐dependent traveling salesman problem with speed optimization
by: Mustafa Çimen, et al.
Published: (2024)
Quantum annealing‐driven branch and bound for the total weighted tardiness traveling salesman problem on the D‐Wave quantum computer
by: Wojciech Bożejko, et al.
Published: (2026)
Traveling salesman problem with drone and bicycle: multimodal last‐mile e‐mobility
by: Erfan Babaee Tirkolaee, et al.
Published: (2024)
Capacity management of forwarder with multiple carriers under uncertain flight travel time and stochastic shipment demand
by: Kannapha Amaruchkul
Published: (2025)
Exact solution algorithms for biobjective mixed integer programming problems
by: Deniz Emre, et al.
Published: (2025)