A computational comparison of some branch and bound methods for indefinite quadratic programs

ISSN： 1435-246X

Source： Central European Journal of Operations Research, Vol.16, Iss.2, 2008-06, pp. : 139-152

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 competitive branch-and-bound algorithm for the simple assembly line balancing problem

By Sprecher A.

International Journal of Production Research, Vol. 37, Iss. 8, 1999-05 ,pp. : 1787-1816

Taylor & Francis Ltd

Access to resources Recommend Favorite

Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

By Ozpeynirci Selin

International Journal of Production Research, Vol. 47, Iss. 21, 2009-01 ,pp. : 5941-5958

Taylor & Francis Ltd

Access to resources Recommend Favorite

An improved branch and bound procedure for scheduling a flow line manufacturing cell

By Schaller J.

International Journal of Production Research, Vol. 43, Iss. 22, 2005-11 ,pp. : 4697-4720

Taylor & Francis Ltd

Access to resources Recommend Favorite

Disassembly sequence plan generation using a branch-and-bound algorithm

By Güngör A. Gupta S. M.

International Journal of Production Research, Vol. 39, Iss. 3, 2001-02 ,pp. : 481-509

Taylor & Francis Ltd

Access to resources Recommend Favorite

A comparison of methods for trend estimation

By Bianchi Marco Boyle Martin Hollingsworth Deirdre

Applied Economics Letters, Vol. 6, Iss. 2, 1999-02 ,pp. : 103-109

Routledge Ltd

Access to resources Recommend Favorite