In this work, we solve a real-world facility location problem by means of a mixed integer linear programming model. The problem is faced by an Italian multi-utility company operating in the sector of waste management. The company works in several Italian regions to collect and treat the urban...

This article provides a general meeting scheduling model to schedule en-masse interviews over multi-day events. Creating such meeting schedules is a complicated, time-consuming task that usually requires considerable manual planning when hundreds of meetings are involved and if the quality of...

We propose a new class of knapsack problems by assiuning that the sizes of the items to be put into a knapsack are known to be elements 0f a given subset S of the positive integers Z'^. The set S is treated as a parameter. We show that the family of knapsack problems obtained by varying the...

We study stochastic integer programming models for assigning delays to flights that are destined for an airport whose capacity has been impacted by poor weather or some other exogenous factor. In the existing literature, empirical evidence seemed to suggest that a proposed integer programming...

The knapsack problem (KP) is concerned with the selection of a subset of multiple items with known positive values and weights such that the total value of selected items is maximized and their total weight does not exceed capacity. Item values, item weights, and capacity are known in the...

The combinatorial nature of integer programming is inevitable even after takingspecific model structure into consideration. This is the root problem in implementing large-scale nonlinear integer programming models regardless of which algorithm one chooses to use. Consequently, we suggest that...

We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired...

We show that exact computation of a family of 'max weighted score' estimators, including Manski's max score estimator, can be achieved efficiently by reformulating them as mixed integer programs (MIP) with disjunctive constraints. The advantage of our MIP formulation is that estimates are exact...

The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...