A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
type: Item
instance of: scholarly article
title: A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
zbMATH Open document ID: 1403.90490
author: Francisco J. Tapia-Ubeda
author: Pablo A. Miranda
author: Marco Macchi
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
full work available at URL: http://hdl.handle.net/11311/1045065
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6876655
zbMATH Keywords: location
zbMATH Keywords: generalized Benders decomposition
zbMATH Keywords: mixed integer nonconvex-nonlinear programming
zbMATH Keywords: capacitated inventory location problems
zbMATH Keywords: strategic supply chain network design
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
OpenAlex ID: W2778044374
cites work: A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
cites work: The multi-sourcing location inventory problem with stochastic demand
cites work: Q3134873
cites work: The Simultaneous Planning of Production, Capacity, and Inventory in Seasonal Demand Environments
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q4209222
cites work: Hierarchical Production Planning: A Single Stage System
cites work: Hierarchical Production Planning: A Two-Stage System
cites work: Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Q4857376
cites work: An inventory-location model: Formulation, solution algorithm and computational results
cites work: An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
cites work: Q4532026
cites work: Pioneering Developments in Location Analysis
cites work: Location modeling for municipal solid waste facilities
cites work: Demand point aggregation for planar covering location models
cites work: A framework for demand point and solution space aggregation analysis for location models
cites work: Generalized Benders decomposition
cites work: Q5538306
cites work: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
cites work: Nonconvex Generalized Benders Decomposition
cites work: Facility location and supply chain management. A review
cites work: A simultaneous inventory control and facility location model with stochastic capacity constraints
cites work: Strategic facility location: A review
cites work: Capacitated warehouse location model with risk pooling
cites work: Supply chain network design with efficiency, location, and inventory policy using a multiobjective evolutionary algorithm
cites work: The Benders decomposition algorithm: a literature review
cites work: Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation
cites work: A heuristic algorithm for solving large location-inventory problems with demand uncertainty
cites work: Integrated supply chain design models: a survey and future research directions
cites work: The stochastic location model with risk pooling
cites work: Quadratic programming as an extension of classical quadratic maximization
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
DOI: 10.1016/J.EJOR.2017.12.017
description: scientific article; zbMATH DE number 6876655