Highly Influenced

# A Cutting Plane Algorithm

@inproceedings{Nemhauser2002ACP, title={A Cutting Plane Algorithm}, author={George L. Nemhauser and Martin W. P. Savelsbergh}, year={2002} }

- Published 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

#### From This Paper

##### Topics from this paper.

24 Citations

21 References

Similar Papers