LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs

ISSN： 1435-246X

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

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

New formulation and branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 24, Iss. 1-2, 2017-01 ,pp. : 77-98

John Wiley & Sons Inc

Access to resources Recommend Favorite

A computerized algorithm for milling non-convex pockets with numerically controlled machines

By Jamil A. T. M.

International Journal of Production Research, Vol. 35, Iss. 7, 1997-07 ,pp. : 1843-1856

Taylor & Francis Ltd

Access to resources Recommend Favorite

A multi-level heuristic search algorithm for production scheduling

By Yadav S. Xue D.

International Journal of Production Research, Vol. 38, Iss. 12, 2000-08 ,pp. : 2761-2785

Taylor & Francis Ltd

Access to resources Recommend Favorite

A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems

By Liu X.

International Journal of Production Research, Vol. 46, Iss. 18, 2008-09 ,pp. : 5059-5074

Taylor & Francis Ltd

Access to resources Recommend Favorite

A heuristic algorithm to minimise the control places of a Petri net for the control of shared machines

By Lee Jeehyoung Jeong In-Jae

International Journal of Production Research, Vol. 49, Iss. 6, 2011-03 ,pp. : 1713-1730

Taylor & Francis Ltd

Access to resources Recommend Favorite