New lower bounds for the facility location problem with clients’ preferences

DOI10.1134/S0965542509060098zbMath1199.91125OpenAlexW2003022452MaRDI QIDQ3652444

K. B. Klimentova, Yury A. Kochetov, Igor' Leonidovich Vasilyev

Publication date: 17 December 2009

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542509060098

zbMATH Keywords

two-level programmingbilevel facility locationcorrect inequalities

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) (n)-person games, (n>2) (91A06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Bilevel programming and applications ⋮ A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences ⋮ Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems ⋮ Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences ⋮ Dynamically second-preferred \(p\)-center problem ⋮ Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm ⋮ Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences ⋮ Computational complexity of the discrete competitive facility location problem

This page was built for publication: New lower bounds for the facility location problem with clients’ preferences