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...

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...

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...