Stochastic hub location problems with Bernoulli demands
type: Item
instance of: scholarly article
title: Stochastic hub location problems with Bernoulli demands
published in: Computers \& Operations Research
publication date: 2022-06-22T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7546574
zbMATH Keywords: hub location
zbMATH Keywords: Bernoulli demand
zbMATH Keywords: stochastic programming
zbMATH Keywords: Benders decomposition
zbMATH Keywords: Lagrangian relaxation
author: Nader Ghaffari-Nasab
MaRDI profile type: MaRDI publication profile
full work available at URL: j.cor.2022.105851
OpenAlex ID: W4225369988
cites work: Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
cites work: Heuristic and lower bound for a stochastic location-routing problem
cites work: Perspectives on modeling hub location problems
cites work: Network hub location problems: The state of the art
cites work: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
cites work: Planning and design of intermodal hub networks: a literature review
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
cites work: Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem
cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale
cites work: Integer programming formulations of discrete hub location problems
cites work: Stochastic uncapacitated hub location
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: Alternate second order conic program reformulations for hub location under stochastic demand and congestion
cites work: The A priori traveling repairman problem
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
cites work: Benders decomposition algorithms for two variants of the single allocation hub location problem
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Heuristics for the capacitated modular hub location problem
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: A Priori Optimization of the Probabilistic Traveling Salesman Problem
cites work: Location models for airline hubs behaving as \(M/D/c\) queues.
cites work: Benders decomposition applied to a robust multiple allocation incomplete hub location problem
cites work: A capacitated hub location problem under hose demand uncertainty
cites work: Approximation algorithms for the a priori traveling repairman
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: The stochastic \(p\)-hub center problem with service-level constraints
cites work: A hub covering model for cargo delivery systems
cites work: An exact algorithm for the modular hub location problem with single assignments
cites work: Star \(p\)-hub median problem with modular arc capacities
DOI: 10.1016/J.COR.2022.105851
description: scientific article; zbMATH DE number 7546574