domingo, 24 de junio de 2018

Ficha del recurso:


Vínculo original en EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 221 (2):306-307; 10.1016/j.ejor.2012.03.048 SEP 1 2012
Muter, I; Birbil, SI; Bulbul, K; Sahin, G

Última actualización:

jueves, 28 de junio de 2012

Entrada en el observatorio:

jueves, 28 de junio de 2012



Archivado en:

A note on "A LP-based heuristic for a time-constrained routing problem"

In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve this linear program optimally, and an optimality condition is presented to terminate the column-and-row generation algorithm. We demonstrate by using Lagrangian duality that this optimality condition is incorrect and may lead to a suboptimal solution at termination. (C) 2012 Elsevier B.V. All rights reserved.