A multi-period discrete facility location problem is introduced for a risk neutral strategy with uncertainty in the costs and some of the requirements along the planning horizon. A compact 0–1 formulation for the Deterministic ...

This paper presents a unified framework for the general network design problem which encompasses several classical problems involving combined location and network design decisions. In some of these problems the service ...

In this paper, a heuristic procedure is proposed for the facility location problem with general Bernoulli demands. This is a discrete facility location problem with stochastic demands that can be formulated as a two-stage ...

El presente trabajo se centra en la aplicación de un procedimiento basado en Scatter Search (SS) para resolver un problema de equilibrado de líneas de montaje. Tras una intr oducción a los denominados Assembly Line ...

This paper considers the Optimum Communication Spanning Tree Problem. An integer programming formulation that yields tight LP bounds is proposed. Given that the computational effort required to obtain the LP bounds ...

This paper addresses combined location/routing problems defined on trees, where not all vertices have to be necessarily visited. A mathematical programming formulation is presented, which has the integrality property. The ...

This paper studies Minimum Spanning Trees under incomplete information assuming that it is only known that vertices belong to some neighborhoods that are second order cone representable and distances are measured with a ...

This paper focuses on a multiperiod discrete facility location problem where transportation costs are considered together with location costs to design the operating facility pattern along a time horizon. The problem ...