Optimal strategy of route and look for the path constrained search problem with reward criterion

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.100, Iss.1, 1997-07, pp. : 236-249

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

A penalty function heuristic for the resource constrained shortest path problem

By Avella P. Boccia M. Sforza A.

European Journal of Operational Research, Vol. 142, Iss. 2, 2002-10 ,pp. : 221-230

Elsevier

Access to resources Recommend Favorite

A multiple-tree search procedure for the resource-constrained project scheduling problem

By Simpson W.P. Patterson J.H.

European Journal of Operational Research, Vol. 89, Iss. 3, 1996-03 ,pp. : 525-542

Elsevier

Access to resources Recommend Favorite

An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem

By Hifi Mhand

Engineering Optimization, Vol. 46, Iss. 8, 2014-08 ,pp. : 1109-1122

Taylor & Francis Ltd

Access to resources Recommend Favorite

An optimal tree search method for the manufacturing systems cell formation problem

By Spiliopoulos K. Sofianopoulou S.

European Journal of Operational Research, Vol. 105, Iss. 3, 1998-03 ,pp. : 537-551

Elsevier

Access to resources Recommend Favorite

Dynamic capacitated user-optimal departure time/route choice problem with time-window

By Chen H.K. Chang M.S. Wang C.Y.

European Journal of Operational Research, Vol. 132, Iss. 3, 2001-08 ,pp. : 603-618

Elsevier

Access to resources Recommend Favorite