AAAAAA

   
Results: 1-14 |
Results: 14
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
An integer programming heuristic for component allocation in printed circuit card assembly systems
Authors: DePuy, GW Savelsbergh, MWP Ammons, JC McGinnis, LF
Citation: Gw. Depuy et al., An integer programming heuristic for component allocation in printed circuit card assembly systems, J HEURISTIC, 7(4), 2001, pp. 351-369
A parallel, linear programming-based heuristic for large-scale set partitioning problems
Authors: Linderoth, JT Lee, EKL Savelsbergh, MWP
Citation: Jt. Linderoth et al., A parallel, linear programming-based heuristic for large-scale set partitioning problems, INFORMS J C, 13(3), 2001, pp. 191-209
Valid inequalities for problems with additive variable upper bounds
Authors: Atamturk, A Nemhauser, GL Savelsbergh, MWP
Citation: A. Atamturk et al., Valid inequalities for problems with additive variable upper bounds, MATH PROGR, 91(1), 2001, pp. 145-162
Sequence independent lifting in mixed integer programming
Authors: Gu, ZH Nemhauser, GL Savelsbergh, MWP
Citation: Zh. Gu et al., Sequence independent lifting in mixed integer programming, J COMB OPTI, 4(1), 2000, pp. 109-129
Time-indexed formulations for machine scheduling problems: Column generation
Authors: van den Akker, JM Hurkens, CAJ Savelsbergh, MWP
Citation: Jm. Van Den Akker et al., Time-indexed formulations for machine scheduling problems: Column generation, INFORMS J C, 12(2), 2000, pp. 111-124
Progress in linear programming-based algorithms for integer programming: An exposition
Authors: Johnson, EL Nemhauser, GL Savelsbergh, MWP
Citation: El. Johnson et al., Progress in linear programming-based algorithms for integer programming: An exposition, INFORMS J C, 12(1), 2000, pp. 2-23
A relational modeling system for linear and integer programming
Authors: Atamturk, A Johnson, EL Linderoth, JT Savelsbergh, MWP
Citation: A. Atamturk et al., A relational modeling system for linear and integer programming, OPERAT RES, 48(6), 2000, pp. 846-857
The mixed vertex packing problem
Authors: Atamturk, A Nemhauser, GL Savelsbergh, MWP
Citation: A. Atamturk et al., The mixed vertex packing problem, MATH PROGR, 89(1), 2000, pp. 35-53
Computational study of search strategies for mixed integer programming
Authors: Linderoth, JT Savelsbergh, MWP
Citation: Jt. Linderoth et Mwp. Savelsbergh, Computational study of search strategies for mixed integer programming, INFORMS J C, 11(2), 1999, pp. 173-187
Lifted cover inequalities for 0-1 integer programs: Complexity
Authors: Gu, ZH Nemhauser, GL Savelsbergh, MWP
Citation: Zh. Gu et al., Lifted cover inequalities for 0-1 integer programs: Complexity, INFORMS J C, 11(1), 1999, pp. 117-123
Towards a model and algorithm management system for vehicle routing and scheduling problems
Authors: Desrochers, M Jones, CV Lenstra, JK Savelsbergh, MWP Stougie, L
Citation: M. Desrochers et al., Towards a model and algorithm management system for vehicle routing and scheduling problems, DECIS SUP S, 25(2), 1999, pp. 109-133
Lifted flow cover inequalities for mixed 0-1 integer programs
Authors: Gu, ZH Nemhauser, GL Savelsbergh, MWP
Citation: Zh. Gu et al., Lifted flow cover inequalities for mixed 0-1 integer programs, MATH PROGR, 85(3), 1999, pp. 439-467
A polyhedral approach to single-machine scheduling problems
Authors: van den Akker, JM van Hoesel, CPM Savelsbergh, MWP
Citation: Jm. Van Den Akker et al., A polyhedral approach to single-machine scheduling problems, MATH PROGR, 85(3), 1999, pp. 541-572
Risultati: 1-14 |