Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Logical Processing for Integer Programming

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper reviews tools which have great potential for reducing the difficulty of solving IP (and also MIP) problems, if well implemented in solvers. Recent experiments with Branch and Bound solvers, in connection with “Short Start Features”, have shown that implementations need and can still be improved. Concepts which are likely to be specially important for (0,1) MIP are pointed out.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  • Anbil, R., E. Gelman, B. Patty, and R. Tanga. (1991). “Recent Advances in Crew-Pairing Optimization at American Airlines.” Interfaces 21(1), 62–74.

    Google Scholar 

  • Anbil, R., R. Tanga, and E.L. Johnson. (1992). “A Global Approach to Crew Pairing Optimization.” IBM Systems Journal 31, 71–78.

    Article  Google Scholar 

  • Atamturk, A. and M. Savelsbergh. (2003). “Computational Evidence of Progress in Integer Programming.” Annals of Operations Research 2005 (this volume).

  • Balas, E. (1965). “An Additive Algorithm for Solving Linear Programs with Zero-One Variables.” Op. Res. 13, 517–546.

    Article  Google Scholar 

  • Balinski, M. (1961). “Fixed cost transportation problems.” Naval Research Logistics Quarterly 8, 41–54.

    Google Scholar 

  • Balinski, M. (1965). “Integer Programming: Methods, Uses, Computation.” Management Science 14, 253–313.

    Google Scholar 

  • Benders, J.F. (1962). “Partitioning Procedures for Solving Mixed Variable Programming Problems.” Numerische Mathematik 4, 238–252.

    Article  Google Scholar 

  • Bixby, R., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2000). “MIP: Theory and Practice—Closing the Gap.” In M.J.D. Powell and S. Scholtes (eds.), System Modeling and Optimization: Methods, Theory and Applications, Kluwer.

  • Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). “On the Uncapacitated Location Problem.” Annals of Discrete Mathematics 1, 163–177.

    Article  Google Scholar 

  • Crowder, H., E. Johnson, and M. Padberg. (1983). “Solving Large Scale Zero-One Linear Programming Problems.” Op. Res. 31, 903–834.

    Article  Google Scholar 

  • Desrosiers, J., F. Soumis, and M. Desrochers. (1984). “Routing with Time-Windows.” Network 14(4), 545–565.

    Article  Google Scholar 

  • Dietrich, B. and L. Escudero. (1992). “On Tightening Cover Induced Inequalities.” Eur. J. of OR 60.

  • Escudero, L., S. Martello, and P. Toth. (1994). “A Framework for Tightening 0-1 Programs based on Extensions of Pure 0-1 KP and SS Problems.” IPCO-4.

  • Fischetti, M. and A. Lodi. (2003). “Local Branching.” Mathematical Programming, Series B 98, 23–47.

  • Fisher, M.L., G.L. Nemhauser, and L.A. Wolsey. (1978). “Analysis of Approximation Algorithms for Maximizing a Submodular Set Function II.” Math. Programming Study 8, 73–87.

    Google Scholar 

  • Forrest, J. (1999). “Mixed Integer Programming in OSL,” INFORMS Meeting, Philadelphia.

  • Glover, F. (1965). “A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem.” Op. Res. 13, 879–919.

    Google Scholar 

  • Glover, F. (1971). “Flows in Arborescences.” Management Sc., 17.

  • Glover, F. (1971). “A Note on Extreme Point Solutions and a Paper by Lemke, Salkin, Spielberg.” Op. Res. 19, 1023–1025.

    Google Scholar 

  • Gomory, R.E. (1958). “Outline of an Algorithm for Integer Solutions to Linear Programs.” Bulletin of the Am. Math. Soc. 64, 275–278.

    Article  Google Scholar 

  • Granot, F. and P. Hammer. (1972). “On the Use of Boolean Functions in (0-1) Programming.” Methods of OR, 12, Verlag Hain, 184.

  • Granot, F. and P. Hammer. (1974). “On the Role of Generalized Covering Problems.” Cahiers du Centre d'Etude de Recherche Operationelle 16, 277–289.

    Google Scholar 

  • Guignard, M. and K. Spielberg. (1969). “Search Techniques with Adaptive Features for certain Mixed Integer Programming Problems.” Proceedings of 1968 IFIPS Congress, North Holland.

  • Guignard, M. (1973a). “Preferred Shadow Prices in 0-1 Programming,” Wharton School Report; also presented at the International Symposium on Mathematical Programming, Stanford University, 1973.

  • Guignard, M. (1973b). “Preferred Variables and Improved Penalties in 0-1 Programming.” Wharton School Report, 1973, revised 1975 and 1976.

  • Guignard, M., E.L. Johnson, and K. Spielberg. (2005). “Logical Processing for MIP,” Georgia Institute of Technology Report, pp. 1–38, to be published later.

  • Guignard, M. and M. Liberatore. (1992). “Applying a Modified Coefficient Reduction Method to a Dynamic Production Scheduling Problem.” European Journal of Operational Research 56(1), 119–130.

    Article  Google Scholar 

  • Guignard, M., C. Ryu, and K. Spielberg. (1998). “Model Tightening for Integrated Timber Harvest and Transportation Planning.” European J. of Operational Research 111, 448–460.

    Article  Google Scholar 

  • Guignard, M. and K. Spielberg. (1969). “Search Techniques with Adaptive Features for certain Mixed Integer Programming Problems.” Proceedings of 1968 IFIPS Congress, North Holland.

  • Guignard, M. and K. Spielberg. (1976). “An Experimental Interactive System for Integer Programming,” Proceedings, NBS, Bicentennial Conference on MP, Gaithersburg, MD.

  • Guignard, M. and K. Spielberg. (1977). “Propagation, Penalty Improvement and Logical Inequalities.” Methods of OR (Verlag Hain) 25, 157–171.

  • Guignard, M. and K. Spielberg. (1981). “Logical Reduction Methods in Zero-One Programming (Minimal Preferred Variables).” Op. Res. 29, 49–74.

    Article  Google Scholar 

  • Guignard, M. and K. Spielberg. (2003). “Double Contraction, Double Probing, Short Starts, BB Implications,” Working Paper, University of Pennsylvania, Wharton School, OPIM Department (presented at the ALIO/EURO Workshop, Pucon, Chile, 2002).

  • Guignard, M., K. Spielberg, and U. Suhl. (1977). “Survey of Enumeration Methods for Integer Programming.” Proc. SHARE 51, Boston, 2161–2170.

  • Guignard, M., G. Plateau, and K. Spielberg. (1999). “Logical Processing for MIP; a Review and New Extensions.” Rapport, LIPN; University of Paris 13.

  • Hammer, P. and P. Hansen. (1981). “Logical Relations in Quadratic 0-1 Programming.” Rev. Roum. Math. Pures et Appl. 26, 421–429.

    Google Scholar 

  • Hoffman, K. and M. Padberg. (1991). “Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut.” ORSA J. of Comp. 3.

  • Johnson, E.L. and B. Gopalakrishnan. (2003). “Airline Crew Scheduling; the State-of-the-Art.” Annals of Operations Research 2005 (this volume).

  • Johnson, E.L. and K. Spielberg. (1971). “Inequalities in Branch and Bound Programming.” IBM Research Report RC 3649, Yorktown Heights, NY.

  • Johnson, E.L. and K. Spielberg. (2003). “Logical Processing for IP and MIP,” Georgia Institute of Technology Report, pp. 1–96.

  • Johnson, E.L., M. Kostreva, and U. Suhl. (1985). “Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models.” Op. Res. 33, 803–819.

    Google Scholar 

  • Land, A.H. and A.G. Doig. (1960). “An Automatic Method for Solving Discrete Programming Problems.” Econometrics 28, 497–520.

    Google Scholar 

  • Lemke, C. and K. Spielberg. (1967). “Direct Search Algorithms for Zero-One and Mixed Integer Programming.” Op. Res. 15, 892–914.

    Google Scholar 

  • Lemke, C., H. Salkin, and K. Spielberg. (1971). “Set Covering by Single Branch Enumeration with Linear Programming Subproblems.” OR 19, 998–1022; (1969; NY Sc. C. Rep.).

    Google Scholar 

  • Lougee-Heimer, R. (2001). “A Note on Coefficient Adjustment Using SOS Constraints.” Op. Res. 49, 175–177.

    Article  Google Scholar 

  • Lougee-Heimer, R. and W.P. Adams. (2003). “A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs.” Annals of Operations Research 2005 (this volume).

  • Mairs, T., G. Wakefield, E. Johnson, and K. Spielberg. (1978). “On a Production Allocation and Distribution Problem.” Management Science 24, 1622–1630.

    Article  Google Scholar 

  • Nemhauser, G.L. and L.A. Wolsey. (1987). “Integer and Combinatorial Optimization,” John Wiley & Sons, New York, N.Y.

    Google Scholar 

  • Nemhauser, G. L., L.A. Wolsey, and M.L. Fisher. (1978). “An Analysis of Approximations for Maximizing Submodular Set Functions-I.” Math. Programming 14, 265–294.

    Article  Google Scholar 

  • Rubin, J. (1971). “Airline Crew Scheduling-the Non-Mathematical Problem,” IBM NY SC. CTR. Rep. 320–3006.

  • Rubin, J. (1973a). “A Technique for the Solution of Massive Set Covering Problems, with Applications to Airline Crew Scheduling.” Transportation Science 7, 34–48, (NY Sc. C. Rep. 1971).

    Google Scholar 

  • Rubin, J. (1973b). “Scheduling of Airline Crews for Aircraft Schedules with Frequency Exceptions.” IBM Cambridge SC. Ctr. Rep.

  • Savelsbergh, M. (1994). “Preprocessing and Probing Techniques for Mixed Integer Programming Problems.” ORSA J. of Comp. 6.

  • Spielberg, K. (1969). “Algorithms for the Simple Plant Location Problem with Some Side Conditions.” Op. Res. 17, 85–111.

    Google Scholar 

  • Spielberg, K. and M. Guignard. (1999). A Sequential (Pseudo) Hot Start Method for BB (0,1) Mixed Integer Programming, Univ. of Pennsylvania, Wharton School, OPIM Dept. Rep. #99-12-06, augmented by working papers 2000,01,02,03.

  • Spielberg, K. and U. Suhl. (1980). “An Experimental Enumeration Software System for Integer Programming,” IBM Research Report RC8219, Yorktown Heights, NY.

  • Williams, H.P. (1974). “Experiments in the Formulation of Integer Programming Problems.” Math. Progr. Study 2, 180–197.

    Google Scholar 

  • Williams, H.P. (1978). “Model Building in Mathematical Programming,” Wiley.

  • Zionts, S. (1972). “Implicit Enumeration in Integer Programming,” Naval Logistics Quarterly 1, 165–182.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. OPIM Department, the Wharton School, University of Pennsylvania, 3730 Walnut St., Philadelphia, PA, 19104, USA

    Monique Guignard & Kurt Spielberg

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA, 30322, USA

    Ellis L. Johnson

Authors
  1. Monique Guignard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ellis L. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kurt Spielberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Monique Guignard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guignard, M., Johnson, E.L. & Spielberg, K. Logical Processing for Integer Programming. Ann Oper Res 140, 263–304 (2005). https://doi.org/10.1007/s10479-005-3974-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-3974-4

Keywords

Search

Navigation