search query: @indexterm MIXED INTEGER PROGRAMMING / total: 39
references: 20-29 / 39
« previous page | next page »
 titleyearauthor
20.
Solving multi-item lot-sizing problems using strong cutting planes.
Management Science
1991 : JAN, VOL. 37:1, p. 53-67
 1991 Pochet, Y.
Wolsey, L. A.
21.
The mixed integer linear bilevel programming problem.
Operations Research
1990 : SEP-OCT, VOL. 38:5, p. 911-921
 1990 Moore, J. T.
Bard, J. F.
22.
Extensions of mathematical programming-based classification rules : A multicriteria approach.
European Journal of Operational Research
1990 : OCT 16, VOL. 48:3, p. 351-361
 1990 Stam, A.
23.
Minimizing misclassifications in linear discriminant analysis
Decision Sciences
1990 : WINT. VOL. 21:1, p.63-83
 1990 Koehler, G. J.
Erenguc, S. S.
24.
Optimal bundle pricing.
Management Science
1990 : FEB, VOL. 36:2, p. 155-174
 1990 Hanson, W.
Martin, R. K.
25.
Inventory and transportation planning in the distribution of fine papers.
Journal of the Operational Research Society
1989 : FEB, VOL. 40:2, p. 155-166
 1989 Bookbinder, J. H.
McAuley, P. T.
Schulte, J.
26.
The Knapsack Problem with Generalized Upper Bounds
European Journal of Operational Research
1989 : VOL. 38:2, p.242-254
 1989 Elmaghraby, E.
27.
A Hybrid Method for Solving Nonlinear Knapsack Problems
European Journal of Operational Research
1989 : VOL. 38:2, p.238-241
 1989 Korner, F.
28.
A Branch and Bound Algorithm to Minimize the Number of Late Jobs in a Permutation Flow-Shop
European Journal of Operational Research
1989 : VOL. 38:2, p.228-237
 1989 Hariri, A. M. A.
Potts, C. N.
29.
Integer Programming Formulations for the Multi-Depot Vehicle Routing Problem: Comments on a Paper by Kulkarni and Bhave
European Journal of Operational Research
1989 : VOL. 38:2, p.227
 1989 Laporte, G.
« previous page | next page »
SCIMA