Results 111 to 120 of about 534 (157)

COVID-19 vaccine hesitancy among Marshallese in Northwest Arkansas (USA).

J Public Health Res
Purvis RS, Moore R, Rojo MO, Riklon S, Alik E, Alik D, Maddison BK, McElfish PA.   +7 more
europepmc   +1 more source

Organising outpatient dialysis services during the COVID-19 pandemic. A simulation and mathematical modelling study

, 2020
Allen M, Bhanji A, Willemsen J, Dudfield S, Logan S, Monks T.   +5 more
europepmc   +1 more source

A Parent Project Muscular Dystrophy-sponsored International Workshop Report on Endocrine and Bone Issues in Patients with Duchenne Muscular Dystrophy: An Ever-changing Landscape. [PDF]

J Neuromuscul Dis
Ward LM, Weber DR, Wong SC, Apkon S, Clemens PR, Cripe LH, McMillan HJ, Mercuri E, Nasomyont N, Phung K, Renthal NE, Rutter MM, Tian C, Wood CL, Zeitler PS, Buccella F, Kinnett K, Furlong P, on behalf the International OPTIMIZE DMD Consortium.   +18 more
europepmc   +1 more source

On the online dial a ride problem

, 2010
openaire   +1 more source

Online multi-server dial-a-ride problems

, 2006
Bonifaci, V., Lipmann, M., Stougie, L.
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A New Formulation for the Dial-a-Ride Problem

Transportation Science, 2021
This paper proposes a new mixed integer programming formulation and branch and cut (BC) algorithm to solve the dial-a-ride problem (DARP). The DARP is a route-planning problem where several vehicles must serve a set of customers, each of which has a pickup and delivery location, and includes time window and ride time constraints.
Yannik Rist, Michael Forbes
exaly   +4 more sources

The dial-a-ride problem: models and algorithms

Annals of Operations Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-François Cordeau, Gilbert Laporte, Cordeau Jean-François   +2 more
exaly   +3 more sources

Variable neighborhood search for the dial-a-ride problem

Computers and Operations Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karl Doerner, Richard F Hartl, Sophie Parragh   +2 more
exaly   +4 more sources

A Matheuristic for the Dial-a-Ride Problem

2011
The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an N P-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this
Roberto Wolfler Calvo, Nora Touati Moungla   +1 more
openaire   +1 more source

The finite capacity dial-a-ride problem

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 2002
We give the first non-trivial approximation algorithm for the Capacitated Dial-a-Ride problem: given a collection of objects located at points in a metric space, a specified destination point for each object, and a vehicle with a capacity of at most k objects, the goal is to compute a shortest tour for the vehicle in which all objects can be delivered ...
Moses Charikar, Balaji Raghavachari
openaire   +1 more source