Results 1  10
of
25
Facility location models for distribution system design
, 2004
"... The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamenta ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamental assumptions, mathematical complexity and computational performance. This paper reviews some of the contributions to the current stateoftheart. In particular, continuous location models, network location models, mixedinteger programming models, and applications are summarized.
The OneRound Voronoi Game
, 2002
"... In the oneround Voronoi game, the FRST player places n sites inside a unitsquare Q. Next, the ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
In the oneround Voronoi game, the FRST player places n sites inside a unitsquare Q. Next, the
Reverse facility location problems
 IN PROC. 17TH CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY (CCCG’05
, 2005
"... ..."
Noncooperative facility location and covering games
 In Proc. 17th Intl. Symp. Algorithms and Computation (ISAAC
, 2006
"... Abstract. We study a general class of noncooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are avail ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Abstract. We study a general class of noncooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are available in costly integer units and must be bought. The cost can be shared arbitrarily between players. Once a unit is bought, it can be used by all players to satisfy their constraints. In general the cost of purestrategy Nash equilibria in this game can be prohibitively high, as both prices of anarchy and stability are in Θ(k). In addition, deciding the existence of pure Nash equilibria is NPhard. These results extend to recently studied singlesource connection games. Under certain conditions, however, cheap Nash equilibria exist: if the integrality gap of the underlying integer program is 1 and in the case of single constraint players. In addition, we present algorithms that compute cheap approximate Nash equilibria in polynomial time. 1
Competitive Facility Location: The Voronoi Game
, 2003
"... We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearestneighbor rule, and the player whose points control the larger a ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearestneighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a line segment. We also consider a variation where players can play more than one point at a time for the circle arena.
A Representational Paradigm for Dynamic Resource Transformation Problems
, 2003
"... This paper has grown out of the challenges we faced modeling complex operational problems arising in freight transportation and logistics, which are characterized by highly dynamic information processes, complex operational characteristics and decentralized control structures. Whereas people solve m ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
This paper has grown out of the challenges we faced modeling complex operational problems arising in freight transportation and logistics, which are characterized by highly dynamic information processes, complex operational characteristics and decentralized control structures. Whereas people solve more traditional problems have struggled with the development of e#ective algorithms, we have struggled with the more basic challenge of simply modeling the problem
Competitive Facility Location along a Highway
 In 7th Annual International Computing and Combinatorics Conference, volume 2108 of LNCS
, 2001
"... We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearestneighbor rule, and the player whose points control the larger a ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearestneighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a line segment. We also consider a variation where players can play more than one point at a time for the circle arena.
The OneRound Voronoi Game Replayed
 Computational Geometry Theory and Applications
, 2002
"... We consider the oneround Voronoi game, where the first player ("White", called "Wilma") places a set of n points in a rectangular area Q of aspect ratio r 1, followed by the second player ("Black", called "Barney"), who places the same number of points. Each player wins the fraction of Q closest t ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We consider the oneround Voronoi game, where the first player ("White", called "Wilma") places a set of n points in a rectangular area Q of aspect ratio r 1, followed by the second player ("Black", called "Barney"), who places the same number of points. Each player wins the fraction of Q closest to one of his points, and the goal is to win more than half of the total area. This problem has been studied by Cheong et al. who showed that for large enough n and r = 1, Barney has a strategy that guarantees a fraction of 1=2+a, for some small fixed a.
On Languages For Dynamic Resource Scheduling Problems
 Management and Logistics
, 1998
"... : The modeling of very complex problems requires the participation of people with diverse backgrounds. The combined e#orts of these people, properly coordinated, can contribute to the solution of complex problems, but only if we facilitate the process of communicating. In this paper, we highlight ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
: The modeling of very complex problems requires the participation of people with diverse backgrounds. The combined e#orts of these people, properly coordinated, can contribute to the solution of complex problems, but only if we facilitate the process of communicating. In this paper, we highlight the importance of languages, illustrated by a discussion of the #languages" used by four core groups of people. We showhow the choice of language can either disguise similarities or hide important di#erences. Most signi#cantly,we illustrate how the language we speak can color our view of the problem, leading, in some cases, to poor representations of a problem. #The elevator lift is being #xed for the next day. During that time we regret that you will be unbearable."  Sign in a Bucharest business. 1.1
A Representational Paradigm for Stochastic, Dynamic Resource Transformation Problems
, 1998
"... This paper offers a new vocabulary for representing complex problems in a stochastic, dynamic setting. Our focus is on operational problems that need to be solved under uncertainty, and complex problems which are difficult to formulate mathematically in a clear and elegant way. We believe that simil ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper offers a new vocabulary for representing complex problems in a stochastic, dynamic setting. Our focus is on operational problems that need to be solved under uncertainty, and complex problems which are difficult to formulate mathematically in a clear and elegant way. We believe that similarities between problems are often disguised by semantic differences that reflect the contextual domain of an application. It is not readily apparent, for example, that the blocking problem of railroads and the load planning problem of lessthantruckload trucking are both instances of a dynamic service network design problem. The question that tends to arise is: When are apparently different problems similar, and when are seemingly similar problems different? Consider, for example: