A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
Year of publication: |
2014
|
---|---|
Authors: | Schöbel, Anita ; Scholz, Daniel |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 232.2014, 2 (16.1.), p. 266-275
|
Subject: | Global optimization | Combinatorial optimization | Non-convex optimization | Mixed-integer optimization | Branch-and-bound methods | Facility location problems | Mathematische Optimierung | Mathematical programming | Beziehungsmarketing | Relationship marketing | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm |
-
Weighted superposition attraction algorithm for binary optimization problems
Baykasoğlu, Adil, (2020)
-
An aggressive reduction scheme for the simple plant location problem
Letchford, Adam N., (2014)
-
Bagherinejad, Jafar, (2018)
- More ...
-
The big cube small cube solution method for multidimensional facility location problems
Schöbel, Anita, (2010)
-
A global optimization procedure for the location of a median line in the three-dimensional space
Blanquero, Rafael, (2011)
-
Körner, Mark-Christoph, (2014)
- More ...