Wei Liu A, Dawn Wilkins A, Bahram Alidaee, Wei Liu A, Dawn Wilkins A, Bahram Alidaee B
Quadratic Program This paper proposes a generic hybrid r-opt/1-opt local search algorithm for the unconstrained binary quadratic programming problem. A new algorithm which combines a simple tabu...
Unconstrained Quadratic Programming (2008)
Gary Kochenberger, Fred Glover, Bahram Alidaee, Haibo Wang, Gary Kochenberger, Fred Glover, ...
via
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...
Using the Unconstrained Quadratic Program to Model and (2008)
Fred Glover, Bahram Alidaee, Karen Lewis
Abstract: Satisfiability (SAT) and Max-SAT problems have been the object of considerable research effort over the past few decades. They remain a very important research area today due to their...
A new modeling and solution approach for the number partitioning problem (2005)
Bahram Alidaee, Fred Glover, Gary A. Kochenberger, Cesar Rego
The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the...
A new modeling and solution approach for the number partitioning problem (2005)
Bahram Alidaee, Fred Glover, Gary A. Kochenberger, Cesar Rego
The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee, Cesar Rego
The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods have been proposed for...
Computing the principal eigenpairs using the Davidson's method /--by Bahram Alidaee. (1999)
Thesis (M.S.)--California State University, San Marcos, 1999.
Modeling and Solution Procedures for Diversity Maximization (1998)
Kochenberger, Gary, Glover, Fred, Alidaee, Bahram, Womer, Keith
Many important problems involve selecting a subset from a larger population such that the aggregate diversity of the subset selected is a large as possible. This problem, known as the diversity...
A new approach for modeling and solving set packing problems
Alidaee, Bahram, Kochenberger, Gary, Lewis, Karen, Lewis, Mark, Wang, Haibo
Inventory control, by Axsater, S. Boston: Kluwer Academic Publishers, 2000, 202 pp., $95.00 (cloth).
No Abstract
Solving the maximum edge weight clique problem via unconstrained quadratic programming
Alidaee, Bahram, Glover, Fred, Kochenberger, Gary, Wang, Haibo
One-pass heuristics for large-scale unconstrained binary quadratic problems
Glover, Fred, Alidaee, Bahram, Rego, Cesar, Kochenberger, Gary
Global optimization for artificial neural networks: A tabu search application
Sexton, Randall S., Alidaee, Bahram, Dorsey, Robert E., Johnson, John D.
Global Optimization for Artificial Neural Networks: A Tabu Search Application
Randall S. Sexton, All S. Sexton, Bahram Alidaee, Robert E. Dorsey, John D. Johnson
The ability of neural networks to closely approximate unknown functions to any degree of desired accuracy has generated considerable demand for Neural Network research in Business. The attractiveness...