Hub interdiction problem variants: models and metaheuristic solution algorithms
From MaRDI portal
Publication:723928
DOI10.1016/J.EJOR.2017.11.058zbMATH Open1403.90475OpenAlexW2771144315MaRDI QIDQ723928FDOQ723928
Nader Ghaffari-Nasab, Alireza Motallebzadeh
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.11.058
Recommendations
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- On the \(p\)-hub interdiction problem
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Cites Work
- Optimization by Simulated Annealing
- Equation of State Calculations by Fast Computing Machines
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- A bilevel mixed-integer program for critical infrastructure protection planning
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Locating service facilities whose reliability is distance dependent.
- The stochastic interdiction median problem with disruption intensity levels
- Network hub location problems: The state of the art
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Reliable Facility Location Design Under the Risk of Disruptions
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- A facility reliability problem: Formulation, properties, and algorithm
- A hub covering model for cargo delivery systems
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- On solving unreliable planar location problems
- Designing robust coverage networks to hedge against worst-case facility losses
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Model formulations for hub covering problems
- Competitive Location on a Network
- Closest assignment constraints and location models: Properties and structure
- Closest assignment constraints in discrete location problems
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- On the single-assignment \(p\)-hub center problem
- The single-assignment hub covering problem: Models and linearizations
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
Cited In (12)
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- The continuous maximum capacity path interdiction problem
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Competitive multiple allocation hub location problem considering primary and backup routes
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Metaheuristics for bilevel optimization: a comprehensive review
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- An $$\alpha $$-risk appetite cost minimizing model for multi-commodity capacitated p-hub median problem with time windows and uncertain flows
- A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information
- Perspectives on modeling hub location problems
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- On the \(p\)-hub interdiction problem
This page was built for publication: Hub interdiction problem variants: models and metaheuristic solution algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723928)
