Skip to main content

Branch-and-Price Decomposition for Assignment and Location Problems

  • Chapter
Demand Flexibility in Supply Chain Planning

Part of the book series: SpringerBriefs in Optimization ((BRIEFSOPTI))

  • 1572 Accesses

Abstract

This chapter addresses a number of models with an assignment-based structure that require allocating a set of demands to a set of resources. While we have already considered several types of assignment problem in previous chapters, each of these previous models assumed that a specific assignment cost could be specified a priori, which depends only on the particular demand and the resource to which it is assigned. In contrast, for the models considered in this chapter, the costs associated with a resource will sometimes depend on the collective set of demands assigned to the resource. The primary approach applied for solving these problems will be a branch-and-price decomposition method. Of particular interest in applying this approach are the so-called pricing problems that arise in the decomposition. As we will see, these pricing problems will be consistent with several of the models defined and analyzed in previous chapters.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Balakrishnan A, Geunes J (2003) Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing. Operations Research 51(1):94–112

    Article  MATH  Google Scholar 

  2. Huang W, Geunes J, Romeijn H (2005) The Continuous-Time Single-Sourcing Problem with Capacity Expansion Opportunities. Naval Research Logistics 52(3):193–211

    Article  MathSciNet  MATH  Google Scholar 

  3. Rainwater C, Geunes J, Romeijn H (2008) Capacitated Facility Location with Single-Source Constraints and Flexible Demand. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida

    Google Scholar 

  4. Taaffe K, Geunes J, Romeijn H (2010) Supply Capacity Acquisition and Allocation with Uncertain Customer Demands. European Journal of Operational Research 204:263–273

    Article  MATH  Google Scholar 

  5. Savelsbergh M (1997) A Branch-And-Price Algorithm for the Generalized Assignment Problem. Operations Research 45(6):831–841

    Article  MathSciNet  MATH  Google Scholar 

  6. Sharkey T, Geunes J, Romeijn H, Shen Z (2011) Exact Algorithms for Integrated Facility Location and Production Planning Problems. Naval Research Logistics 58(5):419–436

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Joseph Geunes

About this chapter

Cite this chapter

Geunes, J. (2012). Branch-and-Price Decomposition for Assignment and Location Problems. In: Demand Flexibility in Supply Chain Planning. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9347-2_8

Download citation

Publish with us

Policies and ethics