Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
type: Item
instance of: scholarly article
title: Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
zbMATH Open document ID: 1487.90036
author: Eleftherios Manousakis
author: Panagiotis P. Repoussis
author: Emmanouil E. Zachariadis
author: Christos D. Tarantilis
published in: European Journal of Operational Research
publication date: 2021-06-04T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7355302
zbMATH Keywords: transportation
zbMATH Keywords: inventory routing
zbMATH Keywords: two-commodity flow
zbMATH Keywords: branch-and-cut
zbMATH Keywords: cut separation
describes a project that uses: Julia
describes a project that uses: VRP
describes a project that uses: MAXFLOW
describes a project that uses: CVRPSP
describes a project that uses: JuMP
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.08.047
OpenAlex ID: W3082043861
cites work: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
cites work: A maritime inventory routing problem: discrete time formulations and valid inequalities
cites work: Industrial aspects and literature survey: Combined inventory management and routing
cites work: A hybrid heuristic for an inventory routing problem
cites work: Analysis of the maximum level policy in a production-distribution system
cites work: Formulations for an inventory routing problem
cites work: A Matheuristic for the Multivehicle Inventory Routing Problem
cites work: The inventory routing problem: the value of integration
cites work: A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
cites work: Separating capacity constraints in the CVRP using tabu search
cites work: Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
cites work: Julia: A Fresh Approach to Numerical Computing
cites work: A memetic algorithm with dynamic population management for an integrated production-distribution problem
cites work: Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
cites work: A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
cites work: The inventory-routing problem with transshipment
cites work: The exact solution of several classes of inventory-routing problems
cites work: A computational comparison of flow formulations for the capacitated location-routing problem
cites work: JuMP: A Modeling Language for Mathematical Optimization
cites work: A Periodic Inventory Routing Problem at a Supermarket Chain
cites work: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
cites work: Vendor managed inventory for environments with stochastic product usage
cites work: Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
cites work: Projection results for vehicle routing
cites work: Performance evaluation of distribution strategies for the inventory routing problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: A column-generation based tactical planning method for inventory routing
cites work: Facet identification for the symmetric traveling salesman polytope
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
cites work: The vehicle routing problem
DOI: 10.1016/J.EJOR.2020.08.047
description: scientific article; zbMATH DE number 7355302