A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables

Geometric branch-and-bound techniques are well-known solution algorithms for non-convex continuous global optimization problems with box constraints. Several approaches can be found in the literature differing mainly in the bounds used.

MoreLess

Year of publication:	2014
Authors:	Schöbel, Anita ; Scholz, Daniel
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 232.2014, 2, p. 266-275
Publisher:	Elsevier
Subject:	Global optimization \| Combinatorial optimization \| Non-convex optimization \| Mixed-integer optimization \| Branch-and-bound methods \| Facility location problems

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011052715