On the public citation graph
Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
0 signed · 51 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9781118272039.ch1openalex-snapshot
Handbook of Volatility Models and Their Applications
inferredcites →https://doi.org/10.1007/bf01582225openalex-snapshot
Polyhedra for lot-sizing with Wagner—Whitin costs
inferredcites →https://doi.org/10.1007/s13676-012-0016-7openalex-snapshot
Inventory routing problems: an introduction
inferredcites →https://doi.org/10.1016/j.cor.2012.08.012openalex-snapshot
The exact solution of several classes of inventory-routing problems
inferredcites →https://doi.org/10.1016/j.ijpe.2013.11.019openalex-snapshot
Improved solutions for inventory-routing problems through valid inequalities and input ordering
inferredcites →https://doi.org/10.1016/j.orl.2008.05.005openalex-snapshot
A single supplier–single retailer system with an order-up-to level inventory policy
inferredcites →https://doi.org/10.1016/s0927-0507(05)80108-2openalex-snapshot
Chapter 4 Analysis of vehicle routing and inventory-routing problems
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/ijoc.1100.0439openalex-snapshot
A Hybrid Heuristic for an Inventory Routing Problem
inferredcites →https://doi.org/10.1287/ijoc.2013.0550openalex-snapshot
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
inferredcites →https://doi.org/10.1287/opre.1050.0223openalex-snapshot
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
inferredcites →https://doi.org/10.1287/trsc.1060.0188openalex-snapshot
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.1100.0354openalex-snapshot
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.2013.0472openalex-snapshot
Thirty Years of Inventory Routing
inferredcites →https://doi.org/10.4324/9780203118580openalex-snapshot
Economic Geography and the Unequal Development of Regions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4769464openalex-extracted
The Inventory Routing Problem for the Bin Waste Collection Minimizing Overflows
inferred← citeshttps://doi.org/10.1002/net.21796openalex-snapshot
An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem
inferred← citeshttps://doi.org/10.1002/net.21995openalex-snapshot
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
inferred← citeshttps://doi.org/10.1007/s00291-026-00850-5openalex-snapshot
Branch-price-and-cut for the production routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cie.2019.04.026openalex-snapshot
A review on sustainable inventory routing
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111323openalex-snapshot
Optimizing multi-vehicle inventory routing problem for waste collection with overflow-level-dependent service times in bins
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2017.02.036openalex-snapshot
Solution methods for vehicle-based inventory routing problems
inferred← citeshttps://doi.org/10.1016/j.cor.2014.07.001openalex-snapshot
Heuristics for dynamic and stochastic inventory-routing
inferred← citeshttps://doi.org/10.1016/j.cor.2017.08.013openalex-snapshot
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm
inferred← citeshttps://doi.org/10.1016/j.cor.2018.05.023openalex-snapshot
Analysis of an improved branch-and-cut formulation for the Inventory-Routing Problem with Transshipment
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105371openalex-snapshot
An exact solution approach for the inventory routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106353openalex-snapshot
A branch-and-cut embedded matheuristic for the inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107376openalex-snapshot
A hybrid genetic search for the inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.09.056openalex-snapshot
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.10.007openalex-snapshot
A branch-and-cut algorithm for an assembly routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.11.060openalex-snapshot
An exact approach for cyclic inbound inventory routing in a level production system
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.08.047openalex-snapshot
Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.029openalex-snapshot
Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.12.051openalex-snapshot
Comparison of formulations for the Inventory Routing Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.02.011openalex-snapshot
An improved formulation for the inventory routing problem with time-varying demands
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.07.013openalex-snapshot
On the zero-inventory-ordering policy in the inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.08.010openalex-snapshot
New benchmark instances for the inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.omega.2022.102752openalex-snapshot
A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution
inferred← citeshttps://doi.org/10.1016/j.tre.2019.01.005openalex-snapshot
A matheuristic algorithm for the multi-depot inventory routing problem
inferred← citeshttps://doi.org/10.1080/00207543.2014.986299openalex-snapshot
An optimised target-level inventory replenishment policy for vendor-managed inventory systems
inferred← citeshttps://doi.org/10.1109/access.2019.2950036openalex-snapshot
Integrated Inventory-Transportation Problem in Vendor-Managed Inventory System
inferred← citeshttps://doi.org/10.1111/itor.12076openalex-snapshot
Formulations for an inventory routing problem
inferred← citeshttps://doi.org/10.11606/t.55.2024.tde-23082024-145520openalex-snapshot
Roteamento de Estoque e Transporte de Carga Multimodal: Otimização Bi-objetivo com Considerações Ambientais e Econômicas
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1144openalex-snapshot
Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
inferred← citeshttps://doi.org/10.1287/trsc.2016.0729openalex-snapshot
Single-Period Cutting Planes for Inventory Routing Problems
inferred← citeshttps://doi.org/10.1287/trsc.2019.0964openalex-snapshot
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy
inferred← citeshttps://doi.org/10.1287/trsc.2022.0261openalex-snapshot
A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems
inferred← citeshttps://doi.org/10.2139/ssrn.2537248openalex-snapshot
Dynamic Protection of Innovations Through Patents and Trade Secrets
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96175openalex-snapshot
Scheduling policies for multi-period services
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.