Abstract
Some scheduling problems can be solved efficiently by reducing them to well known combinatorial optimization problems like linear programs, maximum flow problems, or transportation problems. Others can be solved by using standard techniques like dynamic programming and branch and bound methods. In this chapter we will give a brief survey of these combinatorial optimization problems. We also will discuss some of the methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brucker, P. (1995). Some Problems in Combinatorial Optimization. In: Scheduling Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03088-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-03088-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03090-5
Online ISBN: 978-3-662-03088-2
eBook Packages: Springer Book Archive