A Branch-Cut-and-Price Algorithm for the Traveling Salesperson Problem with Hotel Selection

Título:

A Branch-Cut-and-Price Algorithm for the Traveling Salesperson Problem with Hotel Selection

Autor:

Eduardo Uchoa Barboza

Ano:

2020

DOI:

10.1016/j.cor.2020.104986

Revista:

Computers & Operations Research

ISSN:

03050548

Idioma:

Português

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Selecting Attributes for Clustering the Brazilian Soccer Clubs

A POPMUSIC matheuristic for the capacitated vehicle routing problem

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

THE GUIDE TO NP-COMPLETENESS IS 40 YEARS OLD: AN HOMAGE TO DAVID S. JOHNSON

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation

A GRASP-based approach to the generalized minimum spanning tree problem

Stabilized branch-and-cut-and-price for the generalized assignment problem

A facility location and installation of resources model for level of repair analysis

On the exact solution of vehicle routing problems with backhauls

A distributed dual ascent algorithm for Steiner problems in multicast routing