SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 98, Issue 3, 2000, Pages 265-274

Valid inequalities and separation for capacitated fixed charge flow problems

(1) Stallaert, Jan a

a UNIVERSITY OF TEXAS AT AUSTIN (United States)

Author keywords

Capacitated fixed charge networks; Mixed integer programming; Network design; Polyhedral cuts

Indexed keywords

EID: 0000261465 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(99)00164-X Document Type: Article

Times cited : (8)

References (15)

1
- 0030303863
- Network design using cut inequalities
- Barahona F. Network design using cut inequalities. SIAM J. Optim. 6:1996;823-837.
- (1996) SIAM J. Optim. , vol.6 , pp. 823-837
- Barahona, F.¹

2
- 0021513251
- Strong formulations for multi-item capacitated lot sizing
- Barany I., Van Roy T.J., Wolsey L.A. Strong formulations for multi-item capacitated lot sizing. Management Sci. 30:1984;1255-1261.
- (1984) Management Sci. , vol.30 , pp. 1255-1261
- Barany, I.¹ Van Roy, T.J.² Wolsey, L.A.³

3
- 0346991782
- Working Paper, Columbia University, December
- D. Bienstock, Experiments with a network design algorithm using ε -approximate linear programs, Working Paper, Columbia University, December 1996.
- (1996) Experiments with a Network Design Algorithm Using ε-approximate Linear Programs
- Bienstock, D.¹

4
- 0001237931
- Capacitated network design - Polyhedral structure and computation
- Bienstock D., Günlük O. Capacitated network design - polyhedral structure and computation. INFORMS J. Comput. 8:1996;243-259.
- (1996) INFORMS J. Comput. , vol.8 , pp. 243-259
- Bienstock, D.¹ Günlük, O.²

5
- 0010504032
- Working Paper, Columbia University, December
- D. Bienstock, G. Muratore, Strong inequalities for capacitated survivable network design problems, Working Paper, Columbia University, December 1997.
- (1997) Strong Inequalities for Capacitated Survivable Network Design Problems
- Bienstock, D.¹ Muratore, G.²

6
- 0346991787
- Optimum utilization of the transportation system
- Washington D.C.
- T.C. Koopmans, Optimum utilization of the transportation system, Proceedings of the International Statistical Conferences, Washington D.C., Vol. 5, 1947, pp. 136-142.
- (1947) Proceedings of the International Statistical Conferences , vol.5 , pp. 136-142
- Koopmans, T.C.¹

7
- 0000957203
- Valid inequalities and facets of the capacitated plant location problem
- Leung J.M.Y., Magnanti T.L. Valid inequalities and facets of the capacitated plant location problem. Math. Programm. 44:1989;271-291.
- (1989) Math. Programm. , vol.44 , pp. 271-291
- Leung, J.M.Y.¹ Magnanti, T.L.²

8
- 0345730862
- Manuscript
- J.W. Mamer, J. Stallaert, LPX/IP : implementation of a depth first search dual simplex based algorithm, Manuscript 1994.
- (1994) LPX/IP: Implementation of a Depth First Search Dual Simplex Based Algorithm
- Mamer, J.W.¹ Stallaert, J.²

9
- 0022059874
- Subset coefficient reduction cuts for 0/1 mixed-integer programming
- Martin K.P., Schrage L. Subset coefficient reduction cuts for. 0/1 mixed-integer programming Oper. Res. 33:1985;505-526.
- (1985) Oper. Res. , vol.33 , pp. 505-526
- Martin, K.P.¹ Schrage, L.²

10
- 85101463362
- Wiley, New York
- G.W. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
- (1988) Integer and Combinatorial Optimization
- Nemhauser, G.W.¹ Wolsey, L.A.²

11
- 0022099739
- Valid linear inequalities for fixed charge problems
- Padberg M.W., Van Roy T.J., Wolsey L.A. Valid linear inequalities for fixed charge problems. Oper. Res. 33:1985;842-861.
- (1985) Oper. Res. , vol.33 , pp. 842-861
- Padberg, M.W.¹ Van Roy, T.J.² Wolsey, L.A.³

12
- 0040540547
- unpublished Ph.D. Dissertation, Anderson Graduate School of Management at UCLA
- J. Stallaert, On the polyhedral structure of capacitated fixed charge network problems, unpublished Ph.D. Dissertation, Anderson Graduate School of Management at UCLA, 1992.
- (1992) On the Polyhedral Structure of Capacitated Fixed Charge Network Problems
- Stallaert, J.¹

13
- 0003091016
- The complementary class of generalized flow cover inequalities
- Stallaert J. The complementary class of generalized flow cover inequalities. Discrete Appl. Math. 77:1997;73-80.
- (1997) Discrete Appl. Math. , vol.77 , pp. 73-80
- Stallaert, J.¹

14
- 0023250226
- Solving mixed integer programming problems using automatic reformulation
- Van Roy T.J., Wolsey L.A. Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35:1985;45-57.
- (1985) Oper. Res. , vol.35 , pp. 45-57
- Van Roy, T.J.¹ Wolsey, L.A.²

15
- 0022733730
- Valid inequalities for mixed 0-1 problems
- Van Roy T.J., Wolsey L.A. Valid inequalities for mixed 0-1 problems. Discrete Appl. Math. 4:1986;199-213.
- (1986) Discrete Appl. Math. , vol.4 , pp. 199-213
- Van Roy, T.J.¹ Wolsey, L.A.²

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