Skip to main content
SpringerLink
Log in

A class of polynomially solvable 0–1 programming problems and an application

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

It is well known that general 0–1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0–1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0–1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bilitzky A, Sadeh A. Efficient solutions for special zero-one programming problems. J Combin Optim, 2005, 10: 227–238

    Article  MathSciNet  MATH  Google Scholar 

  2. Fao A, Mauricio G C, Resende A. A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett, 1989, 8: 67–71

    Article  MathSciNet  Google Scholar 

  3. Huang W C, Kao C Y, Hong J T. A genetic algorithm for set covering problems. IEEE Int Conf Genet Algor, 1994: 569–574

  4. Nemhauser G L, Wolsey L A. Interger and Combinatorial Optimization. New York: John Wiley and Sons, 1988

    Google Scholar 

  5. Padberg M W. Perfect zero-one matrices. Math Program, 1974, 6: 180–196

    Article  MathSciNet  MATH  Google Scholar 

  6. Padberg M W. Lehman’s forbidden minor characterization of ideal 0–1 matrices. Discrete Math, 1993, 111: 409–420

    Article  MathSciNet  MATH  Google Scholar 

  7. Wolsey L A. Integer Programming. Intersince Series in Discrete Mathematics and Optimization. New York: John Wiley and Sons, 1998

    Google Scholar 

  8. Xie J, Zhou D, Wei J C, et al. Price discount based on early order commitment in a single manufacturer-multiple retailer supply chain. European J Oper Res, 2010, 200: 368–376

    Article  MATH  Google Scholar 

  9. Xiong H, Xie J, Wang M. A note on “Price discount based on early order commitment in a single-manufacturer-multiple-retailer supply chain”. European J Oper Res, to appear

  10. Zhao X, Xie J, Wei J C. The impact of forecast errors on early order commitment in a supply chain. Decis Sci, 2002, 33: 251–280

    Article  Google Scholar 

  11. Zhao X, Xie J, Wei J C. The value of early order commitment in a two-level supply chain. European J Oper Res, 2007, 180: 194–214

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China

    Miao Wang, JinXing Xie & HuaChun Xiong

Authors
  1. Miao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. JinXing Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. HuaChun Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to JinXing Xie.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, M., Xie, J. & Xiong, H. A class of polynomially solvable 0–1 programming problems and an application. Sci. China Math. 54, 623–632 (2011). https://doi.org/10.1007/s11425-010-4112-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-010-4112-6

Keywords

MSC(2000)

Search

Navigation