Skip to main content
SpringerLink
Log in

Generating Set Partitioning Test Problems with Known Optimal Integer Solutions

  • Conference paper
The Next Wave in Computing, Optimization, and Decision Technologies

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 29))

Abstract

In this work, we investigate methods for generating set partitioning test problems with known integer solutions. The problems are generated with various cost structures so that their solution by well-known integer programming methods can be shown to be difficult. Computational results are obtained using the branch and bound methods of the CPLEX solver. Possible extensions are considered to the area of cardinality probing of the solutions

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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.

6. References

  • Arabeyre, J., Fearnley, J., Steiger, F., and Teather, W., 1969, The airline crew scheduling problem: a survey, Transportation Science 3: 140–163.

    Google Scholar 

  • Baker, E.K., Bodin, L.D., Finnegan, W.F. and Ponder, R.J., 1979, Efficient heuristic solutions to an airline crew scheduling problem, AIIE Trans. 11: 79–85.

    Google Scholar 

  • Balinski, M. and Quandt, R., 1964, On an integer program for a delivery problem, Operations Research 12: 300–304.

    Google Scholar 

  • Beasley, J.E., 1990, OR-Library: Distributing test problems by electronic mail, Journal of the Operational Research Society 41: 1069–1072.

    Article  Google Scholar 

  • Benichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribiere, G. and Vincent, O., 1971, Experiments in mixed-integer linear programming, Math. Prog. 1: 76–94.

    Article  MATH  MathSciNet  Google Scholar 

  • Bixby, R., Boyd, A., Dadmehr, S., and Indovina, R., 1996, The MIPLIB mixed integer programming library, Mathematical Programming Society Committee on Algorithms, Bulletin 22: 2–5.

    Google Scholar 

  • Bixby, R.E., Fenelon, M., Zonghao, G., Rotheberg, E., and Wunderling, R., 1999, MIP: Theory and practice-closing the gap, System Modeling and Optimization Methods, Theory and Applications, M.J.D Powell and S. Scholtes, eds., Kluwer, The Netherlands.

    Google Scholar 

  • Crainic, T.G. and Rousseau, J.M., 1987, The column generation principle and the airline crew scheduling problem, INFOR 25:136–151.

    MATH  Google Scholar 

  • Floudas, C.A. and Pardalos, P.M., 1990, A collection of test problems for constrained optimization algorithms, Lecture Notes in Computer Science, No. 455. Springer-Verlag, Heidelberg, Germany.

    MATH  Google Scholar 

  • Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, S.T., Harding, Z.H., Klepeis, J.L., Meyer, C.A., and Schweiger C.A., 1999, Handbook of Test Problems in Local and Global Optimization, Nonconvex Optimization and Its Applications. Kluwer, Dordrecht, The Netherlands.

    Google Scholar 

  • Forrest, J.J.H., Hirst J.P.H. and Tomlin, J.A., 1974, Practical solution of large scale mixed integer programming problems with UMPIRE, Management Science 20: 736–773.

    MATH  MathSciNet  Google Scholar 

  • Garfinkel, R.S. and Nemhauser, G.L., 1969, The set-partitioning problem: set covering with equality constraints, Ops. Res. 17: 848–856.

    MATH  Google Scholar 

  • Garfinkel, R.S. and Nemhauser, G.L., 1970, Optimal political districting by implicit enumeration techniques, Management Science 14: B495–B508.

    Google Scholar 

  • Garfinkel, R.S. and Nemhauser, G.L., 1972, Integer Programming. J. Wiley and Sons. New York.

    MATH  Google Scholar 

  • Gay, D.M. 1985. Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter.

    Google Scholar 

  • Hillier, F., 1969, Efficient heuristic procedures for integer linear programming with an interior, Operations Research 17: 600–637.

    MATH  MathSciNet  Google Scholar 

  • Hoffman, K.L. and Padberg, M., 1993, Solving airline crew scheduling problems by branch-and-cut, Management Science 39: 657–682.

    MATH  Google Scholar 

  • Joseph, A., 1995, A parametric formulation of the general integer linear programming problem, Computers and Operations Research 22: 883–892.

    Article  MATH  MathSciNet  Google Scholar 

  • Joseph, A., Gass, S. I., and Bryson, N., 1998, An objective hyperplane search procedure for solving the general integer linear programming problem, European Journal of Operational Research 104: 601–614.

    Article  MATH  Google Scholar 

  • Joseph, A., 2003, Cardinality corrections for set partitioning, Research Report, Mgt. Science Department. Univ. of Miami, Coral Gables, Florida.

    Google Scholar 

  • Land, H. and Doig, A.G., 1960, An automatic method for solving discrete programming problems, Econometrica 28: 497–520.

    Article  MATH  MathSciNet  Google Scholar 

  • Linderoth, J.T. and Savelsbergh, M.W.P., 1999, A computational study of search strategies for mixed integer programming, INFORMS Journal on Computing 11: 173–187

    MATH  MathSciNet  Google Scholar 

  • Marsten, R.E., 1974, An algorithm for large set partitioning problems, Management Science 20: 774–787.

    MATH  MathSciNet  Google Scholar 

  • Marsten, R.E. and Shepherdson, F., 1981, Exact solution of crew scheduling problems using the set partitioning model: recent successful applications, Networks 11: 165–177.

    Google Scholar 

  • Mitra, G., 1973, Investigation of some branch and bound strategies for the solution of mixed integer linear programs, Math. Prog. 4: 155–170.

    Article  MATH  Google Scholar 

  • Mingozzi, A., Boschetti, M.A., Ricciarde S., and Bianco, L., 1999, A set partitioning approach to the crew scheduling problem, Operations Research 47: 873–888.

    MATH  Google Scholar 

  • Mehrotra, A., Nemhauser, G.L. and Johnson, E., 1998, An Optimization-Based Heuristic for Political Districting, Mgt. Sci. 44: 1100–1114.

    MATH  Google Scholar 

  • Mulvey, J. M. (ed.) 1982. Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems 199, Springer-Verlag, Berlin.

    MATH  Google Scholar 

  • Padberg, M. and Balas, E., 1972, On the set-covering problem, Operations Research 20: 1152–1161.

    Article  MATH  MathSciNet  Google Scholar 

  • Savelsbergh, M.W.P., 1994, Preprocessing and probing for mixed-integer models. Computational Optimization and Applications 3: 317–331.

    Article  MathSciNet  Google Scholar 

  • Thiriez, H., 1969, Airline crew scheduling: a group theoretic approach, MIT Department of Aeronautics and Astronautics Report R69-1. Cambridge, MA.

    Google Scholar 

  • Yildiz, H., 2004, A large neighborhood search heuristic for graph coloring, Working Paper, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science, University of Miami, Coral Gables, Florida, 33124

    Edward K. Baker & Anito Joseph

  2. Department of Mathematics, Southern Illinois University, Edwardsville, Illinois, 62026

    Brenda Rayco

Authors
  1. Edward K. Baker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anito Joseph
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Brenda Rayco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Maryland, USA

    Bruce Golden  & S. Raghavan  & 

  2. American University, USA

    Edward Wasil

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Baker, E.K., Joseph, A., Rayco, B. (2005). Generating Set Partitioning Test Problems with Known Optimal Integer Solutions. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Next Wave in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol 29. Springer, Boston, MA . https://doi.org/10.1007/0-387-23529-9_3

Download citation

  • DOI: https://doi.org/10.1007/0-387-23529-9_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-23528-8

  • Online ISBN: 978-0-387-23529-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation