Now showing items 11-20 of 36
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 ...
A simulation model for military deployment
The Deployment Planning Problem (DPP) for military units may in general be defined as the problem of planning the movement of geographically dispersed military units from their home bases to their final destinations using ...
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(Institute of Industrial Engineers, 2007)
The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ...
Energy minimizing vehicle routing problem
This paper proposes a new cost function based on distance and load of the vehicle for the Capacitated Vehicle Routing Problem. The vehicle-routing problem with this new load-based cost objective is called the Energy ...
Provisioning virtual private networks under traffic uncertainty
We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic ...
A hub covering model for cargo delivery systems
The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze the application areas separately, we observe that each ...
An improved probability bound for the Approximate S-Lemma
The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism results for approximate robust counterparts.
The latest arrival hub location problem for cargo delivery systems with stopovers
In this paper, we concentrate on the service structure of ground-transportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, ...
Machining conditions-based preventive maintenance
(Taylor & Francis, 2007)
In this study we propose an operating conditions-based preventive maintenance (PM) approach for computer numerical control (CNC) turning machines. A CNC machine wears according to how much it is used and the conditions ...
The integer knapsack cover polyhedron
(Society for Industrial and Applied Mathematics, 2007)
We study the integer knapsack cover polyhedron which is the convex hull of the set of vectors x ∈ ℤ+ n that satisfy C T x ≥ b, with C ∈ ℤ++ n and 6 ∈ ℤ++. We present some general results about the nontrivial facet-defining ...