A Cutting Plane Algorithm

@inproceedings{Nemhauser2002ACP,
  title={A Cutting Plane Algorithm},
  author={George L. Nemhauser and Martin W. P. Savelsbergh},
  year={2002}
}
We propose a mixed integer programming formulation for the single machine scheduling problem with release times and the objective of minimizing the weighted sum of the start times The basic formulation involves start time and sequence determining variables and lower bounds on the start times Its linear programming relaxation solves problems in which all release times are equal For the general problem good lower bounds are obtained by adding additional valid inequalities that are violated by the… CONTINUE READING
24 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

The uncapacitated facility location problem Discrete Location Theory

  • G Cornuejols, G L Nemhauser, L A Wolsey
  • The uncapacitated facility location problem…
  • 1990
1 Excerpt

Formulating Single Machine Scheduling Problems with Precedence Constraints. CORE discussion paper 8924

  • L A Wolsey
  • Formulating Single Machine Scheduling Problems…
  • 1989
1 Excerpt

Time Indexed F ormulations of Non-Preemptive Single-Machine Scheduling Problems. CORE discussion paper 8904

  • G Sousa, L A Wolsey
  • Time Indexed F ormulations of Non-Preemptive…
  • 1989
1 Excerpt

Optimization of a 532-city symmetric traveling salesman problem

  • M Padberg, G Rinaldi
  • Oper. Res. Letters
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…