A branch-and-price algorithm for the Minimum Latency Problem

Título:

A branch-and-price algorithm for the Minimum Latency Problem

Autor:

Eduardo Uchoa Barboza

Ano:

2018

DOI:

10.1016/j.cor.2018.01.016

Revista:

Computers & Operations Research

ISSN:

03050548

Idioma:

Português

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Column generation approaches for the software clustering problem

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms

A robust and scalable algorithm for the Steiner problem in graphs

Vertex-disjoint packing of two Steiner trees

Capacitated Network Design using Bin-Packing

A POPMUSIC matheuristic for the capacitated vehicle routing problem

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

Primal Heuristics for Branch and Price: The Assets of Diving Methods

Dual Heuristics on the Exact Solution of Large Steiner Problems