An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
type: Item
instance of: scholarly article
title: An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
zbMATH Open document ID: 1391.90376
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901635
zbMATH Keywords: hub location
zbMATH Keywords: polyhedral uncertainty
zbMATH Keywords: mathematical formulation
zbMATH Keywords: matheuristics
zbMATH Keywords: tabu search
author: Nader Ghaffari-Nasab
describes a project that uses: R
MaRDI profile type: Publication
full work available at URL: j.cor.2018.04.021
OpenAlex ID: W2802557590
cites work: Network hub location problems: The state of the art
cites work: Preprocessing and cutting for multiple allocation hub location problems.
cites work: Robust optimization approach to capacitated single and multiple allocation hub location problems
cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks
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: Hub Location and the p-Hub Median Problem
cites work: Stochastic uncapacitated hub location
cites work: A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
cites work: Benders decomposition applied to a robust multiple allocation incomplete hub location problem
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
cites work: Integrating matheuristics and metaheuristics for timetabling
cites work: Hub interdiction problem variants: models and metaheuristic solution algorithms
cites work: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
cites work: Future paths for integer programming and links to artificial intelligence
cites work: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
cites work: Matheuristics for the single-path design-balanced service network design problem
cites work: A competitive hub location and pricing problem
cites work: Matheuristics
cites work: Location models for airline hubs behaving as \(M/D/c\) queues.
cites work: Location of hubs in a competitive environment
cites work: A capacitated hub location problem under hose demand uncertainty
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem
cites work: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
cites work: The stochastic \(p\)-hub center problem with service-level constraints
cites work: On tabu search for the location of interacting hub facilities
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: Matheuristics for the capacitated p‐median problem
cites work: A hub covering model for cargo delivery systems
cites work: Solving the uncapacitated hub location problem using genetic algorithms
cites work: Stochastic air freight hub location and flight routes planning
Wikidata QID: Q129884562
DOI: 10.1016/J.COR.2018.04.021
description: scientific article; zbMATH DE number 6901635