An efficient algorithm for a generalized joint replenishment problem

Author： Frenk J.B.G. Kleijn M.J. Dekker R.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.118, Iss.2, 1999-10, pp. : 413-428

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

An efficient optimal solution method for the joint replenishment problem

By Wildeman R.E. Frenk J.B.G. Dekker R.

European Journal of Operational Research, Vol. 99, Iss. 2, 1997-06 ,pp. : 433-444

Elsevier

Access to resources Recommend Favorite

Calculating can-order policies for the joint replenishment problem by the compensation approach

By Melchiors P.

European Journal of Operational Research, Vol. 141, Iss. 3, 2002-09 ,pp. : 587-595

Elsevier

Access to resources Recommend Favorite

An efficient transformation of the generalized vehicle routing problem

By Ghiani G. Improta G.

European Journal of Operational Research, Vol. 122, Iss. 1, 2000-04 ,pp. : 11-17

Elsevier

Access to resources Recommend Favorite

An efficient composite heuristic for the symmetric generalized traveling salesman problem

By Renaud J. Boctor F.F.

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 571-584

Elsevier

Access to resources Recommend Favorite

An efficient genetic algorithm for the traveling salesman problem with precedence constraints

By Moon C. Kim J. Choi G. Seo Y.

European Journal of Operational Research, Vol. 140, Iss. 3, 2002-08 ,pp. : 606-617

Elsevier

Access to resources Recommend Favorite