A branch-and-cut-and-price approach for the capacitated <mml:math altimg="si17.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>m</mml:mi></mml:math>-ring

A branch-and-cut-and-price approach for the capacitated m-ring–star problem

Author:

Hoshino Edna A.,de Souza Cid C.

Funder

Capes (Brazilian Ministry of Education

CNPq–Conselho Nacional de Desenvolvimento Científico e Tecnológico

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. The capacitated m-ring star problem;Baldacci;Operations Research,2007

2. Dash Optimization, xpress -Optimizer Manual, 2007.

5. Column generation algorithms for the capacitated m-ring-star problem;Hoshino,2008

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献