Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Gerardo Berbeglia
Information about the author Gerardo Berbeglia will soon be added to the site.
Found
3 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis
2012
In the pickup and delivery problem (PDP) a fleet of vehicles must serve customers'...
Checking the Feasibility of Dial‐a‐Ride Instances Using Constraint Programming
2011
In the dial‐a‐ride problem (DARP), a fleet of vehicles must serve...
The counting complexity of a simple scheduling problem
2009
Let T be a set of tasks. Each task has a non-negative processing time and a deadline....
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
