-
2
-
-
0014924953
-
Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables
-
Lawrence J. (Ed), Tavistock Publications
-
Beale E.M.L., and Tomlin J.A. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence J. (Ed). Proceedings of the Fifth International Conference on Operations Research (1970), Tavistock Publications 447-454
-
(1970)
Proceedings of the Fifth International Conference on Operations Research
, pp. 447-454
-
-
Beale, E.M.L.1
Tomlin, J.A.2
-
3
-
-
0017501641
-
Solving nonlinear resistive networks using piecewise linear analysis and simplicial subdivision
-
Chien M.J., and Kuh E.S. Solving nonlinear resistive networks using piecewise linear analysis and simplicial subdivision. IEEE Trans. Circuits Systems 24 (1977) 305-317
-
(1977)
IEEE Trans. Circuits Systems
, vol.24
, pp. 305-317
-
-
Chien, M.J.1
Kuh, E.S.2
-
4
-
-
0142095169
-
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
-
Croxton K.L., Gendron B., and Magnanti T.L. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Manage. Sci. 49 (2003) 1268-1273
-
(2003)
Manage. Sci.
, vol.49
, pp. 1268-1273
-
-
Croxton, K.L.1
Gendron, B.2
Magnanti, T.L.3
-
5
-
-
0008644215
-
On the significance of solving linear programming problems with some integer variables
-
Dantzig G.B. On the significance of solving linear programming problems with some integer variables. Econometrica 28 (1960) 30-44
-
(1960)
Econometrica
, vol.28
, pp. 30-44
-
-
Dantzig, G.B.1
-
6
-
-
39149117144
-
E.M.L. Beale, FRS; friend and colleague
-
Dantzig G.B., and Tomlin J.A. E.M.L. Beale, FRS; friend and colleague. Math. Programming 38 (1987) 117-131
-
(1987)
Math. Programming
, vol.38
, pp. 117-131
-
-
Dantzig, G.B.1
Tomlin, J.A.2
-
7
-
-
39149133258
-
-
I.R. de Farias Jr., Semi-continuous cuts for mixed-integer programming, Working Paper, State University of New York, 2003.
-
I.R. de Farias Jr., Semi-continuous cuts for mixed-integer programming, Working Paper, State University of New York, 2003.
-
-
-
-
8
-
-
35048847925
-
Semi-continuous cuts for mixed-integer programming
-
Bienstock D., and Nemhauser G.L. (Eds), Springer, Berlin
-
de Farias Jr. I.R. Semi-continuous cuts for mixed-integer programming. In: Bienstock D., and Nemhauser G.L. (Eds). Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science vol. 3064 (2004), Springer, Berlin 163-177
-
(2004)
Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science
, vol.3064
, pp. 163-177
-
-
de Farias Jr., I.R.1
-
9
-
-
0000891832
-
A generalized assignment problem with special ordered sets: a polyhedral approach
-
de Farias Jr. I.R., Johnson E.L., and Nemhauser G.L. A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Programming 89 (2000) 187-203
-
(2000)
Math. Programming
, vol.89
, pp. 187-203
-
-
de Farias Jr., I.R.1
Johnson, E.L.2
Nemhauser, G.L.3
-
10
-
-
0008644216
-
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
-
de Farias I.R., Johnson E.L., and Nemhauser G.L. Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowledge Eng. Rev. 16 (2001) 25-39
-
(2001)
Knowledge Eng. Rev.
, vol.16
, pp. 25-39
-
-
de Farias, I.R.1
Johnson, E.L.2
Nemhauser, G.L.3
-
15
-
-
33749636873
-
A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization
-
Keha A.B., de Farias Jr. I.R., and Nemhauser G.L. A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54 (2006) 847-858
-
(2006)
Oper. Res.
, vol.54
, pp. 847-858
-
-
Keha, A.B.1
de Farias Jr., I.R.2
Nemhauser, G.L.3
-
16
-
-
0008397584
-
Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
-
Konno H., and Wijayanayake A. Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Programming 89 (2001) 233-250
-
(2001)
Math. Programming
, vol.89
, pp. 233-250
-
-
Konno, H.1
Wijayanayake, A.2
-
17
-
-
0007797750
-
On the solution of discrete programming problems
-
Markowitz H.M., and Manne A.S. On the solution of discrete programming problems. Econometrica 25 (1957) 84-110
-
(1957)
Econometrica
, vol.25
, pp. 84-110
-
-
Markowitz, H.M.1
Manne, A.S.2
-
18
-
-
29044440180
-
Mixed-integer models for the stationary case of gas network optimization
-
Martin A., Möller M., and Moritz S. Mixed-integer models for the stationary case of gas network optimization. Math. Programming 105 (2006) 563-582
-
(2006)
Math. Programming
, vol.105
, pp. 563-582
-
-
Martin, A.1
Möller, M.2
Moritz, S.3
-
19
-
-
0016544663
-
Integer and mixed-integer programming models: general properties
-
Meyer R.R. Integer and mixed-integer programming models: general properties. J. Optim. Theory Appl. 16 (1975) 191-206
-
(1975)
J. Optim. Theory Appl.
, vol.16
, pp. 191-206
-
-
Meyer, R.R.1
-
20
-
-
39149091829
-
Mixed-integer minimization models for piecewise-linear functions of a single variable
-
Meyer R.R. Mixed-integer minimization models for piecewise-linear functions of a single variable. Discrete Math. 16 (1976) 163-171
-
(1976)
Discrete Math.
, vol.16
, pp. 163-171
-
-
Meyer, R.R.1
-
21
-
-
0001412587
-
Large-scale portfolio optimization
-
Perold A.F. Large-scale portfolio optimization. Manage. Sci. 30 (1984) 1143-1160
-
(1984)
Manage. Sci.
, vol.30
, pp. 1143-1160
-
-
Perold, A.F.1
-
22
-
-
39149145608
-
-
J.P. Vielma, A.B. Keha, G.L. Nemhauser, Polyhedral aspects of nonconvex lower semicontinuous piecewise linear optimization, Working Paper, Georgia Institute of Technology, 2006.
-
J.P. Vielma, A.B. Keha, G.L. Nemhauser, Polyhedral aspects of nonconvex lower semicontinuous piecewise linear optimization, Working Paper, Georgia Institute of Technology, 2006.
-
-
-
|