Lower-bounding procedures for the 2-dimensional cell suppression problem

Author： Duarte de Carvalho F. Teresa Almeida M.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.123, Iss.1, 2000-05, pp. : 29-41

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

Lower-bounding and heuristic methods for a refuse collection vehicle routing problem

By Mourao M.C. Almeida M.T.

European Journal of Operational Research, Vol. 121, Iss. 2, 2000-03 ,pp. : 420-434

Elsevier

Access to resources Recommend Favorite

Upper and lower bounding procedures for minimum rooted k-subtree problem

By Kataoka S. Araki N. Yamada T.

European Journal of Operational Research, Vol. 122, Iss. 3, 2000-05 ,pp. : 561-569

Elsevier

Access to resources Recommend Favorite

On a 2-dimensional equipartition problem

By Conti F. Malucelli F. Nicoloso S. Simeone B.

European Journal of Operational Research, Vol. 113, Iss. 1, 1999-02 ,pp. : 215-231

Elsevier

Access to resources Recommend Favorite

Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

By Amiri A. Rolland E. Barkhi R.

European Journal of Operational Research, Vol. 112, Iss. 3, 1999-02 ,pp. : 635-645

Elsevier

Access to resources Recommend Favorite

Lower bounding aggregation and direct computation for an infinite horizon one-reservoir model

By Lamond B.F. Lang P.

European Journal of Operational Research, Vol. 95, Iss. 2, 1996-12 ,pp. : 404-410

Elsevier

Access to resources Recommend Favorite