Skip to main content
SpringerLink
Log in

An extension of Hu's group minimization algorithm

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

In this work the Author extends Hu's algorithm to solve pure integer linear programming problems.

The extension is applied when the solution of the «relaxed asymptotic» problem is unfeasible for the original program. This extension provides a mean of solution in a good number of cases, when the application of the classical asymptotic algorithm fails.

Numerical examples are presented.

A criterion, which guarantees when the algorithm works, is also given.

Sommario

In questo lavoro si estende l'algoritmo di Hu per risolvere problemi di programmazione lineare totalmente a variabili itere.

L'estensione si applica nei casi in cui la soluzione del problema «asintotico rilassato» fornisce una soluzione inaccettabile per il problema originario.

In questo modo, un buon numero di casi, in cui l'algoritmo asintotico non giunge alla soluzione ottima, possono essere risolti. Viene anche indicato un criterio che assicura l'uso dell'algoritmo qui proposto.

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. S. Fanelli,Sull'uso dell'algoritmo asintotico in problemi applicativi di programmazione lineare a variabili intere, (Ricerca Operativa—to appear).

  2. G. Gallo—B. Simeone,Programmazione su un gruppo: un algoritmo branch and bound, (Atti delle Giornate AIRO, 1972, 85–97).

  3. R. S. Garfinkel—G. L. Nemhauser,Integer programming, (J. Wiley & Sons, 1972).

  4. R. E. Gomory,An algorithm for integer solutions to linear programs, (Recent advances in Mathematical Programming, Mc. Graw Hill, 1963, 269–302).

  5. R. E. Gomory,On the relation between integer and non-integer solutions to linear programs, (Proceedings of the National Academy of Sciences of the U.S.A., 53, 1965, 250–265).

  6. R. E. Gomory,Some polyhedra related to combinatorial problems, (Linear Algebra and its applications, 2, 1969, 451–558).

    Article  MATH  MathSciNet  Google Scholar 

  7. G. A. Gorry—J. F. Shapiro,An adaptive group theoretic algorithm for integer programming problems, (Management Science, 17, 1971, 285–306).

    MathSciNet  MATH  Google Scholar 

  8. G. A. Gorry—J. F. Shapiro—L. A. Wolsey,Relaxation methods for pure and mixed integer programming problems, (Management Science, 18, 1972, 229–239).

    MathSciNet  MATH  Google Scholar 

  9. G. A. Gorry—W. D. Northup—J. F. Shapiro,Computational experience with a group theoretic integer programming algorithm, (Mathematical Programming, 4, 1973, 171–192).

    Article  MATH  MathSciNet  Google Scholar 

  10. T. C. Hu,Integer programming and network flows, (Addison Wesley, 1969).

  11. T. C. Hu,On the asymptotic integer algorithm, (Linear Algebra and its applications, 3, 1970, 279–294).

    Article  MATH  Google Scholar 

  12. J. F. Shapiro,Dynamic programming algorithms for the integer programming problem —I: The integer programming problem viewed as a knapsack type problem, (Operations Research, 16, 1968, 103–121).

    MATH  MathSciNet  Google Scholar 

  13. J. F. Shapiro,Group theoretic algorithms for the integer programming problem—II: Extension to a general algorithm, (Operations Research, 16, 1968, 928–947).

    MATH  MathSciNet  Google Scholar 

  14. J. F. Shapiro,Turnpike theorems for integer programming problems, (Operations Research, 18, 1970, 432–440).

    MATH  MathSciNet  Google Scholar 

  15. J. F. Shapiro,Generalized Lagrange multipliers in integer programming, (Operations Research, 19, 1971, 68–76).

    MATH  MathSciNet  Google Scholar 

  16. L. A. Wolsey,Extensions to the group theoretic approach in integer programming, (Management Science, 18, 1971, 74–83).

    Article  MathSciNet  MATH  Google Scholar 

  17. S. Zionts,Linear and integer programming, (Prentice Hall—1974).

Download references

Author information

Authors and Affiliations

  1. Istituto Matematico dell'Università, Istituto di Calcolo delle Probabilità dell'Università di Roma, via Roma 33, L'Aquila

    S. Fanelli

Authors
  1. S. Fanelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Partially supported by G.N.A.F.A. of C.N.R.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fanelli, S. An extension of Hu's group minimization algorithm. Calcolo 15, 197–210 (1978). https://doi.org/10.1007/BF02576759

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02576759

Keywords

Search

Navigation