Código QR (código de barras bidimensional)

Solving the Traveling Salesman Problem with release dates via branch and cut

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time at wh...

ver descrição completa

Na minha lista:
Principais autores: Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda-Bront
Formato: Artigo
Idioma:Inglês
Publicado em: Elsevier 2023-01-01
coleção:EURO Journal on Transportation and Logistics
Assuntos:
Traveling Salesman Problem
Release dates
Integer Linear Programming
Branch and cut
Acesso em linha:http://www.sciencedirect.com/science/article/pii/S2192437623000183
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registros relacionados