Mark W Lewis, Director Keith Womer, Mark Lewis A
Abstract —In this paper we introduce a preprocessing technique using experimental design sampling to generate the estimated effects of binary decision variables on the objective function. The...
Mark W. Lewis, Director Keith Womer, Mark W. Lewis
Abstract ― In a robust telecommunications network, additional capacity must be allocated to account for restoration routing after the loss of a network component. Joint capacity optimization takes...
Guided Design Search in Joint Capacity Allocation Network Problems (2008)
Mark W. Lewis, Director Keith Womer
Abstract — a new approach, Guided Design Search, for preprocessing mixed integer binary programs is applied to two forms of a difficult optimization problem, the joint working/spare capacity...
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...
Modeling and Solving the Task Allocation Problem as an Unconstrained Quadratic Binary (2008)
Mark Lewis, Bahram Alidaee, Gary Kochenberger, Director Keith Womer, Mark Lewis A, Bahram Alidaee B, ...
Abstract — Task allocation problems consist of assigning a set of tasks to one of several processors such that the associated inter-task communication and processing costs are minimized. Modeled as...
The Satellite List and New Data Structures for Symmetric Traveling Salesman Problems (2004)
Colin Osterman, César Rego, Director Keith Womer, Colin Osterman A, César Rego A
Abstract — The problem of data representation is fundamental to the efficiency of search algorithms for the traveling salesman problem (TSP). The computational effort required to perform such tour...
A scatter search algorithm for the maximum clique problem,” Instituto Politecnico de (2001)
Luís Cavique, César Rego, Isabel Themido, Director Keith Womer, Luís Cavique A, César Rego B, ...
Abstract – The objective of the Maximum Clique Problem (MCP) is to find the largest complete subgraph in a given graph. The problem is known as NP-hard and we have developed a heuristic algorithm...
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...
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (2000)
Maria A. Osorio, Fred Glover, Peter Hammer, Director Keith Womer, Fred Glover B, ...
Knapsack Problems to fix some variables to zero and to separate the rest into two groups those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial...
Resolution Search and Dynamic Branch-and-Bound (2000)
Saïd Hanafi, Fred Glover, Director Keith Womer, Saïd Hanafi A, Fred Glover B
Abstract __ _ A novel approach to pure 0-1 integer programming problems called Resolution Search has been proposed by Chvatal (l997) as an alternative to implicit enumeration, with a demonstration...
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...