Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Year of publication: |
2010
|
---|---|
Authors: | Paulavičius, Remigijus ; Žilinskas, Julius ; Grothey, Andreas |
Published in: |
Optimization letters. - Berlin : Springer, ISSN 1862-4472, ZDB-ID 2274663-8. - Vol. 4.2010, 2, p. 173-183
|
Subject: | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory | Begrenzte Rationalität | Bounded rationality |
-
Leitner, Markus, (2018)
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
-
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Drezner, Zvi, (2015)
- More ...
-
Globally-biased <Emphasis Type="SmallCaps">Disimpl algorithm for expensive global optimization
Paulavičius, Remigijus, (2014)
-
Simplicial Lipschitz optimization without the Lipschitz constant
Paulavičius, Remigijus, (2014)
-
Approximate dynamic programming with Bézier Curves/Surfaces for Top-percentile Traffic Routing
Grothey, Andreas, (2012)
- More ...