Exact and Heuristic Approaches for Directional Sensor Control

Directional sensors are gaining importance due to applications, in- cluding surveillance, detection, and tracking. Such sensors have a limited fi eld-of-view and a discrete set of directions they can be pointed to. The Directional Sensor Control problem (DSCP) consists in assigning a direction of view to each sensor. The location of the targets is known with … Read more

A new formulation of protein evolutionary models that account for structural constraints

Despite the importance of a thermodynamically stable structure with a conserved fold for protein function, almost all evolutionary models neglect site-site correlations that arise from physical interactions between neighboring amino acid sites. This is mainly due to the difficulty in formulating a computationally tractable model since rate matrices can no longer be used. Here we … Read more

A novel passenger recovery approach for the integrated airline recovery problem

Schedule disruptions require airlines to intervene through the process of recovery; this involves modifications to the planned schedule, aircraft routings, crew pairings and passenger itineraries. Passenger recovery is generally considered as the final stage in this process, and hence passengers experience unnecessarily large impacts resulting from flight delays and cancellations. Most recovery approaches considering passengers … Read more

String-Averaging Projected Subgradient Methods for Constrained Minimization

We consider constrained minimization problems and propose to replace the projection onto the entire feasible region, required in the Projected Subgradient Method (PSM), by projections onto the individual sets whose intersection forms the entire feasible region. Specifically, we propose to perform such projections onto the individual sets in an algorithmic regime of a feasibility-seeking iterative … Read more

Steepest Edge as Applied to the Standard Simplex Method

In this paper we discuss results and advantages of using steepest edge column choice rules and their derivatives. We show empirically, when we utilize the steepest edge column choice rule for the tableau method, that the density crossover point at which the tableau method is more efficient than the revised method drops to 5%. This … Read more

Robust Critical Node Selection by Benders Decomposition

The critical node selection problem (CNP) has important applications in telecommunication, supply chain design, and disease propagation prevention. In practice, the weights on the connections are either uncertain or hard to estimate so recently robust optimization approaches have been considered for CNP. In this article, we address very general uncertainty sets, only requiring a linear … Read more

MIRPLib – A library of maritime inventory routing problem instances: Survey, core model, and benchmark results

This paper presents a detailed description of a particular class of deterministic single product maritime inventory routing problems (MIRPs), which we call deep-sea MIRPs with inventory tracking at every port. This class involves vessel travel times between ports that are significantly longer than the time spent in port and require inventory levels at all ports … Read more

Improved Bounds for the Traveling Umpire Problem: A Stronger Formulation and a Relax-and-Fix Heuristic

Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that include visiting every team at home, and not seeing a team … Read more

The viewshed problem: a theoretical analysis and a new algorithm for finding the viewshed of a given point on a triangulated terrain

We give a comprehensive theoretical treatment for calculating the viewshed of a given point, present an analytical solution to the viewshed problem and a new algorithm for finding the viewshed on a triangulated terrain. We implement our algorithm on a real terrain. Some algorithms make use of the horizon information of the terrain to calculate … Read more

Inventory control for a perishable product with non-stationary demand and service level constraints

We study the practical production planning problem of a food producer facing a non-stationary erratic demand for a perishable product with a fixed life time. In meeting the uncertain demand, the food producer uses a FIFO issuing policy. The food producer aims at meeting a certain service level at lowest cost. Every production run a … Read more