Skip to main content
SpringerLink
Log in

Efficient Solutions for Special Zero-One Programming Problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A zero-one linear programming is under consideration. It has been proved that for special structures and values of the parameters, the solution of the linear relaxation of the problem is integral and can be either predetermined or computed efficiently. In general, a tight upper bound is provided in order to establish an efficient procedure for solving the problem. The results may have practical implementations in knowledge—management, data-mining, network flow, graph theory, reliability and statistical studies.

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

  • E. Balas and M.W. Padberg, “Set partitioning: A survey,” SIAM Review, vol. 18, pp. 710–760, 1996.

    MathSciNet  Google Scholar 

  • K.L. Brown and H.I. Mesak, “Scheduling professionals in the retail pharmacy chain,” Omega-International Journal of Management Science, vol. 20, nos. 5/6, pp. 671–678, 1992.

    ISI  Google Scholar 

  • B.J. Coleman and M.A. Mcknw, “A quick and effective method for capacitated lot-sizing with startup and reservation costs,” Computers & Operations Research, vol. 22, no. 6, pp. 641–653, 1995.

    Article  ISI  Google Scholar 

  • M. Dimopoulou and P. Miliotis, “Implementation of a university course and examination timetabling system,” European Journal of Operational Research, vol. 130, no. 8, pp. 202–213, 2001.

    ISI  Google Scholar 

  • A. Fao, G.C. Mauricio, and A. Resende, “A probabilistic heuristic for a computationally difficult set covering problem,” Operations Research Letters, no. 8, pp. 67–71 1989.

  • W.C. Huang, C.Y. Kao, and J.T. Hong, “A genetic algorithm for set covering problems,” IEEE International Conference on Genetic Algorithms: Proceedings, pp. 569–574, 1994.

  • E.L. Johnson, G.L. Nemhauser, and M.W.P. Savelsbergh, Informs Journal on Computing, vol. 12, no. 1, pp. 2–23, 2000.

    Article  ISI  MathSciNet  Google Scholar 

  • H.H. Millar and M. Kiragu, “A time-based formulation and upper bounding scheme for the selective travelling salesperson problem,” Journal of the Operational Research Society, vol. 48, no. 5, pp. 511–518, 1997.

    Article  ISI  Google Scholar 

  • G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorian Optimization, John Wiley and Sons, NY, 1988.

    Google Scholar 

  • O. Oguz, “Data dependent worst case bound improving techniques in zero-one programming,” European Journal of Operational Research, vol. 51, no. 3, pp. 400–404, 1991.

    Article  MATH  ISI  Google Scholar 

  • M.W. Padberg, “Perfect zero-one matrices,” Mathematical Programming, no. 6, pp. 180–196, 1974.

  • M.W. Padberg, “Lehman's forbidden minor characterization of ideal 0–1 matrices,” Discrete Mathematics, no. 111, pp. 409–410, 1993.

  • S. Rajagopalan, “A note on an efficient zero-one formulation of the multilevel lot-sizing problem,” Decision Sciences, vol. 23, no. 4, pp. 1023–1025, 1992.

    ISI  MathSciNet  Google Scholar 

  • S. Vanhoesel, A. Wagelmans, and A. Kolen, “A dual algorithm for economic lot-sizing problem,” European Journal of Operational Research, vol. 52, no. 3, pp. 315–325, 1991.

    Article  ISI  Google Scholar 

  • L.A. Wolsey, Integer Programming, Intersince Series in Discrete Mathematics and Optimization, John Wile and Sons, NY, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, College of Management, 7 Yitzhak Rabin Blvd., Rishon Lezion, Israel

    Ariela Bilitzky

  2. Department of Management of Technology, Holon Academic Institute of Technology, 52 Golomb St., Holon, 58102, Israel

    Arik Sadeh

Authors
  1. Ariela Bilitzky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arik Sadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arik Sadeh.

Additional information

Seniority is equally shared. A visiting faculty in School of Management at Ben-Gurion University of the Negev, Israel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bilitzky, A., Sadeh, A. Efficient Solutions for Special Zero-One Programming Problems. J Comb Optim 10, 227–238 (2005). https://doi.org/10.1007/s10878-005-4104-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-4104-6

Keywords

Search

Navigation