On the public citation graph

A Matheuristic Algorithm for the Inventory Routing Problem

https://doi.org/10.1287/trsc.2019.0930

0 signed · 76 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/nav.3800090303openalex-snapshot

Programming with linear fractional functionals

inferredcites →https://doi.org/10.1007/978-1-4419-9174-4openalex-snapshot

Linear-Fractional Programming Theory, Methods, Applications and Software

inferredcites →https://doi.org/10.1007/978-3-642-29843-1_19openalex-snapshot

A Matheuristic Algorithm for a Large-Scale Energy Management Problem

inferredcites →https://doi.org/10.1007/bf01844416openalex-snapshot

Die Maximierung eines Quotienten zweier linearer Funktionen unter linearen Nebenbedingungen

inferredcites →https://doi.org/10.1007/s11518-010-5150-xopenalex-snapshot

Creating balanced and connected clusters to improve service delivery routes in logistics planning

inferredcites →https://doi.org/10.1007/s13675-014-0030-7openalex-snapshot

A survey on matheuristics for routing problems

inferredcites →https://doi.org/10.1016/j.cie.2008.09.032openalex-snapshot

Heuristic approaches for the inventory-routing problem with backlogging

inferredcites →https://doi.org/10.1016/j.cor.2011.12.020openalex-snapshot

The inventory-routing problem with transshipment

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.cor.2012.09.010openalex-snapshot

A branch-and-price guided search approach to maritime inventory routing

inferredcites →https://doi.org/10.1016/j.cor.2013.06.006openalex-snapshot

A two phase variable neighborhood search for the multi-product inventory routing problem

inferredcites →https://doi.org/10.1016/j.cor.2014.06.007openalex-snapshot

A decomposition-based heuristic for the multiple-product inventory-routing problem

inferredcites →https://doi.org/10.1016/j.cor.2014.07.001openalex-snapshot

Heuristics for dynamic and stochastic inventory-routing

inferredcites →https://doi.org/10.1016/j.cor.2015.10.015openalex-snapshot

Multi-neighborhood local search optimization for machine reassignment problem

inferredcites →https://doi.org/10.1016/j.ejor.2005.11.030openalex-snapshot

A partition approach to the inventory/routing problem

inferredcites →https://doi.org/10.1016/j.ejor.2006.12.056openalex-snapshot

Model and algorithm for inventory/routing decision in a three-echelon logistics system

inferredcites →https://doi.org/10.1016/j.ejor.2008.12.007openalex-snapshot

Adaptive Tabu Search for course timetabling

inferredcites →https://doi.org/10.1016/j.eswa.2011.04.138openalex-snapshot

A heuristic method for the inventory routing problem with time windows

inferredcites →https://doi.org/10.1016/j.eswa.2011.09.120openalex-snapshot

Variable neighborhood search for the inventory routing and scheduling problem in a supply chain

inferredcites →https://doi.org/10.1016/j.eswa.2013.07.100openalex-snapshot

A local search method for periodic inventory routing problem

inferredcites →https://doi.org/10.1016/j.eswa.2016.01.041openalex-snapshot

A genetic algorithm for the vendor-managed inventory routing problem with lost sales

inferredcites →https://doi.org/10.1016/j.ijpe.2010.06.012openalex-snapshot

An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem

inferredcites →https://doi.org/10.1016/j.ijpe.2013.07.025openalex-snapshot

Hybrid heuristic for the inventory location-routing problem with deterministic demand

inferredcites →https://doi.org/10.1016/j.trc.2012.03.007openalex-snapshot

Consistency in multi-vehicle inventory-routing

inferredcites →https://doi.org/10.1080/00207543.2012.757668openalex-snapshot

A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem

inferredcites →https://doi.org/10.1111/itor.12063openalex-snapshot

Heuristics and matheuristics for a real‐life machine reassignment problem

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.32.5.1019openalex-snapshot

A Combined Vehicle Routing and Inventory Allocation Problem

inferredcites →https://doi.org/10.1287/trsc.1030.0041openalex-snapshot

Dynamic Programming Approximations for a Stochastic Inventory Routing Problem

inferredcites →https://doi.org/10.1287/trsc.1030.0054openalex-snapshot

A Decomposition Approach for the Inventory-Routing Problem

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.1090.0278openalex-snapshot

The Trip Scheduling 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.1100.0360openalex-snapshot

Randomized Local Search for Real-Life Inventory Routing

inferredcites →https://doi.org/10.1287/trsc.2013.0472openalex-snapshot

Thirty Years of Inventory Routing

inferredcites →https://doi.org/10.1287/trsc.2015.0635openalex-snapshot

A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem

inferredcites →https://doi.org/10.1287/trsc.2015.0637openalex-snapshot

An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines

inferredcites →https://doi.org/10.1287/trsc.2016.0729openalex-snapshot

Single-Period Cutting Planes for Inventory Routing Problems

inferredcites →https://doi.org/10.1287/trsc.23.2.67openalex-snapshot

An Integrated Inventory Allocation and Vehicle Routing Problem

inferredcites →https://doi.org/10.1287/trsc.32.2.189openalex-snapshot

A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities

inferredcites →https://doi.org/10.1287/trsc.36.1.119.573openalex-snapshot

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem

inferredcites →https://doi.org/10.1504/ejie.2012.051074openalex-snapshot

