121 search results - page 3 / 25 » Random Assignment with Integer Costs |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
EOR
2007
13 years 5 months ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
COR
2010
13 years 5 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
ATMOS
2008
13 years 6 months ago
2008
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
DAC
2009
ACM
13 years 9 months ago
2009
ACM
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...