The following pages link to (Q5687194):
Displaying 50 items.
- The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
- Continuous and discrete flows over time (Q634790) (← links)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- Minimum flow problem on network flows with time-varying bounds (Q693577) (← links)
- Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints (Q763409) (← links)
- Minimizing fleet operating costs for a container transportation company (Q819069) (← links)
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730) (← links)
- Flows in dynamic networks with aggregate arc capacities (Q845886) (← links)
- The dynamic team forming problem: throughput and delay for unbiased policies (Q847121) (← links)
- The dynamic shortest path problem with anticipation (Q852944) (← links)
- A decision support system for the single-depot vehicle rescheduling problem (Q856678) (← links)
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- Travel time reliability in vehicle routing and scheduling with time windows (Q862488) (← links)
- Heuristic and lower bound for a stochastic location-routing problem (Q864014) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- Real-time vehicle rerouting problems with time windows (Q958553) (← links)
- Maximum flow problem on dynamic generative network flows with time-varying bounds (Q988972) (← links)
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs (Q1273088) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations. (Q1413870) (← links)
- Opportunities for OR in intermodal freight transport research: A review. (Q1417537) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse (Q1807682) (← links)
- Graceful reassignment of excessively long communications paths in networks (Q1887906) (← links)
- Dynamic fleet management as a logistics queueing network (Q1908303) (← links)
- Heterogeneous multi-commodity network flows over time (Q2097229) (← links)
- Robust strategies for natural gas procurement (Q2270304) (← links)
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) (Q2362245) (← links)
- A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
- Multicommodity flows over time: Efficient algorithms and complexity (Q2373727) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- A parallelizable dynamic fleet management model with random travel times (Q2433442) (← links)
- Random equilibrium problems on networks (Q2473155) (← links)
- Dynamic transport scheduling under multiple resource constraints (Q2485330) (← links)
- Vehicle routing and scheduling with dynamic travel times (Q2571199) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- An Introduction to Network Flows over Time (Q2971621) (← links)
- Algorithms for Finding Optimal Flows in Dynamic Networks (Q2974407) (← links)
- The Maximum Energy-Constrained Dynamic Flow Problem (Q3512452) (← links)
- Recent Developments in Dynamic Vehicle Routing Systems (Q3564357) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- (Q5020876) (← links)
