| Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems | 0 | 0.34 | 2022 |
| Near real-time loadplan adjustments for less-than-truckload carriers | 0 | 0.34 | 2022 |
| Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems | 0 | 0.34 | 2022 |
| Substitution-based equipment balancing in service networks with multiple equipment types | 0 | 0.34 | 2022 |
| The Value Of Limited Flexibility In Service Network Designs | 0 | 0.34 | 2021 |
| Time-Dependent Shortest Path Problems With Penalties And Limits On Waiting | 1 | 0.37 | 2021 |
| A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows. | 0 | 0.34 | 2020 |
| The Continuous-Time Inventory-Routing Problem | 0 | 0.34 | 2020 |
| Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows | 1 | 0.35 | 2020 |
| A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method | 0 | 0.34 | 2020 |
| Logistics optimization for a coal supply chain | 0 | 0.34 | 2020 |
| The price of discretizing time: a study in service network design | 0 | 0.34 | 2019 |
| Provably High-Quality Solutions for the Meal Delivery Routing Problem | 2 | 0.38 | 2019 |
| A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. | 1 | 0.35 | 2018 |
| Enhancing urban mobility: Integrating ride-sharing and public transit. | 6 | 0.56 | 2018 |
| Stochastic Inventory Routing for Perishable Products | 1 | 0.34 | 2018 |
| The generalized independent set problem: Polyhedral analysis and solution approaches. | 3 | 0.44 | 2017 |
| The Continuous-Time Service Network Design Problem | 6 | 0.42 | 2017 |
| The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. | 5 | 0.43 | 2017 |
| A new method for optimizing a linear function over the efficient set of a multiobjective integer program. | 7 | 0.46 | 2017 |
| A reclaimer scheduling problem arising in coal stockyard management | 1 | 0.39 | 2016 |
| Proximity Benders: a decomposition heuristic for stochastic programs | 2 | 0.36 | 2016 |
| Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design. | 0 | 0.34 | 2016 |
| Editorial - A Major Milestone: Transportation Science Turns Fifty. | 1 | 0.37 | 2016 |
| 50th Anniversary Invited Article - City Logistics: Challenges and Opportunities. | 23 | 1.21 | 2016 |
| A Criterion Space Search Algorithm For Biobjective Integer Programming: The Balanced Box Method | 12 | 0.65 | 2015 |
| Possession assessment and capacity evaluation of the Central Queensland Coal Network | 1 | 0.39 | 2015 |
| A Criterion Space Search Algorithm For Biobjective Mixed Integer Programming: The Triangle Splitting Method | 7 | 0.49 | 2015 |
| Cargo Assembly Planning | 1 | 0.36 | 2015 |
| Incremental network design with shortest paths. | 14 | 0.80 | 2014 |
| Reclaimer Scheduling: Complexity and Algorithms. | 0 | 0.34 | 2014 |
| Carbon-aware transport and logistics | 2 | 0.38 | 2014 |
| Pricing to accelerate demand learning in dynamic assortment planning for perishable products. | 4 | 0.38 | 2014 |
| Local Search for a Cargo Assembly Planning Problem. | 0 | 0.34 | 2014 |
| The Triangle Splitting Method for Biobjective Mixed Integer Programming. | 2 | 0.39 | 2014 |
| Boosting the feasibility pump. | 2 | 0.39 | 2014 |
| Creating schedules and computing operating costs for LTL load plans | 5 | 0.41 | 2013 |
| Improved Load Plan Design Through Integer Programming Based Local Search | 14 | 0.64 | 2013 |
| A branch-and-price guided search approach to maritime inventory routing. | 13 | 0.58 | 2013 |
| Incremental network design with maximum flows. | 11 | 0.65 | 2013 |
| Balancing fleet size and repositioning costs in LTL trucking. | 0 | 0.34 | 2013 |
| Restrict-and-relax search for 0-1 mixed-integer programs | 5 | 0.41 | 2013 |
| Pricing for production and delivery flexibility in single-item lot-sizing | 1 | 0.34 | 2012 |
| Branch-and-Price Guided Search - (Extended Abstract). | 0 | 0.34 | 2012 |
| Fixed-Charge Transportation with Product Blending | 9 | 0.53 | 2012 |
| The Fixed-Charge Shortest-Path Problem | 1 | 0.38 | 2012 |
| Truck driver scheduling in Australia | 7 | 0.52 | 2012 |
| Optimization for dynamic ride-sharing: A review. | 126 | 6.00 | 2012 |
| Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem | 7 | 0.52 | 2011 |
| Lane-Exchange Mechanisms for Truckload Carrier Collaboration | 32 | 1.17 | 2011 |
