The following pages link to Transportation Science (Q86630):
Displayed 50 items.
- An Exact Method for the Vehicle Routing Problem with Backhauls (Q2783863) (← links)
- Synchronized Development of Production, Inventory, and Distribution Schedules (Q2783864) (← links)
- Airline Fleet Assignment with Time Windows (Q2783868) (← links)
- Alternative Approaches for Real-Time Estimation and Prediction of Time-Dependent Origin–Destination Flows (Q2783870) (← links)
- A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem (Q2783871) (← links)
- Adaptive Labeling Algorithms for the Dynamic Assignment Problem (Q2783873) (← links)
- On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance (Q2783875) (← links)
- Dynamic Routing for Priority Shipments in LTL Service Networks (Q2783876) (← links)
- Stochastic Vehicle Routing Problem with Restocking (Q2783878) (← links)
- A New Heuristic for the Traveling Salesman Problem with Time Windows (Q2783879) (← links)
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem (Q2783880) (← links)
- A Multiplier Adjustment Method for Dynamic Resource Allocation Problems (Q2783881) (← links)
- Catastrophe Avoidance Models for Hazardous Materials Route Planning (Q2783882) (← links)
- Scheduling Aircraft Landings—The Static Case (Q2783883) (← links)
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (Q2783884) (← links)
- A Continuous Equilibrium Model for Estimating Market Areas of Competitive Facilities with Elastic Demand and Market Externality (Q2783885) (← links)
- Incorporating Observed and Unobserved Heterogeneity in Urban Work Travel Mode Choice Modeling (Q2783886) (← links)
- The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach (Q2783887) (← links)
- Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting (Q2783888) (← links)
- The Rollon–Rolloff Vehicle Routing Problem (Q2783889) (← links)
- A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem (Q2783890) (← links)
- A Pareto Improving Strategy for the Time-Dependent Morning Commute Problem (Q2783891) (← links)
- The Shortest Path Problem with Time Windows and Linear Waiting Costs (Q2783892) (← links)
- National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm (Q2783895) (← links)
- Airline Crew Recovery (Q2783897) (← links)
- An Efficient Airline Re-Fleeting Model for the Incremental Modification of Planned Fleet Assignments (Q2783899) (← links)
- A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem (Q2783901) (← links)
- Exploiting the Opportunities of Collaborative Decision Making: A Model and Efficient Solution Algorithm for Airline Use (Q2783902) (← links)
- From Ground Holding to Free Flight: An Exact Approach (Q2783903) (← links)
- On the Existence of Solutions to the Dynamic User Equilibrium Problem (Q2783904) (← links)
- Random Queues in Signalized Road Networks (Q2783906) (← links)
- Diversion Issues in Real-Time Vehicle Dispatching (Q2783907) (← links)
- The Stochastic Queue <i>p</i>-Median Problem (Q3026699) (← links)
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (Q3026701) (← links)
- Comment on “Network Median Problems with Continuously Distributed Demand” (Q3028684) (← links)
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location (Q3028687) (← links)
- A Dynamic Space-Time Network Flow Model for City Traffic Congestion (Q3028694) (← links)
- Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions (Q3030555) (← links)
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks (Q3030602) (← links)
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks (Q3032042) (← links)
- The Maximal Expected Covering Location Problem: Revisited (Q3035112) (← links)
- Minimal Time Vessel Routing in a Time-Dependent Environment (Q3035129) (← links)
- The Estimation of Multinomial Probit Models: A New Calibration Algorithm (Q3197180) (← links)
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs (Q3202131) (← links)
- Mean-Variance Location Problems (Q3211106) (← links)
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees (Q3211137) (← links)
- The Hierarchical Network Design Problem: A New Formulation and Solution Procedures (Q3356059) (← links)
- Routing Container Ships Using Lagrangean Relaxation and Decomposition (Q3356060) (← links)
- A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach (Q3356061) (← links)
- An Algorithm for Calculating Consistent Itinerary Flows (Q3356064) (← links)