Additional Constraints in the Group Theoretical Approach to Integer Programming

  • V. Ferrari
  • S. Giulianelli
  • M. Lucertini
Part of the International Centre for Mechanical Sciences book series (CISM, volume 266)


One of the most promising ways to obtain more efficient algorithms in integer programming is based on the determination of equivalent integer programming problems with a lower computational complexity.

In this paper we are concerned with equivalent problems obtained via a group theoretic approach and via the introduction of additional constraints. The procedure proposed consists in a manipulation of the ILP problem by adding a new unbinding constraint, in order to obtain a new problem and a new dual feasible basis such that the associated group pro blem has a computational complexity lower than the group pro blem associated to the original ILP problem.


Integer Programming Additional Constraint Linear Programming Problem Geometrical Form Integrity Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R.S. GARFINKEL, G.L. NEMHAUSER: Integer programming. John Wiley and Sons, 1972.Google Scholar
  2. [2]
    S. ZIONTS: Linear and integer programming. Prentice-Hall Inc., 1974.Google Scholar
  3. [3]
    T.C. HU, S.M. ROBINSON: Mathematical programming. Academic Press, 1973.Google Scholar
  4. [4]
    D.E. BELL: Improved Bounds for Integer Programs: A Supergroup Approach. Research Memorande of IIASA, November 1973.MATHGoogle Scholar
  5. [5]
    A.M. GEOFFRION: Lagrangian Relaxation for Integer Programming. Mathematical Programming Study 2, 1974.Google Scholar
  6. [6]
    M.P. WILLIAMS: Experiments in the Formulation of Integer Programming Problems. Mathematical Programming Study 2, 1974.Google Scholar
  7. [7]
    E.M.L. BEALE, J.A. TOMLIN: An integer programming approach to a class of combinatorial problems. Mathematical Programming 3, 1972.Google Scholar
  8. [8]
    G.T. ROSS, R.M. SOLAND: A branch and bound algorithm for the generalized assignment problem. Mathematical Programming 8, 1975.Google Scholar
  9. [9]
    R.C. JENSLOW: The principles of cutting-plane theory Graduate School of Industrial Administration. Carnegie-Mellon University (Part I, Feb. 1974; Part I I, Aug. 1975 ).Google Scholar
  10. [10]
    S. GIULIANELLI, M. LUCERTINI: A decomposition technique in integer linear programming. 7th IFIP Conference, Nice, Sept. 1975.Google Scholar
  11. [11]
    S. GIULIANELLI, M. LUCERTINI: A group decomposition technique in Zarge integer programming problems. IFAC Symposium on Large Scale Systems, Udine, June 1976.Google Scholar
  12. [12]
    L.A. WOLSEY: Extensions of the group theoretic approach in integer programming. Management Science, Sept. 1971.Google Scholar
  13. [13]
    G.A. GORRY, J.F. SHAPIRO, L.A. WOLSEY: Relaxation methods for pure and mixed integer programming problems. Management Science, Jan. 1972.Google Scholar
  14. [14]
    S. MACLANE, G. BIRKHOFF: Algebra. The MacMillan Company, 1967.Google Scholar
  15. [15]
    H.M. SALKIN: Integer programming. Adisson Wesley, 1975.Google Scholar
  16. [16]
    S. GIULIANELLI, M. LUCERTINI: A method for reducing computational complexity of ILPC problems. Ricerche di Automatica, Dec. 1977.Google Scholar
  17. [17]
    F. NIVEN, H.Z. ZUCKERMAN: An introduction to the theory of numbers. Wisley, 1972.Google Scholar
  18. [18]
    E. POLAK: Computational methods in Optimization. Academic Press, 1971.Google Scholar

Copyright information

© Springer-Verlag Wien 1981

Authors and Affiliations

  • V. Ferrari
    • 1
  • S. Giulianelli
    • 1
  • M. Lucertini
    • 1
  1. 1.Sistemi di Controllo e Calcolo Automatici del C. N.R. Via EudossianaIstituto di Automatica e Centro di StudioRomaItaly

Personalised recommendations