Foundation-Penalty Cuts for Mixed-Integer Programs (2008)
Fred Glover, Hanif D. Sherali, Director Keith Womer, Fred Glover A
Abstract — We propose a new class of Foundation-Penalty (FP) cuts for GUBconstrained (and ordinary) mixed-integer programs, which are easy to generate by exploiting standard penalty calculations...
Fred Glover A, Manuel Laguna A, Rafael Martí B
Abstract — Scatter search (SS) is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on...
Dynamic and Adaptive Neighborhood Search in Combinatorial Optimization (2006)
Abstract — The design of effective neighborhood structures is fundamental to the performance of local search and metaheuristic algorithms for combinatorial optimization. Significant efforts have...
Fundamentals of scatter search and path relinking (2000)
Fred Glover, Manuel Laguna, Rafael Martí, Director Keith Womer, Fred Glover A, Manuel Laguna B, ...
Abstract __ _ The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems...
Tabu search and finite convergence (2000)
Fred Glover, Saïd Hanafi, Director Keith Womer, Fred Glover A, Saïd Hanafi B
Abstract __ _ We establish finite convergence for some tabu search algorithms based on recency memory or frequency memory, distinguishing between symmetric and asymmetric neighborhood structures....
A Template for Scatter Search and Path Relinking (1998)
Fred Glover, Director Keith Womer, Fred Glover A
Abstract – The evolutionary approach called scatter search, and its generalized form called path relinking, originated from strategies for creating composite decision rules and surrogate...