Designing a model for service facility protection with a time horizon based on tri-level programming (Q5059288): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1791446
Created claim: Wikidata QID (P12): Q128316588, #quickstatements; #temporary_batch_1723924200075
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Armand Baboli / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel partial interdiction problem with capacitated facilities and demand outsourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel fixed charge location model for facilities under imminent attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budget constrained \(r\)-interdiction median problem with capacity expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bi-level programming model for protection of hierarchical facilities under imminent attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear bilevel programming solution by genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing sudden transportation disruptions in supply chains under delivery delay and quantity loss / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel mixed-integer program for critical infrastructure protection planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution approach for the interdiction median problem with fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving bi-level optimization problems in engineering design using kriging models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing heuristic for the general share-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust parameter design for multi-response problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128316588 / rank
 
Normal rank

Latest revision as of 22:18, 17 August 2024

scientific article; zbMATH DE number 7637098
Language Label Description Also known as
English
Designing a model for service facility protection with a time horizon based on tri-level programming
scientific article; zbMATH DE number 7637098

    Statements

    Designing a model for service facility protection with a time horizon based on tri-level programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 December 2022
    0 references
    0 references
    tri-level programming
    0 references
    interdiction models
    0 references
    metaheuristic algorithms
    0 references
    time horizon
    0 references
    maximal covering
    0 references
    0 references