The Comparison of Branch and Leaf Joining Force for Two Plants

E-ISSN： 1662-8985|2014|1073|1086-1089

ISSN： 1022-6680

Source： Advanced Materials Research, Vol.2014, Iss.1073, 2015-01, pp. : 1086-1089

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

The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

By Sun M.

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

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for the two-stage assembly scheduling problem

By Hariri A.M.A. Potts C.N.

European Journal of Operational Research, Vol. 103, Iss. 3, 1997-12 ,pp. : 547-556

Elsevier

Access to resources Recommend Favorite

The measurement of English and Welsh police force efficiency: A comparison of distance function models

By Drake L. Simper R.

European Journal of Operational Research, Vol. 147, Iss. 1, 2003-05 ,pp. : 165-186

Elsevier

Access to resources Recommend Favorite

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

By Della Croce F. Ghirardi M. Tadei R.

European Journal of Operational Research, Vol. 139, Iss. 2, 2002-06 ,pp. : 293-301

Elsevier

Access to resources Recommend Favorite

A comparison of two algorithms for solving closed crack problems

By DeBremaecker

Engineering Fracture Mechanics, Vol. 66, Iss. 6, 2000-08 ,pp. : 601-605

Elsevier

Access to resources Recommend Favorite