Revisiting Stackelberg p-median problem with user preferences
From MaRDI portal
Publication:6065620
DOI10.1016/j.cor.2023.106429MaRDI QIDQ6065620
Yun Hui Lin, Qingyun Tian, Yuan Wang, Dongdong He
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Closest assignment constraints in discrete location problems
- Facility location and supply chain management. A review
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- A strengthened formulation for the simple plant location problem with order
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences
- Facility location and pricing problem: discretized mill price and exact algorithms
This page was built for publication: Revisiting Stackelberg p-median problem with user preferences
