In recent years modern methods of optimization have contributed greatly to the advances in data mining and related areas. These contributions continue today and promise to further advance the state of the art both in terms of modeling innovations and new solution methodologies. In this paper, we...

Simulation optimization is providing solutions to important practical problems previously beyond reach. This paper explores how new approaches are significantly expanding the power of simulation optimization for managing risk. Recent advances in simulation optimization technology are leading to...

The bipartite boolean quadratic programming problem (BBQP) is a generalization of the well studied boolean quadratic programming problem. The model has a variety of real life applications; however, empirical studies of the model are not available in the literature, except in a few isolated...

In this paper, the cardinality constrained quadratic model for binary quadratic programming is used to model and solve the graph bisection problem as well as its generalization in the form of the task allocation problem with two processors (2-TAP). Balanced graph bisection is an NP-complete...

We consider a penalty function approach for the solving of the Max 3-SAT problem. The algorithm introduced is a multi-start approach that makes use of elite-solution techniques derived from scatter search. More precisely, it is based on the so-called adaptive memory projection metaphor. The main...

This paper documents the recent emergence of generalized networks as a fundamental computer-based planning tool and demonstrates the power of the associated modeling and solution techniques when used together to solve real-world problems. The first sections of the paper give a non-technical...