Sciweavers

12052 search results - page 2083 / 2411
» computer 2010
Sort
View
MOR
2010
98views more  MOR 2010»
14 years 11 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
MOR
2010
118views more  MOR 2010»
14 years 11 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
MP
2010
145views more  MP 2010»
14 years 11 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
MSOM
2010
77views more  MSOM 2010»
14 years 11 months ago
To Wave or Not to Wave? Order Release Policies for Warehouses with an Automated Sorter
Wave-based release policies are prevalent in warehouses with an automated sorter, and take different forms depending on how much waves overlap and whether the sorter is split for...
Jérémie Gallien, Théophane We...
MST
2010
140views more  MST 2010»
14 years 11 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
« Prev « First page 2083 / 2411 Last » Next »