A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
type: Item
instance of: scholarly article
title: A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
zbMATH Open document ID: 1458.90024
author: Homero Larrain
author: Leandro C. Coelho
author: Alejandro Cataldo
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901446
zbMATH Keywords: automated Teller machines
zbMATH Keywords: optimization
zbMATH Keywords: cash industry
zbMATH Keywords: neighborhood search
describes a project that uses: FEASPUMP
describes a project that uses: VRP
describes a project that uses: CVRPSP
MaRDI profile type: Publication
full work available at URL: j.cor.2017.03.010
OpenAlex ID: W2601921726
cites work: A genetic algorithm approach to the integrated inventory-distribution problem
cites work: Modeling inventory routing problems in supply chains of high consumption products
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: A feasibility pump heuristic for general mixed-integer problems
cites work: Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
cites work: RENS. The optimal rounding
cites work: The inventory-routing problem with transshipment
cites work: Heuristics for dynamic and stochastic inventory-routing
cites work: The exact solution of several classes of inventory-routing problems
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: A new ILP-based refinement heuristic for vehicle routing problems
cites work: On practical resource allocation for production planning and scheduling with period overlapping setups
cites work: The feasibility pump
cites work: Local branching
cites work: Restrict-and-relax search for 0-1 mixed-integer programs
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Variable neighborhood search
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
DOI: 10.1016/J.COR.2017.03.010
description: scientific article; zbMATH DE number 6901446