-
1
-
-
0000377794
-
Finding everett's lagrange multipliers by linear programming
-
R. Brooks and A. Geoffrion (1966). Finding Everett's Lagrange multipliers by linear programming. Operations Research, 14, 1149-1153.
-
(1966)
Operations Research
, vol.14
, pp. 1149-1153
-
-
Brooks, R.1
Geoffrion, A.2
-
2
-
-
4243945569
-
Bounds for probabilistic integer programming problems
-
RUTCOR, Rutgers University, NJ, RRR
-
D. Dentcheva, A. Prékopa and A. Ruszczyński. Bounds for probabilistic integer programming problems. RUTCOR, Rutgers University, NJ, RRR 31-99.
-
-
-
Dentcheva, D.1
Prékopa, A.2
Ruszczyński, A.3
-
3
-
-
0001958747
-
Concavity and efficient points of discrete distributions in probabilistic programming
-
RUTCOR
-
D. Dentcheva, A. Prékopa and A. Ruszczyński (2000). Concavity and efficient points of discrete distributions in probabilistic programming, RUTCOR. Mathematical Programming, Ser. A, 89, 55-77.
-
(2000)
Mathematical Programming, Ser. A
, vol.89
, pp. 55-77
-
-
Dentcheva, D.1
Prékopa, A.2
Ruszczyński, A.3
-
4
-
-
0000703172
-
Generalized Lagrange's multiplier method for solving problems of optimum allocation
-
H. Everett (1967). Generalized Lagrange's multiplier method for solving problems of optimum allocation. Operations Research, 11, 399-419.
-
(1967)
Operations Research
, vol.11
, pp. 399-419
-
-
Everett, H.1
-
5
-
-
0018543372
-
A O(n log n) algorithm for LP knapsacks with GUB constraints
-
F. Glover and D. Klingman (1979). A O(n log n) algorithm for LP knapsacks with GUB constraints. Mathematical Programming, 17, 345-361.
-
(1979)
Mathematical Programming
, vol.17
, pp. 345-361
-
-
Glover, F.1
Klingman, D.2
-
6
-
-
0001485441
-
Approximations of pseudo-Boolean functions, applications to game theory
-
P.L. Hammer and R. Holzman (1992). Approximations of pseudo-Boolean functions, applications to game theory. Zeitschrift für Operations Research, 36(1), 3-21.
-
(1992)
Zeitschrift für Operations Research
, vol.36
, Issue.1
, pp. 3-21
-
-
Hammer, P.L.1
Holzman, R.2
-
7
-
-
0001315699
-
Dual methods for a one-stage stochastic programming problem with random rhs obeying a discrete probability distribution
-
A. Prékopa (1990). Dual methods for a one-stage stochastic programming problem with random rhs obeying a discrete probability distribution. Zeitschrift für Operations Research, 34, 441-461.
-
(1990)
Zeitschrift für Operations Research
, vol.34
, pp. 441-461
-
-
Prékopa, A.1
-
8
-
-
0002873804
-
Programming under probabilistic constraint with discrete random variables
-
Kluwer Academic Publishers, Boston
-
A. Prékopa, B. Vizvári and T. Badics. Programming under probabilistic constraint with discrete random variables. In: New Trends in Mathematical Programming, pp. 235-255. Kluwer Academic Publishers, Boston, 1998.
-
(1998)
New Trends in Mathematical Programming
, pp. 235-255
-
-
Prékopa, A.1
Vizvári, B.2
Badics, T.3
-
10
-
-
0005006515
-
Beiträge zum Frobenius Problem
-
Dr. sc. nat. Theses, Technische Hochschule "Carl Schorlemmer". Leuna-Merseburg
-
B. Vizvári (1987). Beiträge zum Frobenius Problem. Dr. sc. nat. Theses, Technische Hochschule "Carl Schorlemmer". Leuna-Merseburg.
-
(1987)
-
-
Vizvári, B.1
|