Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
Published Online:1 Dec 1975https://doi.org/10.1287/opre.23.6.1183
- Cited by
- 28 April 2025 | Transportation Science, Vol. 59, No. 3
- 18 May 2018 | Journal of Global Optimization, Vol. 72, No. 3
- Computers & Industrial Engineering, Vol. 64, No. 2
- 15 August 2011
- Journal of Heuristics, Vol. 11, No. 4
- Annals of Operations Research, Vol. 115, No. 1-4
- European Journal of Operational Research, Vol. 106, No. 2-3
- Computers & Operations Research, Vol. 18, No. 1
- Annals of Operations Research, Vol. 25, No. 1
- Computers & Operations Research, Vol. 17, No. 1
- SIAM Journal on Scientific and Statistical Computing, Vol. 5, No. 4
- Journal of Optimization Theory and Applications, Vol. 37, No. 2
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 28, No. 4
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 27, No. 4
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 27, No. 3
- 29 October 2013 | Naval Research Logistics Quarterly, Vol. 26, No. 4
Volume 23, Issue 6
November-December 1975
Pages 1045-1191
Article Information
Metrics
Information
- Published Online:December 01, 1975
© 1975 INFORMS
Cite as
Patrick McKeown, (1975) Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem. Operations Research 23(6):1183-1191.
https://doi.org/10.1287/opre.23.6.1183
