A Time-Indexed Formulation for Single-Machine Scheduling Problems: Branch-and Cut.

In Van den Akker, Van Hoesel, and Savelsbergh (1994), we have studied a time-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand side 1 and 2 for the convex hull of the monotone extension of the set of feasible schedules. In this paper, we discuss the development of a branch-and-cut algorithm based on these facet inducing inequalities.

MoreLess

Year of publication:	1996
Authors:	Van Den Akker, J. ; Hurkens, C.A.J. ; Savelsbergh, M.W.P.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	ECONOMETRICS \| MATHEMATICS

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

More details

Series:	Papers.
Type of publication:	Book / Working Paper
Notes:	31 pages
Classification:	C00 - Mathematical and Quantitative Methods. General ; C10 - Econometric and Statistical Methods: General. General ; C60 - Mathematical Methods and Programming. General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005669295