Hub interdiction problem variants: models and metaheuristic solution algorithms
From MaRDI portal
(Redirected from Publication:723928)
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
Cites work
- A bilevel mixed-integer program for critical infrastructure protection planning
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A facility reliability problem: Formulation, properties, and algorithm
- A hub covering model for cargo delivery systems
- A quadratic integer program for the location of interacting hub facilities
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- Closest assignment constraints and location models: Properties and structure
- Closest assignment constraints in discrete location problems
- Competitive Location on a Network
- Designing robust coverage networks to hedge against worst-case facility losses
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- Equation of state calculations by fast computing machines
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- Foundations of bilevel programming
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Hub Location and the p-Hub Median Problem
- Integer programming formulations of discrete hub location problems
- Locating service facilities whose reliability is distance dependent.
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Model formulations for hub covering problems
- Network hub location problems: The state of the art
- On solving unreliable planar location problems
- On the single-assignment \(p\)-hub center problem
- Optimization by simulated annealing
- Practical bilevel optimization. Algorithms and applications
- Reliable facility location design under the risk of disruptions
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- The budget constrained r-interdiction median problem with capacity expansion
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The single-assignment hub covering problem: Models and linearizations
- The stochastic interdiction median problem with disruption intensity levels
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Uncapacitated single and multiple allocation \(p\)-hub center problems
Cited in
(19)- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- Deep learning based high accuracy heuristic approach for knapsack interdiction problem
- The continuous maximum capacity path interdiction problem
- An exact method for trilevel hub location problem with interdiction
- 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
- 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
- Metaheuristics for bilevel optimization: a comprehensive review
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network
- 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
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- 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)
