Now showing items 31-40 of 231
A branch-and-cut algorithm for quadratic assignment problems based on linearizations
The quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even though ...
A global error bound for quadratic perturbation of linear programs
We prove a global error bound result on the quadratic perturbation of linear programs. The error bound is stated in terms of function values.
Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure
This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller ...
Equational characterization of Boolean function classes
Several noteworthy classes of Boolean functions can be characterized by algebraic identities (e.g. the class of positive functions consists of all functions f satisfying the identity f(x) V f(y) V f(x V y) = f(x V y)). We ...
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
We consider a production planning problem for two items where the high quality item can substitute the demand for the low quality item. Given the number of periods, the demands, the production, inventory holding, setup ...
Simulation modelling and analysis of a border security system
Border control is vital to the security of a nation and its citizens. All countries look at measures to improve the security of their borders. But increasing security can bring a substantial financial burden. In this ...
Scheduling with tool changes to minimize total completion time: basic results and SPT performance
We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. ...
On separating cover inequalities for the multidimensional knapsack problem
We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programming model. Solving ...
Bivariate density estimation with randomly truncated data
In this study bivariate kernel density estimators are considered when a component is subject to random truncation. In bivariate truncation models one observes the i.i.d. samples from the triplets (T, Y, X) only if T less ...
Convergence of switching reward processes
(American Mathematical Society, 2001)
We study the convergence in the Skorokhod J-topology of switching reward processes constructed by sums of conditionally independent random variables or by processes with conditionally independent increments on the trajectories ...