A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
From MaRDI portal
Publication:2314413
DOI10.1016/0167-6377(89)90054-0zbMath1418.90062OpenAlexW2054319241MaRDI QIDQ2314413
Jean-Michel Thizy, Hugo P. Simao
Publication date: 22 July 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90054-0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using a facility location algorithm to solve large set covering problems
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A projection method for the uncapacitated facility location problem
- Solving covering problems and the uncapacitated plant location problem on trees
- A direct dual method for the mixed plant location problem with some side constraints
- Simplex pivots on the set packing polytope
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Some facets of the simple plant location polytope
- A Primal Approach to the Simple Plant Location Problem
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- A New Algorithm for Locating Sources Among Destinations
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A man-machine approach toward solving the traveling salesman problem
- On the Set-Covering Problem
This page was built for publication: A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
