Stochastic hub location problems with Bernoulli demands
From MaRDI portal
Publication:2147142
DOI10.1016/J.COR.2022.105851OpenAlexW4225369988MaRDI QIDQ2147142FDOQ2147142
Authors: Nader Ghaffari-Nasab 
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105851
Recommendations
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A quadratic integer program for the location of interacting hub facilities
- Integer programming formulations of discrete hub location problems
- Network hub location problems: The state of the art
- Benders decomposition for large-scale uncapacitated hub location
- A hub covering model for cargo delivery systems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Stochastic uncapacitated hub location
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Heuristic and lower bound for a stochastic location-routing problem
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Solution algorithms for the capacitated single allocation hub location problem
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Lagrangean relaxation. (With comments and rejoinder).
- The stochastic \(p\)-hub center problem with service-level constraints
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- Perspectives on modeling hub location problems
- Star \(p\)-hub median problem with modular arc capacities
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A capacitated hub location problem under hose demand uncertainty
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- The A priori traveling repairman problem
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
- An exact algorithm for the modular hub location problem with single assignments
- Heuristics for the capacitated modular hub location problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Approximation algorithms for the a priori traveling repairman
- Planning and design of intermodal hub networks: a literature review
Cited In (8)
- Hub location with congestion and time-sensitive demand
- Stochastic uncapacitated hub location
- Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs
- Optimal Location-Relocation Decisions on Stochastic Networks
- Stochastic air freight hub location and flight routes planning
- The stochastic \(p\)-hub center problem with service-level constraints
- The stochastic generalised assignment problem with Bernoulli demands
- A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
This page was built for publication: Stochastic hub location problems with Bernoulli demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147142)
