Unsplittable non-additive capacitated network design using set functions polyhedra

Título:

Unsplittable non-additive capacitated network design using set functions polyhedra

Autor:

Eduardo Uchoa Barboza

Ano:

2015

DOI:

10.1016/j.cor.2015.08.009

Revista:

Computers & Operations Research

ISSN:

03050548

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Solving Replica Placement and Request Distribution in Content Distribution Networks

Improved branch-cut-and-price for capacitated vehicle routing

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

A grid-enabled distributed branch-and-bound algorithm with application on the Steiner problem in graphs

Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm

Fast local search for the steiner problem in graphs

On the exact solution of a large class of parallel machine scheduling problems

Exact algorithms for the Traveling Salesman Problem with Draft Limits

Preface

COLUMN GENERATION BASED ALGORITHMS FOR THE CAPACITATED MULTI-LAYER NETWORK DESIGN WITH UNSPLITTABLE DEMANDS