Results 1  10
of
20
On the TwoLevel Uncapacitated Facility Location Problem
 INFORMS J. COMPUT
, 1996
"... We study the twolevel uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call yfacilities and zfacilities, the problem is to decide which facilities of both types to open, and to which pair of y and zfacilities each client should be assigned, in order to sat ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We study the twolevel uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call yfacilities and zfacilities, the problem is to decide which facilities of both types to open, and to which pair of y and zfacilities each client should be assigned, in order to satisfy the demand at maximum profit. We first present two multicommodity flow formulations of TUFL and investigate the relationship between these formulations and similar formulations of the onelevel uncapacitated facility location (UFL) problem. In particular, we show that all nontrivial facets for UFL define facets for the twolevel problem, and derive conditions when facets of TUFL are also facets for UFL. For both formulations of TUFL, we introduce new families of facets and valid inequalities and discuss the associated separation problems. We also characterize the extreme points of the LPrelaxation of the first formulation. While the LPrelaxation of a multicommodity formulation provi...
Valid inequalities and facets of the capacitated plant location problem
 Mathematical Programming
, 1989
"... Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitate ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure. The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with constant capacity K for all plants. These facet inequalities depend on K and thus differ fundamentally from the valid inequalities for the uncapacitated version of the problem. We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.
Ikarus: LargeScale Participatory Sensing at High Altitudes
"... Sensor networks proved to be a useful research tool in the field of environmental monitoring. While first sensor deployments consisted of a relatively small number of static nodes, mobile sensor devices have attracted growing interest for largescale sensing applications in recent years. In this pap ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Sensor networks proved to be a useful research tool in the field of environmental monitoring. While first sensor deployments consisted of a relatively small number of static nodes, mobile sensor devices have attracted growing interest for largescale sensing applications in recent years. In this paper, we present Ikarus, a novel participatory sensing application having orders of magnitude more users than existing approaches. The Ikarus system exploits sensor data collected during crosscountry flights by paraglider pilots to study thermal effects in the atmosphere. Based on first experiences gained from this approach, we identify three key aspects that are crucial for the success of participatory sensing applications: incentives for participation, the ability to deal with faulty data, and concise data representation. 1.
Supply chain (re)design: Support for managerial and policy decisions
 European Journal of Transport and Infrastructure Research
, 2007
"... Supply chain (re)design: Support for managerial and policy decisions 74 A wellstructured supply chain is of key importance in achieving efficient operations amongst the suppliers, manufacturers, distribution facilities and distribution channels that constitute the supply chain. The changing economi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Supply chain (re)design: Support for managerial and policy decisions 74 A wellstructured supply chain is of key importance in achieving efficient operations amongst the suppliers, manufacturers, distribution facilities and distribution channels that constitute the supply chain. The changing economic and political environment challenges multinational corporations to redesign their existing production and distribution network and to develop new strategies to meet customer service levels at lowest cost. This paper reviews the literature on supply chain design since 1999 with the objective of supporting the development of richer supply chain models capable of taking all logistics costs into account thereby optimizing the full cost of ownership for multinational corporations and allowing for a consolidation of value adding activities in highwage regions.
Facility Location: Discrete Models and Local Search Methods
"... Abstract.Discrete location theory is one of the most dynamic areas of operations research. We present the basic mathematical models used in this field, as well as their properties and relationship with pseudoBoolean functions. We also investigate the theory of PLScomplete problems, average and wo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract.Discrete location theory is one of the most dynamic areas of operations research. We present the basic mathematical models used in this field, as well as their properties and relationship with pseudoBoolean functions. We also investigate the theory of PLScomplete problems, average and worst case computational complexity of the local search algorithms, and approximate local search. Finally, we discuss computationally difficult test instances and promising directions for further research.
Design Optimization of a New Network Structure for the Next Generation Internet
, 2004
"... Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies.
The Economic Addition of Functionality to a Network
 In Proc. of High Performance Computing and Networking
, 1997
"... . In the operation of communication and computer networks, it may become desirable or necessary to add a new function to the network through the placement of the corresponding electronic device within certain existing user locations. This will involve deciding which user locations will have devices ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
. In the operation of communication and computer networks, it may become desirable or necessary to add a new function to the network through the placement of the corresponding electronic device within certain existing user locations. This will involve deciding which user locations will have devices placed at them as well as deciding an assignment of users to device locations. The objective when adding the new function is to choose these locations and assignments such that the combined cost of placing the devices and routing users to their assigned device locations is minimized. This problem, which we call the device placement problem, is closely related to the simple plant location problem and the pmedian problem. Like these problems, the device placement problem is NPhard, and thus it is highly unlikely that efficient methods for solving this problem to optimality exist. We discuss and test several heuristic methods for the device placement problem, as well as a very efficient meth...
A BranchandBound Algorithm for a Family of PseudoBoolean Optimization Problems
, 2007
"... R u t c o r ..."
(Show Context)
IN INDUSTRIAL ENGINEERING
, 2012
"... Approval of the thesis: LOCATIONS ON A LINE AND GENERALIZATION TO THE DYNAMIC PMEDIANS ..."
Abstract
 Add to MetaCart
Approval of the thesis: LOCATIONS ON A LINE AND GENERALIZATION TO THE DYNAMIC PMEDIANS