📝 Some text

I’m an desultory blogger and intermittent academic. Nonetheless, I like the research and writing process. Most of my current and old posts live here. Some of my other writings and collaborations are listed below.

Papers, patents & preprints

March 2024 - USPTO - 📄 patent
Fast computational generation of digital pickup and delivery plans describes algorithms for fast on-demand routing in pickup and delivery problems.

December 2023 - USPTO - 📄 patent
Prediction of travel time and determination of prediction interval describes technology for predicting travel times for on-demand delivery platforms.

June 2023 - USPTO - 📄 patent
Runners for optimization solvers and simulators describes technology for creating and executing Decision Diagram-based optimization solvers and state-based simulators in cloud environments.

September 2020 - Operations Research Forum - 📄 preprint
MIPLIBing: Seamless Benchmarking of Mathematical Optimization Problems and Metadata Extensions presents a Python library that automatically downloads queried subsets from the current versions of MIPLIB, MINLPLib, and QPLIB, provides a centralized local cache across projects, and tracks the best solution values and bounds on record for each problem.

May 2019 - Operations Research Letters - 📄 preprint
Decision diagrams for solving traveling salesman problems with pickup and delivery in real time explores the use of Multivalued Decision Diagrams and Assignment Problem inference duals for real-time optimization of TSPPDs.

October 2018 - Optimization Online - 📄 preprint
Integer Models for the Asymmetric Traveling Salesman Problem with Pickup and Delivery proposes a new ATSPPD model, new valid inequalities for the Sarin-Sherali-Bhootra ATSPPD, and studies the impact of relaxing complicating constraints in these.

September 2018 - Optimization Online - 📄 preprint
Exact Methods for Solving Traveling Salesman Problems with Pickup and Delivery in Real Time examines exact methods for solving TSPPDs with consolidation in real-time applications. It considers enumerative, Mixed Integer Programming, Constraint Programming, and hybrid optimization approaches under various time budgets.

March 2018 - Optimization Online - 📄 preprint
The Meal Delivery Routing Problem introduces the MDRP to formalize and study an important emerging class of dynamic delivery operations. It also develops optimization-based algorithms tailored to solve the courier assignment (dynamic vehicle routing) and capacity management (offline shift scheduling) problems encountered in meal delivery operations.