1723 search results - page 76 / 345 » Cycling in linear programming problems |
118
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
137
click to vote
DISOPT
2010
15 years 3 months ago
2010
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
112
click to vote
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
142
click to vote
COR
2010
15 years 3 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
106
click to vote
NN
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...