Undercover: a primal MINLP heuristic exploring a largest sub-MIP

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.144, Iss.1-2, 2014-04, pp. : 315-346

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

Related content

The travelling salesman problem with neighbourhoods: MINLP solution

By Gentilini Iacopo Margot François Shimada Kenji

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 364-378

Taylor & Francis Ltd

Access to resources Recommend Favorite

Branching and bounds tighteningtechniques for non-convex MINLP

By Belotti Pietro Lee Jon Liberti Leo Margot Francois Wachter Andreas

Optimization Methods and Software, Vol. 24, Iss. 4-5, 2009-08 ,pp. : 597-634

Taylor & Francis Ltd

Access to resources Recommend Favorite

New MINLP formulation for the multiperiod pooling problem

AICHE JOURNAL, Vol. 61, Iss. 11, 2015-11 ,pp. : 3728-3738

John Wiley & Sons Inc

Access to resources Recommend Favorite

Exploring microstencils for sub-micron patterning using pulsed laser deposition

By Vroegindeweij F. Speets E.A. Steen J.A.J. Brugger J. Blank D.H.A.

Applied Physics A, Vol. 79, Iss. 4-6, 2004-09 ,pp. : 743-745

Springer Publishing Company

Access to resources Recommend Favorite

A primal-dual augmented Lagrangian

By Gill Philip Robinson Daniel

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 1-25

Springer Publishing Company

Access to resources Recommend Favorite