On the public citation graph

A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing

https://doi.org/10.2139/ssrn.4793503
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.20178openalex-extracted
Path inequalities for the vehicle routing problem with time windows
inferredcites →https://doi.org/10.1007/3-540-44634-6_29openalex-extracted
Bin Packing with Item Fragmentation
inferredcites →https://doi.org/10.1007/978-1-4419-7997-1_62openalex-extracted
Fractional Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01720015openalex-extracted
A branch and bound algorithm for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s10107-003-0481-8openalex-extracted
A new branch-and-cut algorithm for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s101070100263openalex-extracted
Benchmarking optimization software with performance profiles
inferredcites →https://doi.org/10.1007/s13676-016-0097-9openalex-extracted
Minimizing the logistic ratio in the inventory routing problem
inferredcites →https://doi.org/10.1016/j.compchemeng.2015.05.023openalex-extracted
An incremental approach using local-search heuristic for inventory routing problem in industrial gases
inferredcites →https://doi.org/10.1016/j.compchemeng.2017.02.036openalex-extracted
Solution methods for vehicle-based inventory routing problems
inferredcites →https://doi.org/10.1016/j.cor.2012.08.012openalex-extracted
The exact solution of several classes of inventory-routing problems
inferredcites →https://doi.org/10.1016/j.cor.2021.105686openalex-extracted
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes
inferredcites →https://doi.org/10.1016/j.dss.2005.05.021openalex-extracted
Supply chain integration in vendor-managed inventory
inferredcites →https://doi.org/10.1016/j.ejor.2021.04.027openalex-extracted
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
inferredcites →https://doi.org/10.1016/j.ijpe.2013.11.019openalex-extracted
Improved solutions for inventory-routing problems through valid inequalities and input ordering
inferredcites →https://doi.org/10.1016/j.omega.2019.102151openalex-extracted
A continuous-time supply-driven inventory-constrained routing problem
inferredcites →https://doi.org/10.1016/j.trc.2012.03.007openalex-extracted
Consistency in multi-vehicle inventory-routing
inferredcites →https://doi.org/10.1016/j.tre.2018.11.003openalex-extracted
Duplicating nodes or arcs in green vehicle routing: A computational comparison of two formulations
inferredcites →https://doi.org/10.1016/s0377-2217(97)00290-7openalex-extracted
Separating capacity constraints in the CVRP using tabu search
inferredcites →https://doi.org/10.1137/1.9780898718515openalex-extracted
The Vehicle Routing Problem
inferredcites →https://doi.org/10.1287/opre.48.5.801.12407openalex-extracted
A Lower Bound for the Split Delivery Vehicle Routing Problem
inferredcites →https://doi.org/10.1287/trsc.1060.0188openalex-extracted
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2013.0472openalex-extracted
Thirty Years of Inventory Routing
inferredcites →https://doi.org/10.1287/trsc.2015.0635openalex-extracted
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2016.0729openalex-extracted
Single-Period Cutting Planes for Inventory Routing Problems
inferredcites →https://doi.org/10.1287/trsc.2017.0814openalex-extracted
Robust Optimization for a Maritime Inventory Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2018.0825openalex-extracted
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.2018.0855openalex-extracted
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
inferredcites →https://doi.org/10.1287/trsc.2019.0902openalex-extracted
The Continuous-Time Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2019.0929openalex-extracted
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function
inferredcites →https://doi.org/10.1287/trsc.2019.0930openalex-extracted
A Matheuristic Algorithm for the Inventory Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2019.0934openalex-extracted
Heuristic Sequence Selection for Inventory Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2019.0954openalex-extracted
A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2019.0961openalex-extracted
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.