A study of lattice reformulations for integer programming

Branch-and-bound for integer optimization typically uses single-variable disjunctions. Enumerative methods for integer optimization with theoretical guarantees use a non-binary search tree with general disjunctions based on lattice structure. These disjunctions are expensive to compute and challenging to implement. Here we compare two lattice...

Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources

The resource constrained project scheduling problem with a flexible project structure and consumption and production of resources, involves making a selection of activities and scheduling these activities in order to minimize the makespan, subject to precedence and resource constraints. Since finding a feasible selection of activities is NP...

Optimizing inventory strategy for modular shipbuilding

The primary drivers for buying a ship from a certain yard are price, delivery time and quality. In order to decrease construction time and costs, shipbuilding companies are exploring the development of product-families to include family wide modularity and cross family standardization. Standardization is the use of identical components across...

Improving ambulance coverage in a mixed urban-rural region in Norway using mathematical modeling

Background Ambulance services play a crucial role in providing pre-hospital emergency care. In order to ensure quick responses, the location of the bases, and the distribution of available ambulances among these bases, should be optimized. In mixed urban-rural areas, this optimization typically involves a trade-off between backup coverage in...

Comparing population and incident data for optimal air ambulance base locations in Norway

Background: Helicopter emergency medical services are important in many health care systems. Norway has a nationwide physician manned air ambulance service servicing a country with large geographical variations in population density and incident frequencies. The aim of the study was to compare optimal air ambulance base locations using both...

Enhancing flexible transport services with demand-anticipatory insertion heuristics

Developments in vehicle automation and the shared economy call for new developments in routing flexible transport services. We propose a new type of insertion algorithm: an online dynamic insertion algorithm with demand forecasts. The performance of this algorithm is tested in a simulation model for a case study network in the Netherlands. When...

Exploring optimal air ambulance base locations in Norway using advanced mathematical modelling

Background Helicopter emergency medical services are an important part of many healthcare systems. Norway has a nationwide physician staffed air ambulance service with 12 bases servicing a country with large geographical variations in population density. The aim of the study was to estimate optimal air ambulance base locations. Methods We used...

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL) problem, which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye, and Zhang. Note that the approximability lower bound by Guha and Khuller is 1.463 . . . . An algorithm is a (?f ,?c)-approximation algorithm if the solution...