Hard Time

Known as: Argrathi, Argrathl, Argratha 
"Hard Time" is the 91st episode of the American syndicated science fiction television series Star Trek: Deep Space Nine, the 18th episode of the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
0377-2217/$ see front matter 2012 Elsevier B.V. A doi:10.1016/j.ejor.2012.01.030 ⇑ Corresponding author. E-mail addresses: nacima… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2011
2011
The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2009
2009
Just-in-time (JIT) trucking service, i.e., arriving at customers within specified time windows, has become the norm for freight… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The Time Dependent Vehicle Routing Problem (TDVRP) consists in optimally routing a fleet of vehicles of fixed capacity when… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Reading a book is also kind of better solution when you have no enough money or time to get your own adventure. This is one of… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This study has extended a vehicle routing problem, with time-windows (VRPTW), by considering the randomness of the perishable… (More)
  • figure 1
  • figure 2
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We model a market populated by two groups of boundedly rational agents: “newswatchers” and “momentum traders.” Each newswatcher… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. This problem allows lateness… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We consider those database environments in which queries have strict timing constraints, and develop a time-constrained query… (More)
  • figure 22
  • figure 3.2
  • figure 3.5
  • figure 4.5
  • figure 5.2
Is this relevant?