The following pages link to (Q3523238):
Displaying 50 items.
- Sensitivity analysis of user equilibrium flows revisited (Q264294) (← links)
- POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
- Hybrid large neighborhood search for the bus rapid transit route design problem (Q296775) (← links)
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem (Q297221) (← links)
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium (Q298924) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Bunkering decisions for a shipping liner in an uncertain environment with service contract (Q319459) (← links)
- Efficiency and effectiveness in the urban public transport sector: a critical review with directions for future research (Q320614) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- A comprehensive annual delivery program for upstream liquefied natural gas supply chain (Q322415) (← links)
- Cyclic inventory routing in a line-shaped network (Q322426) (← links)
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← links)
- An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems (Q322829) (← links)
- Effective truckload dispatch decision methods with incomplete advance load information (Q322842) (← links)
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- A demand based route generation algorithm for public transit network design (Q337104) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- A bi-objective model for the used oil location-routing problem (Q337643) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping (Q342095) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines (Q439371) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- On air traffic flow management with rerouting. I: Deterministic case (Q439636) (← links)
- On air traffic flow management with rerouting. II: Stochastic case (Q439637) (← links)
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
- The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- Simultaneous recovery model for aircraft and passengers (Q647996) (← links)
- A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters (Q657257) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
- Part logistics in the automotive industry: decision problems, literature review and research agenda (Q726233) (← links)
- Integrated timetabling and vehicle scheduling with balanced departure times (Q747749) (← links)
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns (Q829166) (← links)
- Existence and computation of optimal tolls in multiclass network equilibrium problems (Q833582) (← links)
- A heuristic for the multi-period petrol station replenishment problem (Q933502) (← links)
- Service network design with management and coordination of multiple fleets (Q958079) (← links)
- Intra market optimization for express package carriers with station to station travel and proportional sorting (Q976039) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- A route set construction algorithm for the transit network design problem (Q1010301) (← links)
- A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
