Skip to main content

Branch and Price: Integer Programming with Column Generation

BP

  • Reference work entry

Article Outline

Keywords

Nonidentical Machines

Identical Machines

See also

References

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.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

Learn about institutional subscriptions

References

  1. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving integer programs. Oper Res 46:316–329

    MathSciNet  MATH  Google Scholar 

  2. Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Ball ME, Magnanti TL, Monma C, Nemhauser GL (eds) Network RoutingHandbook Oper Res and Management Sci. 8, Elsevier, Amsterdam, pp 35–140

    Google Scholar 

  3. Savelsbergh MWP (1997) A branch-and-price algorithm for the generalized assignment problem. Oper Res 6:831–841

    Article  MathSciNet  Google Scholar 

  4. Vanderbeck F, Wolsey LA (1996) An exact algorithm for IP column generation. Oper Res Lett 19:151–160

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Savelsbergh, M.W.P. (2008). Branch and Price: Integer Programming with Column Generation . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_58

Download citation

Publish with us

Policies and ethics