Abstract
In the literature (see, e.g. Bertsimas and Tsitsiklis [1994], Chvátal [1983] and Garfinkel and Nemhauser [1972]), a number of different approaches for dealing with mixed-integer linear programs (MILP) are discussed. Branch and bound, cutting plane and local search algorithms are among these.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Tönshoff, N. (1997). Implementation and Computational Results. In: Modular Machine Tools. Deutscher Universitätsverlag, Wiesbaden. https://doi.org/10.1007/978-3-663-08773-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-663-08773-1_12
Publisher Name: Deutscher Universitätsverlag, Wiesbaden
Print ISBN: 978-3-8244-6477-7
Online ISBN: 978-3-663-08773-1
eBook Packages: Springer Book Archive