A new formulation for the Traveling Deliveryman Problem

Mostrar todas las versiones(3)

The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamiltonian path equals the sum of the costs for the layers of paths (along the Hamiltonia...

Descripción completa

Detalles Bibliográficos
Autores principales: Méndez-Díaz, I., Zabala, P., Lucena, A.
Formato: JOUR
Materias:
Branch-and-cut algorithms
Integer programming
Traveling deliveryman problem
Dynamic programming
Hamiltonians
Linearization
Meats
Particle size analysis
Branch-and-Bound
Computational results
Convex hulls
Cutting plane algorithms
Enumeration trees
Feasible solutions
Hamiltonian path problems
Hamiltonian paths
Integer programming formulations
Linear programming relaxations
Minimum costs
Valid inequalities
Linear programming
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v156_n17_p3223_MendezDiaz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares