Skip to main content

Equivalent Formulations for Integer Programs

  • Chapter
Integer Programming

Part of the book series: Mathematics and Its Applications ((MAEE,volume 46))

  • 587 Accesses

Abstract

In the first part of this chapter (Sections 6.1-6.3), we consider a method for constructing equivalent formulations for a following large integer programming problem

$$ \upsilon \left( P \right) = \max \left\{ {cx|Ax \leqslant b,x \in {{{\left\{ {0,1} \right\}}}^{n}}} \right\}. $$

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 32.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Walukiewicz, S. (1991). Equivalent Formulations for Integer Programs. In: Integer Programming. Mathematics and Its Applications, vol 46. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7945-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-7945-2_6

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4068-8

  • Online ISBN: 978-94-015-7945-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics