Evasive flow capture: a multi-period stochastic facility location problem with independent demand
type: Item
instance of: scholarly article
title: Evasive flow capture: a multi-period stochastic facility location problem with independent demand
zbMATH Open document ID: 1394.90392
author: Nikola Marković
author: Ilya O. Ryzhov
author: Paul Schonfeld
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6872958
zbMATH Keywords: location
zbMATH Keywords: flow capture
zbMATH Keywords: multi-period planning
zbMATH Keywords: stochastic flows
zbMATH Keywords: network model
describes a project that uses: Matlog
describes a project that uses: Matlab
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.08.020
OpenAlex ID: W2516846965
cites work: Capacity planning and warehouse location in supply chains with uncertain demands
cites work: Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
cites work: The multi-period incremental service facility location problem
cites work: Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
cites work: Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
cites work: Optimal Location of Discretionary Service Facilities
cites work: Locating mobile servers on a network with markovian properties
cites work: Introduction to Stochastic Programming
cites work: Near-shortest and K-shortest simple paths
cites work: Solving the dynamic facility location problem
cites work: Dynamic facility location: The progressive p-median problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
cites work: Q4488781
cites work: A Lagrangian relaxation approach to large-scale flow interception problems
cites work: A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
cites work: A multiperiod two-echelon multicommodity capacitated plant location problem
cites work: Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
cites work: Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
cites work: Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
cites work: Multistage stochastic programs with block-separable recourse
cites work: Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
cites work: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
cites work: The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
cites work: Strategic facility location: A review
cites work: Multistage stochastic programming model for electric power capacity expansion problem
cites work: An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
cites work: Solving the competitive discretionary service facility location problem
cites work: Finding the K Shortest Loopless Paths in a Network
cites work: A generalized model for locating facilities on a network with flow-based demand
DOI: 10.1016/J.EJOR.2016.08.020
description: scientific article; zbMATH DE number 6872958