Algorithms to solve security games have seen successful real-world deployment by LAX police and the Federal Air Marshal Service. These algorithms provide randomized schedules to optimally allocate limited security resources for infrastructure protection. Unfortunately, these algorithms fail to scale-up or to provide a correct solution for massive security games with arbitrary scheduling constra...

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

This paper presents some strong valid inequalities for the Maximum Common Induced Subgraph Problem (MCIS) and the proofs that the inequalities are facet-defining under certain conditions. TheMCIS is an NP-hard problem and, therefore, no polynomial time algorithm is known to solve it. In this context, the study of its polytope can help in the development of more efficient branch-and-bound and br...

In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery.  jobs have to be scheduled on a single machine and delivered to  customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...

During the loading phase of a vessel, only the containers that are on top of their stack are directly accessible. If the container that needs to be loaded next is not the top container, extra moves have to be performed, resulting in an increased loading time. One way to resolve this issue is via a procedure called premarshalling. The goal of premarshalling is to reshuffle the containers into a ...

This paper analyzes the computational performance of the deterministic optimization approach for the Security Constrained Unit Commitment problem (SCUC) addressing thermal generating units, that was developed in its companion paper. The technique proposed in the first part is based on suitable integer cutting planes, specific for the SCUC problem, and a Branch and Bound search which incorporate...

We introduce a novel algorithm for optimal subset selection. Due to its simple mechanism for predicting criterion values the algorithm finds optimum usually several times faster than any other known Branch & Bound [5], [7] algorithm. This behavior is expected when the algorithm is used in conjunction with non-recursive and/or computationally expensive criterion functions.

one of the most important measures needed to be done in times of crisis is to optimize the allocation and distribution of resources among individuals. time is a critical factor effective to increase the number of people rescued by the relief activities.in this paper, we present a relief vehicle routing model in the affected area which uses covering tour approach to reduce total response time. a...