AAAAAA

   
Results: 1-16 |
Results: 16
Solving large airline crew scheduling problems: Random pairing generation and strong branching
Authors: Klabjan, D Johnson, EL Nemhauser, GL Gelman, E Ramaswamy, S
Citation: D. Klabjan et al., Solving large airline crew scheduling problems: Random pairing generation and strong branching, COMPUT OP A, 20(1), 2001, pp. 73-91
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Authors: Glockner, GD Nemhauser, GL Tovey, CA
Citation: Gd. Glockner et al., Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results, COMPUT OP A, 18(3), 2001, pp. 233-250
Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
Authors: de Farias, IR Johnson, EL Nemhauser, GL
Citation: Ir. De Farias et al., Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables, KNOWL ENG R, 16(1), 2001, pp. 25-39
A family of inequalities for the generalized assignment polytope
Authors: de Farias, IR Nemhauser, GL
Citation: Ir. De Farias et Gl. Nemhauser, A family of inequalities for the generalized assignment polytope, OPER RES L, 29(2), 2001, pp. 49-55
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
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 parallel primal-dual simplex algorithm
Authors: Klabjan, D Johnson, EL Nemhauser, GL
Citation: D. Klabjan et al., A parallel primal-dual simplex algorithm, OPER RES L, 27(2), 2000, pp. 47-55
Airline crew recovery
Authors: Lettovsky, L Johnson, EL Nemhauser, GL
Citation: L. Lettovsky et al., Airline crew recovery, TRANSP SCI, 34(4), 2000, pp. 337-348
A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure
Authors: Glockner, GD Nemhauser, GL
Citation: Gd. Glockner et Gl. Nemhauser, A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure, OPERAT RES, 48(2), 2000, pp. 233-242
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
A generalized assignment problem with special ordered sets: a polyhedral approach
Authors: de Farias, IR Johnson, EL Nemhauser, GL
Citation: Ir. De Farias et al., A generalized assignment problem with special ordered sets: a polyhedral approach, MATH PROGR, 89(1), 2000, pp. 187-203
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
Price-directed control of remnant inventory systems
Authors: Adelman, D Nemhauser, GL
Citation: D. Adelman et Gl. Nemhauser, Price-directed control of remnant inventory systems, OPERAT RES, 47(6), 1999, pp. 889-898
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
The complexity of cover inequality separation
Authors: Klabjan, D Nemhauser, GL Tovey, C
Citation: D. Klabjan et al., The complexity of cover inequality separation, OPER RES L, 23(1-2), 1998, pp. 35-40
Risultati: 1-16 |