Hub interdiction problem variants: models and metaheuristic solution algorithms
type: Item
instance of: scholarly article
title: Hub interdiction problem variants: models and metaheuristic solution algorithms
zbMATH Open document ID: 1403.90475
author: Alireza Motallebzadeh
author: Nader Ghaffari-Nasab
published in: European Journal of Operational Research
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 91A65
zbMATH DE Number: 6910026
zbMATH Keywords: location
zbMATH Keywords: hub interdiction problems
zbMATH Keywords: competitive models
zbMATH Keywords: bilevel programming
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.11.058
OpenAlex ID: W2771144315
cites work: A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
cites work: The budget constrained \(r\)-interdiction median problem with capacity expansion
cites work: Network hub location problems: The state of the art
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Locating service facilities whose reliability is distance dependent.
cites work: Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
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: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Reliable Facility Location Design Under the Risk of Disruptions
cites work: Foundations of bilevel programming
cites work: Competitive Location on a Network
cites work: Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms
cites work: Uncapacitated single and multiple allocation \(p\)-hub center problems
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: Closest assignment constraints in discrete location problems
cites work: Closest assignment constraints and location models: Properties and structure
cites work: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
cites work: A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
cites work: The single-assignment hub covering problem: Models and linearizations
cites work: On the single-assignment \(p\)-hub center problem
cites work: Optimization by Simulated Annealing
cites work: On solving unreliable planar location problems
cites work: Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
cites work: A facility reliability problem: Formulation, properties, and algorithm
cites work: The stochastic interdiction median problem with disruption intensity levels
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Designing robust coverage networks to hedge against worst-case facility losses
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
cites work: Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
cites work: A bilevel mixed-integer program for critical infrastructure protection planning
cites work: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: A hub covering model for cargo delivery systems
cites work: Model formulations for hub covering problems
cites work: Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
DOI: 10.1016/J.EJOR.2017.11.058
description: scientific article; zbMATH DE number 6910026