×

zbMATH — the first resource for mathematics

Sur l’utilisation de troncatures de Gomory dans les algorithmes enumeratifs. (French) Zbl 0274.90029
MSC:
90C10 Integer programming
PDF BibTeX XML Cite
Full Text: DOI EuDML
References:
[1] Communication orale de Mlle Guignard de la Faculté des Sciences de Lille à la journée du groupe combinatoire de l’A.F.C.E.T. (1-12-71) sur l’utilisation des < Minimal valid inaqualities> de Gomory-Johnson dans des schémas énumératifs.
[2] GOMORY-JOHNSON, IBM Research Report FC 3311 Feb. 71 : Some continuous functions related to corner Polyhedra.
[3] M. L. BALINSKI, Integer Programming : uses, methods, computation. Management Science, vol. 12, n^\circ 13, November 1965. Zbl0129.12004 MR192924 · Zbl 0129.12004 · doi:10.1287/mnsc.12.3.253
[4] An algorithm for integer solutions to Linear Programs, Princeton-IBM Researc Center, Report RC 189, January 29, 1960.
[5] R. E. GOMORY, An algorithm for mixed Integer Problem, RM 2597, Rand Corporation, July 7, 1960.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.