Disruptions in the airline industry: math-heuristics for re-assigning aircraft and passengers simultaneously

inferredcites →https://doi.org/10.2139/ssrn.563262openalex-snapshot

Inventory-Routing Model, for a Multi-Period Problem with Stochastic and Deterministic Demand

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.4793503openalex-extracted

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

inferred← citeshttps://doi.org/10.1002/net.70027openalex-snapshot

Extending the Inventory Routing Problem to Support Integrated Decision‐Making in an Urban Distribution Network

inferred← citeshttps://doi.org/10.1007/978-981-97-2359-1_3openalex-snapshot

On the Impact of Different Inventory Policies on the Solution of the Inventory-Routing Problem with Strict Driving Hours’ Regulations and Driving Speed Limits

inferred← citeshttps://doi.org/10.1007/s10732-023-09516-9openalex-snapshot

A matheuristic approach for the family traveling salesman problem

inferred← citeshttps://doi.org/10.1016/j.cie.2021.107721openalex-snapshot

Solving a multi-period home health care routing and scheduling problem using an efficient matheuristic

inferred← citeshttps://doi.org/10.1016/j.cor.2021.105686openalex-snapshot

Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes

inferred← citeshttps://doi.org/10.1016/j.cor.2022.106129openalex-snapshot

A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows

inferred← citeshttps://doi.org/10.1016/j.cor.2023.106503openalex-snapshot

Stochastic inventory routing with dynamic demands and intra-day depletion

inferred← citeshttps://doi.org/10.1016/j.cor.2024.106883openalex-snapshot

A novel mixed-integer linear programming formulation for continuous-time inventory routing

inferred← citeshttps://doi.org/10.1016/j.cor.2025.107298openalex-snapshot

The stochastic and dynamic inventory routing problem with fine time granularity: A reinforcement learning approach

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.ejor.2026.04.044openalex-snapshot

Inventory-routing problems: Review, challenges, and innovations

inferred← citeshttps://doi.org/10.1016/j.jclepro.2025.145649openalex-snapshot

Balancing empty containers at ports: A bi-level programming approach for sustainable maritime logistics

inferred← citeshttps://doi.org/10.1016/j.kjs.2026.100665openalex-snapshot

Routing under the energy self-consumption paradigm: Models and algorithms

inferred← citeshttps://doi.org/10.1016/j.rineng.2025.107868openalex-snapshot

Optimizing port containers logistics considering blockchain technology for sustainable maritime shipping: A case study

inferred← citeshttps://doi.org/10.1016/j.susoc.2021.08.002openalex-snapshot

A modified adaptive genetic algorithm for multi-product multi-period inventory routing problem

inferred← citeshttps://doi.org/10.1016/j.team.2025.10.003openalex-snapshot

Maritime service network design with oil-fueled and LNG-fueled mixed vessel fleet under uncertainty: Overview and future research directions

inferred← citeshttps://doi.org/10.1016/j.tre.2021.102319openalex-snapshot

Sustainable supply chain management for perishable products in emerging markets: An integrated location-inventory-routing model

inferred← citeshttps://doi.org/10.1016/j.tre.2025.104143openalex-snapshot

A three-stage matheuristic for the blood stochastic inventory routing problem

inferred← citeshttps://doi.org/10.1016/j.tre.2025.104541openalex-snapshot

Strategic design of parcel locker networks for urban delivery

inferred← citeshttps://doi.org/10.1080/00207543.2025.2513018openalex-snapshot

Logistics cost optimisation and allocation for additive manufacturer make-to-order cooperation

inferred← citeshttps://doi.org/10.1080/23335777.2021.1946719openalex-snapshot

A Improved Subgradient Lagrangian Relaxation Algorithm for Solving the Stochastic Demand Inventory Routing Problem

inferred← citeshttps://doi.org/10.1088/1742-6596/1828/1/012181openalex-snapshot

Energy Efficient Routing Algorithm Based on Harmony Search

inferred← citeshttps://doi.org/10.1109/ccwc57344.2023.10099117openalex-snapshot

The Impact of Dynamic Adjustment of Swarm Behavior on Particle Swarm Optimization Performance using Benchmark Functions

inferred← citeshttps://doi.org/10.1109/tits.2022.3170569openalex-snapshot

A Decomposition-Based Heuristic Method for Inventory Routing Problem

inferred← citeshttps://doi.org/10.1111/itor.70235openalex-snapshot

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

inferred← citeshttps://doi.org/10.1287/trsc.2019.0972openalex-snapshot

Introduction to the Special Section: ROADEF/EURO Challenge 2016—Inventory Routing Problem

inferred← citeshttps://doi.org/10.1287/trsc.2021.1123openalex-snapshot

An Effective Matheuristic for the Multivehicle Inventory Routing Problem

inferred← citeshttps://doi.org/10.1287/trsc.2022.0342openalex-snapshot

Solving a Continent-Scale Inventory Routing Problem at Renault

inferred← citeshttps://doi.org/10.1287/trsc.2022.1186openalex-snapshot

Bilevel Memetic Search Approach to the Soft-Clustered Vehicle Routing Problem

inferred← citeshttps://doi.org/10.32657/10356/172085openalex-snapshot

A bin-packing based heuristic for the integrated inventory and vehicle routing problem

inferred← citeshttps://doi.org/10.3390/math12070991openalex-snapshot

Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem

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.