Hub interdiction problem variants: models and metaheuristic solution algorithms
From MaRDI portal
Publication:723928
DOI10.1016/j.ejor.2017.11.058zbMath1403.90475OpenAlexW2771144315MaRDI QIDQ723928
Alireza Motallebzadeh, Nader Ghaffari-Nasab
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
Hierarchical games (including Stackelberg games) (91A65) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (11)
Competitive multiple allocation hub location problem considering primary and backup routes ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ On the \(p\)-hub interdiction problem ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Perspectives on modeling hub location problems ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ The continuous maximum capacity path interdiction problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Optimization by Simulated Annealing
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Closest assignment constraints in discrete location problems
- Designing robust coverage networks to hedge against worst-case facility losses
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- 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
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- 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
- Practical bilevel optimization. Algorithms and applications
- Integer programming formulations of discrete hub location problems
- Locating service facilities whose reliability is distance dependent.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- On the single-assignment \(p\)-hub center problem
- Foundations of bilevel programming
- 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
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- The stochastic interdiction median problem with disruption intensity levels
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A bilevel mixed-integer program for critical infrastructure protection planning
- Network hub location problems: The state of the art
- Reliable Facility Location Design Under the Risk of Disruptions
- 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
- Model formulations for hub covering problems
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Competitive Location on a Network
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Closest assignment constraints and location models: Properties and structure
- Hub Location and the p-Hub Median Problem
- The single-assignment hub covering problem: Models and linearizations
- Equation of State Calculations by Fast Computing Machines
- On solving unreliable planar location problems
This page was built for publication: Hub interdiction problem variants: models and metaheuristic solution algorithms
