Towards a closer integration of finite domain propagation and simplex-based algorithms

Annals of Operations Research

Volumn 81, Issue , 1998, Pages 421-431

  Hajian, Mozafar T ^a   El Sakkout, Hani ^a   Wallace, Mark ^a   Lever, Jonathan M ^a   Richards, Barry ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Branch and bound; Combinatorial optimisation; Constraint satisfaction; Finite domain propagation; Integer programming; Simplex method

Indexed keywords

EID: 0032372157     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. R.J. Dakin, A tree search algorithm for mixed integer programming problems, The Computer Journal 8((1965)250-255
2. E. Davis, Constraint propagation with interval labels, Artificial Intelligence 32(1987)281-331
3. H. El-Sakkout, Modelling fleet assignment in a flexible environment, Proceedings of the 2nd International Conference on the Practical Application of Constraint Technology, The Practical Application Company Ltd, 1996, pp. 27-39.
4. E.F.D. Ellison et al., FortMP, User Guide and Reference Manual, Nag Ltd, Oxford, UK, 1995.
5. H. Gallaire, Logic programming: Further developments, in: IEEE Symposium on Logic Programming, Boston, MA, July 1985.
6. M.T. Hajian, Computational methods for discrete programming problems, Ph.D. Thesis, Mathematics and Statistics Department, Brunel, University of West London, 1992.
7. R.M. Haralick and G.L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14(1980)263-314.
8. J. Jaffar and J.-L. Lassez, Constraint Logic Programming, in: POPL-87, Munich, Germany, January 1987.
9. H.W. Kuhn and A.W. Tucker, Linear Inequalities and Related Systems, Princeton University Press, Princeton, NJ, 1956.
10. A. Land and A.W. Tucker, An automatic method for solving discrete programming problems, Econometrica 28(1960)497-520.
11. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8(1977)99-118.
12. G. Mitra, Theory and Application of Mathematical Programming, Academic Press, London, 1976.
13. U. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Science 7(1974)95-132.
14. G.L. Nemhauser and E.R. Wolsey, Integer and Combinatorial Optimisation, Wiley, New York, 1988.
15. G.J. Sussman and G.L. Steele, {CONSTRAINTS}: A language for expressing almost-hierarchical descriptions, Artificial Intelligence 14(1980)1-39.
16. M. Tamiz, Design implementation and testing of a general linear programming system exploiting sparsity, Ph.D. Thesis, Mathematics and Statistics Department, Brunel, University of West London, 1986.
17. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, 1989.