Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows

Author： Guerriero F.   Di Puglia Pugliese L.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.26, Iss.2, 2011-04, pp. : 295-340

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Dynamic programming approaches to solve the shortest path problem with forbidden paths

By Di Puglia Pugliese Luigi   Guerriero Francesca  

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 221-255

Taylor & Francis Ltd

Access to resources Recommend Favorite

A note on different modelling approaches for the robust shortest path problem

By Nikulin Yury  

International Journal of Mathematical Modelling and Numerical Optimisation, Vol. 3, Iss. 3, 2012-07 ,pp. : 141-157

Inderscience Publishers

Access to resources Recommend Favorite

A simplex-based labelling algorithm for the linear fractional assignment problem

By  

Optimization, Vol. 64, Iss. 4, 2015-04 ,pp. : 929-939

Taylor & Francis Ltd

Access to resources Recommend Favorite

Asymptotically Normal Estimation of a Multidimensional Parameter in the Linear-Fractional Regression Problem

By Linke Y.Y.   Sakhanenko A.I.  

Siberian Mathematical Journal, Vol. 42, Iss. 2, 2001-03 ,pp. : 317-331

Springer Publishing Company

Access to resources Recommend Favorite

Reaching the elementary lower bound in the vehicle routing problem with time windows

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 88-99

John Wiley & Sons Inc

Access to resources Recommend Favorite