8647 search results - page 1259 / 1730 » The Container Selection Problem |
161
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
162
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
178
Voted
IANDC
2008
15 years 6 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
154
click to vote
IOR
2006
15 years 6 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
191
click to vote
EC
1998
15 years 5 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...