Enhanced capacitated facility location problem for mental accounting management using partial resource concentration
From MaRDI portal
Publication:6546998
DOI10.1007/s10479-023-05572-3zbMATH Open1541.9024MaRDI QIDQ6546998
Publication date: 30 May 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Lagrangian relaxationlocal searchrisk managementmental accountingcapacitated facility location problemsingle source constraint
Mixed integer programming (90C11) Continuous location (90B85) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- A heuristic for BILP problems: the single source capacitated facility location problem
- The reliable \(p\)-median problem with at-facility service
- Reliable facility location design under disruptions
- A cutting plane algorithm for the capacitated facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Introducing capacities in the location of unreliable facilities
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- On single-source capacitated facility location with cost and fairness objectives
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
- Reliable Facility Location Design Under the Risk of Disruptions
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- A facility reliability problem: Formulation, properties, and algorithm
- A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions
This page was built for publication: Enhanced capacitated facility location problem for mental accounting management using partial resource concentration