Pages that link to "Item:Q3202131"
From MaRDI portal
The following pages link to Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs (Q3202131):
Displaying 15 items.
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- Multi-depot vehicle scheduling problems with time windows and waiting costs (Q1806860) (← links)
- A meta-heuristic to solve the just-in-time job-shop scheduling problem (Q2028835) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
- A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
- The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
- Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
- Ship scheduling with soft time windows: An optimisation based approach (Q5935388) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)
- Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
