Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-7
|
Results: 7
Scheduling projects with labor constraints
Authors:
Cavalcante, CCB de Souza, CC Savelsbergh, MWP Wang, Y Wolsey, LA
Citation:
Ccb. Cavalcante et al., Scheduling projects with labor constraints, DISCR APP M, 112(1-3), 2001, pp. 27-52
Aggregation and mixed integer rounding to solve mips
Authors:
Marchand, H Wolsey, LA
Citation:
H. Marchand et La. Wolsey, Aggregation and mixed integer rounding to solve mips, OPERAT RES, 49(3), 2001, pp. 363-371
The uncapacitated lot-sizing problem with sales and safety stocks
Authors:
Loparic, M Pochet, Y Wolsey, LA
Citation:
M. Loparic et al., The uncapacitated lot-sizing problem with sales and safety stocks, MATH PROGR, 89(3), 2001, pp. 487-504
Modelling practical lot-sizing problems as mixed-integer programs
Authors:
Belvaux, G Wolsey, LA
Citation:
G. Belvaux et La. Wolsey, Modelling practical lot-sizing problems as mixed-integer programs, MANAG SCI, 47(7), 2001, pp. 993-1007
bc-prod: A specialized branch-and-cut system for lot-sizing problems
Authors:
Belvaux, G Wolsey, LA
Citation:
G. Belvaux et La. Wolsey, bc-prod: A specialized branch-and-cut system for lot-sizing problems, MANAG SCI, 46(5), 2000, pp. 724-738
bc-opt: a branch-and-cut code for mixed integer programs
Authors:
Cordier, C Marchand, H Laundy, R Wolsey, LA
Citation:
C. Cordier et al., bc-opt: a branch-and-cut code for mixed integer programs, MATH PROGR, 86(2), 1999, pp. 335-353
The 0-1 Knapsack problem with a single continuous variable
Authors:
Marchand, H Wolsey, LA
Citation:
H. Marchand et La. Wolsey, The 0-1 Knapsack problem with a single continuous variable, MATH PROGR, 85(1), 1999, pp. 15-33
Risultati:
1-7
|