We consider a generic online allocation problem that generalizes the classical online set cover framework by considering requests comprising a set of elements rather than a single element. This problem has multiple applications in cloud computing, crowd sourcing, facility planning, etc. Formally, it is an online covering problem where each online step comprises an offline covering problem. In a...

This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to another. On each concentrator site, several capacitated concentrators can be installed at each period. Similarly, several capacitated modules can be installed at each period between each terminal and concentrator sites. ...

In this paper, we propose a capacity scaling heuristic using a column generation and row generation technique to address the multicommodity capacitated network design problem. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs. By combining a column and row generat...

We consider the single item capacitated lot sizing problem a well known produc tion planning model that often arises in practical applications and derive new classes of valid inequalities for it We also derive new easily computable valid inequalities for the continuous knapsack problem The continuous knapsack problem has been introduced recently and has been shown to provide a useful relaxation...

A new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customers' locations and demands is developed in this paper. The model is formulated into the frameworks of the expected value model (EVM) and the chance-constrained programming (CCP) based on two different distance measures. In order to solve the model, two hybrid intelligent algorithms a...

In this paper we propose a nonlinear Generalized Disjunctive Programming (GDP) model to optimize the 2-dimensional continuous location and allocation of the potential facilities based on their maximum capacity and the given coordinates of the suppliers and customer points. The model belongs to the class of Capacitated Multi-facility Weber Problem. We propose a bilevel decomposition algorithm th...

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using th...

At the strategic level, closed-loop supply chain (CLSC) management involves long-term decisions regarding the location and capacity allocation of forward/reverse logistics facilities, the assignment of products to facilities, and the distribution of products between facilities and their end users or suppliers. Both demand and return handling must be taken into account, and the overall problem b...

We address the Capacitated m-Ring-Star Problem (CmRSP) in which the goal is to find m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be “allocated” to a visited (customer or Steiner) node. Moreover, the rings must be node-disjoint and the number of customers allocated or visited in a...