Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in which pickups and deliveries must be performed in two independent networks. The items are stored in stacks and repacking is not allowed. Given a pickup and a delivery tour, the problem of checking if there exi...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bonomo, Flavia
Publicado: 2011
Materias:
Bounded coloring
Capacitated coloring
Equitable coloring
Permutation graphs
Scheduling problems
Thinness
Coloring
Graphic methods
Pickups
Polynomial approximation
Vehicle routing
Permutation graph
Scheduling problem
Traveling salesman problem
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v412_n45_p6261_Bonomo
http://hdl.handle.net/20.500.12110/paper_03043975_v412_n45_p6261_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares