Volume 21, Number 4, 1987
|Page(s)||307 - 323|
|Published online||06 February 2017|
- H. CROWDER and M. W. PADBERG, Solving Large-Scale Symmetric Traveling Salesm an Problems to Optimality, Management Science, Vol. 26, 1980, pp. 495-509. [MR: 585424] [Zbl: 0444.90068]
- J. EDMONDS, Maximum Matching and a Polyhedron with (0, 1) Vertices, Journal of Research of National Bureau of Standards, Vol. 69B, 1965, pp. 125-130. [MR: 183532] [Zbl: 0141.21802]
- M. L. FISHER, R. JAIKUMAR and L. VAN WASSENHOVE, A Multiplier Adjustment Method for the Generalized Assignment Problem, Management Science, Vol. 32, 1986, pp. 1095-1103. [Zbl: 0626.90036]
- A. GEOFFRION, Lagrangean Relaxation and its Uses in Integer Programming, Math. Prog. Study, Vol. 2, 1974, pp. 82-114. [MR: 439172] [Zbl: 0395.90056]
- F. GLOVER and J. MULVEY, The Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Network Models, Report HBS 75-46, Harvard University (1975), also Op. Res., Vol. 28(3), 1980, pp. 829-933. [Zbl: 0443.90064]
- F. GLOVER and D. KLINGMAN, Layering Strategies for Creating Exploitable Structure in Linear and Integer Programs, Center for Business Decision Analysis Report, Vol. 119 (Nov. 1984, revised June 1985). [Zbl: 0667.90070]
- M. GUIGNARD and M. ROSENWEIN, An Application of Lagrangean Decomposition to the Generalized Assignment Problem, Department of Decision Sciences Report # 85-09-02, Univ. of Penn., 1985.
- M. GUIGNARD and M. ROSENWEIN, An Application of Lagrangean Decomposition to the Resource-Constrained Minimum Weighted Arborescence Problem, Research Report, Department of Decision Sciences, University of Pennsylvania, and AT & T Bell Laboratories, Holmdel, NJ, 1987. [Zbl: 0701.90064]
- M. GUIGNARD, Lagrangean Decomposition: An Ideal Approach for Problems with Implicit Constraints, Dept. of Statistics, Report # 88, University of Pennsylvania, 1986.
- M. HELD and R. M. KARP, The Traveling Salesman Problem and Minimum Spanning Trees: Part I, Operations Research, Vol. 18, 1970, pp. 1138-1162. [MR: 278710] [Zbl: 0226.90047]
- K. O. JÖRNSTEN, M. NÄSBERG and P. A. SMEDS, Variable splitting. A New Lagrangean Relaxation Approach to Some Mathematical Programming Models, Department of Mathematics Report LiTH-MAT-R-85-04, Linköping Institute of Technology, Sweden, 1985.
- K. O. JÖRNSTEN and M. NÄSBERG, A New Lagrangean Relaxation Approach to the Generalized Assignment Problem, European Journal of Operational Research, Vol. 27, No. 3, 1986, pp. 313-323. [MR: 864903] [Zbl: 0617.90068]
- S. MARTELLO and P. TOTH, An Algorithm for the Generalized Assignment Problem, in J. P. Brans (Ed.), Operational Research 81, North Holland, Amsterdam, 1981, pp. 589-603. [MR: 651209] [Zbl: 0473.90047]
- R. M. NAUSS, An Improved Algorithm for the Capacitated Facility Location Problem, Vol. 29, 1978, Operational Research Society, pp. 1195-1202. [Zbl: 0402.90063]
- C. RIBEIRO, Algorithmes de recherche de plus courts chemins avec contraintes : Étude théorique, implémentation et parallélisation, Doctoral Dissertation, Paris, 1983.
- M. ROSENWEIN, Design and Application of Solution Methodologies to Optimize Problems in Transportation Logistics, Doctoral Dissertation, Dept. of Decision Sciences, University of Pennsylvania, 1986.
- G. T. ROSS and R. M. SOLAND, A Branch and Bound Algorithm for the Generalized Assignment Problem, Mathematical Programming, Vol. 8, 1975, pp. 92-103. [MR: 368757] [Zbl: 0308.90028]
- F. SHEPARDSON and R. MARSTEN, A Lagrangean Relaxation Algorithm for the Two-Duty Period Scheduling Problem, Man. Sc., 26(3), 1980, pp. 274-281. [MR: 591284] [Zbl: 0448.90042]
- T. J. VAN ROY, A Cross Decomposition Algorithm For Capacitated Facility Location, Working Paper 80-8A, Afdeling Industrieel Beleid, Katholieke Universiteit Leuven, 1980. [Zbl: 0594.90022]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.