SCOPUS 정보 검색 플랫폼

Volumn 39, Issue 2, 1987, Pages 215-228

Lagrangean decomposition: A model yielding stronger lagrangean bounds

a UNIVERSITY OF PENNSYLVANIA (United States)

Author keywords

block angularization; bound improvement; Integrality Property; Lagrangean decomposition; Lagrangean relaxation; Mixed integer programming; Y convexity

Indexed keywords

LAGRANGEAN DECOMPOSITION; LAGRANGEAN DUAL; LAGRANGEAN RELAXATION; MIXED-INTEGER PROGRAMMING;

MATHEMATICAL PROGRAMMING;

EID: 0023451776 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/BF02592954 Document Type: Article

Times cited : (319)

References (31)

1
- 84936231059
- O. Bilde and J. Krarup, “Bestemmelse af optimal beliggenhed af produktionssteder” Research Report, IMSOR, The Technical University of Denmark (1967).

2
- 0002668131
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem
- (1977) Annals of Discrete Mathematics , vol.1 , pp. 79-97
- Bilde, O.¹ Krarup, J.²

3
- 34250258603
- Calculating Surrogate Constraints
- (1980) Mathematical Programming , vol.19 , pp. 255-278
- Dyer, M.E.¹

4
- 0018031445
- A Dual-Based Procedure for Uncapacitated Facility Location
- (1978) Operations Research , vol.26 , pp. 992-1009
- Erlenkotter, D.¹

5
- 0000354875
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- (1986) Management Science , vol.32 , pp. 1095-1103
- Fisher, M.L.¹ Jaikumar, R.² Van Wassenhove, L.³

6
- 0000484665
- A Weighted Matroid Intersection Algorithm
- (1981) Journal of Algorithms , vol.2 , pp. 328-336
- Frank, A.¹

7
- 0021886787
- Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality
- (1985) Mathematical Programming , vol.31 , pp. 78-105
- Gavish, B.¹ Pirkul, H.²

8
- 0002554041
- Lagrangean Relaxation and its Uses in Integer Programming
- (1974) Mathematical Programming Study , vol.2 , pp. 82-114
- Geoffrion, A.¹

9
- 84936269801
- 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 Operations Research 28 (1980) 829–933.

10
- 84936252983
- F. Glover and D. Klingman, “Layering Strategies for Creating Exploitable Structure in Linear and Integer Programs,” Center for Business Decision Analysis Report 119 (1984, revised 1985).

11
- 0001661117
- Surrogate Mathematical Programming
- (1970) Operations Research , vol.18 , pp. 924-939
- Greenberg, H.J.¹ Pierskalla, W.P.²

12
- 84936224544
- M. Guignard, “A Lagrangean Dual Ascent Method Based on (Separable) Relaxation Strengthened by Valid Inequalities (Illustrated for the Matching Problem),” Department of Statistics Report #54, University of Pennsylvania (1983).

13
- 84936271880
- M. Guignard, “A Lagrangean Dual Ascent Method for Simple Plant Location Problems,” Department of Statistics Report #59, University of Pennsylvania (1984a), to appear in European J. Oper. Res.

14
- 84936273238
- M. Guignard, “Lagrangean Decomposition: An Improvement over Lagrangean and Surrogate Duals,” Department of Statistics Report #62, University of Pennsylvania (1984b).

15
- 84936296857
- M. Guignard and S. Kim, “A Strong Lagrangean Relaxation for Capacitated Plant Locations Problems,” Department of Statistics Report #56, University of Pennsylvania (1983).

16
- 84936285627
- M. Guignard and K. Opaswongkarn, “Lagrangean Ascent for the Capacitated Plant Location Problem,” Department of Statistics Report #57, University of Pennsylvania (1984).

17
- 84936300503
- M. Guignard and M. Rosenwein, “An Application of Lagrangean Decomposition to the Resource Constrained Minimum Weighted Arborescence Problem,” AT&T Bell Laboratories Report (1987).

18
- 84936298324
- Separable Lagrangean Relaxation for Weakly-Linked Mixed Integer Programming Problems
- (1985) Methods of Operations Research , vol.49 , pp. 239-253
- Guignard, M.¹ Spielberg, K.²

19
- 84987047540
- A Dual Algorithm for the Constrained Shortest Path Problem
- (1980) Networks , vol.10 , pp. 293-310
- Handler, G.Y.¹ Zang, I.²

20
- 0003073445
- Department of Mathematics Report LiTHMAT-R-85-04, Linköping Institute of Technology, Sweden
- (1985) Variable splitting—A New Lagrangean Relaxation Approach to Some Mathematical Programming Models
- Jörnsten, K.O.¹ Näsberg, M.² Smeds, P.A.³

21
- 0018543663
- Some Relationships between Lagrangean and Surrogate Duality in Integer Programming
- (1979) Mathematical Programming , vol.18 , pp. 320-334
- Karwan, M.H.¹ Rardin, R.L.²

22
- 84936296579
- S. Kim, oral communication (1984).

23
- 84936248956
- S. Kim, “Solving Single Side Constraint Problems in Integer Programming: the Inequality Case,” Department of Statistics, Report #60, University of Pennsylvania (1984).

24
- 84936264480
- S. Kim, “Primal Interpretation of Lagrangean Decomposition” Department of Statistics Report #72, University of Pennsylvania (1985).

25
- 0016572409
- Plus courts chemins avec contraintes: algorithmes et applications
- (1975) Annales des Télécommunications , vol.30 , pp. 383-394
- Minoux, M.¹

26
- 84936283148
- M. Minoux, “Lagrangean Decomposition,” oral communication (1983).

27
- 84936264161
- C. Ribeiro, “Algorithmes de Recherche de Plus Courts Chemins avec Contraintes: Etude Théorique, Implémentation et Parallélisation,” Doctoral Dissertation, Paris (1983).

28
- 84936280057
- C. Ribeiro and M. Minoux, “Solving Hard Constrained Shortest Path Problems,” ORSA-TIMS Meeting, Dallas (1984).

29
- 25144510309
- Solving Hard Constrained Shortest Path Problems by Lagrangean Relaxation and Branch and Bound Algorithms
- (1986) Methods of Operations Research , vol.53 , pp. 303-316
- Ribeiro, C.¹ Minoux, M.²

30
- 0018989395
- A Lagrangean Relaxation Algorithm for the Two-Duty Period Scheduling Problem
- (1980) Management Science , vol.26 , pp. 274-281
- Shepardson, F.¹ Marsten, R.²

31
- 0021411220
- A Dual Ascent Approach for Steiner Tree Problems on a Directed Graph
- (1984) Mathematical Programming , vol.28 , pp. 271-287
- Wong, R.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.