A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
Year of publication: |
2011
|
---|---|
Authors: | Ninin, Jordan ; Messine, Frédéric |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 50.2011, 4, p. 629-644
|
Publisher: |
Springer |
Subject: | Interval analysis | Branch and bound | Limited memory | Metaheuristic | Algorithmic complexity |
-
Minimizing maximum tardiness on a single machine with family setup times and machine disruption
Molaee, Ehsan, (2021)
-
Traffic Grammar and Algorithmic Complexity in Urban Freeway Flow Patterns
Haynes, Kingsley, (2007)
-
A continuous characterization of the maximum-edge biclique problem
Gillis, Nicolas, (2014)
- More ...
-
Ninin, Jordan, (2011)
-
A reliable affine relaxation method for global optimization
Ninin, Jordan, (2015)
-
Maximal perimeter, diameter and area of equilateral unit-width convex polygons
Audet, Charles, (2013)
- More ...