Abstract
General integer programming (IP) applications and solutions are briefly reviewed in this chapter. Section 4.1 outlines general formulation techniques for IP. Section 4.2 discusses state of the art solutions of general IP problems including classical enumerative and heuristic approaches (ie. simulated annealing). Recent successes in polyhedral approaches to solving partially structured IPs are outlined in section 4.3. Finally the definition and partial structure of the node packing problem (the focus of architectural synthesis) is given in section 4.4. (The notation for a graph is G=(V,E), where V is the set of vertices and E is the set of edges).
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
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gebotys, C.H., Elmasry, M.I. (1992). Introduction to Integer Programming. In: Optimal VLSI Architectural Synthesis. The Kluwer International Series in Engineering and Computer Science, vol 158. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4018-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4018-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6797-0
Online ISBN: 978-1-4615-4018-2
eBook Packages: Springer Book Archive