SCOPUS 정보 검색 플랫폼

Volumn 23, Issue 1, 1998, Pages 101-118

Lower bounds in lot-sizing models: A polyhedral study

Author keywords

Lot sizing; Mixed integer programming; Polyhedral combinatorics; Variable lower bounds

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

LOT SIZING MODEL; MIXED INTEGER PROGRAMMING;

INTEGER PROGRAMMING;

EID: 0032001763 PISSN: 0364765X EISSN: None Source Type: Journal
DOI: 10.1287/moor.23.1.101 Document Type: Article

Times cited : (31)

References (12)

1
- 0020194024
- Computational complexity of the capacitated lotsizing problem
- Bitran, G. R., H. H. Yanasse (1982). Computational complexity of the capacitated lotsizing problem. Management Sci. 28 1174-1186.
- (1982) Management Sci. , vol.28 , pp. 1174-1186
- Bitran, G.R.¹ Yanasse, H.H.²

2
- 0004225083
- Ph.D. thesis Université Catholique de Louvain, Belgium
- Constantino, M. (1995). A polyhedral approach to production planning models : Start-up costs and times, upper and lower bounds on production, Ph.D. thesis Université Catholique de Louvain, Belgium.
- (1995) A Polyhedral Approach to Production Planning Models : Start-up Costs and Times, Upper and Lower Bounds on Production
- Constantino, M.¹

3
- 0003697643
- Incline Village, Nevada USA
- CPLEX Organization, Inc. (1994) Using the CPLEX Callable Library (Version 3.0). Incline Village, Nevada USA.
- (1994) Using the CPLEX Callable Library (Version 3.0)

4
- 0024922371
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- Goemans, M. X. (1989). Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Oper. Res. Letters 8 315-322.
- (1989) Oper. Res. Letters , vol.8 , pp. 315-322
- Goemans, M.X.¹

6
- 0001255645
- Graph theory and integer programming
- Lovasz, L. (1979). Graph theory and integer programming. Annals of Discrete Math. 4 141-158.
- (1979) Annals of Discrete Math. , vol.4 , pp. 141-158
- Lovasz, L.¹

7
- 0009394731
- Using separation algorithms to generate mixed integer model reformulations
- Martin, R. K. (1991). Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Letters 10 119-128.
- (1991) Oper. Res. Letters , vol.10 , pp. 119-128
- Martin, R.K.¹

8
- 0003869077
- Georgia Institute of Technology, USA
- Nemhauser, G. L., M. W. P. Savelsbrgh (1994). Functional description of MINTO, a Mixed INTeger Optimizer, Version 2.0. Georgia Institute of Technology, USA.
- (1994) Functional Description of MINTO, a Mixed INTeger Optimizer, Version 2.0
- Nemhauser, G.L.¹ Savelsbrgh, M.W.P.²

9
- 0001547772
- Lot-sizing with constant batches: Formulation and valid inequalities
- Pochet, Y., L. A. Wolsey (1993). Lot-sizing with constant batches: formulation and valid inequalities. Math. Oper. Res. 18 767-785
- (1993) Math. Oper. Res. , vol.18 , pp. 767-785
- Pochet, Y.¹ Wolsey, L.A.²

10
- 0028715377
- Polyhedra for lot-sizing with Wagner-Whitin costs
- _, _(1994). Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Programming 67 297-323.
- (1994) Math. Programming , vol.67 , pp. 297-323

11
- 0000555407
- Capacitated lot-sizing with set-up times
- Trigueiro, W. W., L. J. Thomas, J. O. McClain (1989). Capacitated lot-sizing with set-up times. Management Sci. 35 353-366.
- (1989) Management Sci. , vol.35 , pp. 353-366
- Trigueiro, W.W.¹ Thomas, L.J.² McClain, J.O.³

12
- 0022733730
- Valid inequalities for mixed 0-1 programs
- Van Roy, T. J., L. A. Wolsey (1986). Valid inequalities for mixed 0-1 programs. Discrete Appl. Math. 14 199-213.
- (1986) Discrete Appl. Math. , vol.14 , pp. 199-213
- Van Roy, T.J.¹ Wolsey, L.A.²

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