This article considers two versions of the stochastic bin packing problem with chance constraints. In the first version, we formulate the problem as a two-stage stochastic integer program that considers item-tobin allocation decisions in the context of chance constraints on total item size within the bins. Next, we describe a distributionally robust formulation of the problem that assumes the i...

In this article, we consider a network of agents that has to self-assign set tasks while respecting resource constraints. One possible formulation is the generalized assignment problem, where goal find maximum payoff satisfying capability We propose purely distributed branch-and-price algorithm solve problem in cooperative fashion. Inspired by classical (centralized) schemes, proposed algorithm...

One-dimensional bin-packing is a well-known combinatorial optimization problem which strongly NP-hard. It consists of allocating given set items different sizes into bins the same capacity to minimize number used. The each bin cannot be exceeded. This paper deals with some variants this take account cases when there are uncertain sizes. goal obtain robust solutions taking possible variations it...

Marcus Poggi de Aragão Dep.de Informática Pontif́ıcia Universidade Católica do Rio de Janeiro [email protected] Eduardo Uchoa Dep. Eng. de Produção Universidade Federal Fluminense [email protected] January 15th, 2005 The Capacitated Vehicle Routing Problem (CVRP) is the most basic variant of a vehicle routing problem: homogeneous fleet, single depot, only deliveries, no time-windows, and ...

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimiz...

We consider a rather generic class of network design problems in which a set or subset of given terminal nodes must be connected to a dedicated root node by simple paths and a variety of resource and/or quality of service constraints must be respected. These extensions of the classical Steiner tree problem on a graph can be well modeled by a path formulation in which individual variables are us...

Living donor kidney transplantation is the preferred treatment for patients with end stage renal disease. Unfortunately, living donors are often incompatible with their specified recipient due to physiological reasons, such as incompatible blood types. Kidney exchange is an increasing modality that allows the exchange of kidneys between such incompatible donor-patient pairs. Typically, the aim ...