Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem

European Journal of Operational Research

Volumn 108, Issue 3, 1998, Pages 671-683

  Hansen, Pierre ^a   Jaumard, Brigitte ^b   Poggi De Aragão, Marcus ^c  

^a HEC MONTRÉAL   (Canada)

^b GERAD   (Canada)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Column generation; Linear programming; Maximum satisfiability; Mixed integer programming; Probabilistic satisfiability

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GRAMMARS; LINEAR PROGRAMMING; PROBABILITY; PROBLEM SOLVING;

COLUMN GENERATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; PROBABILISTIC MAXIMUM SATISFIABILITY PROBLEM;

INTEGER PROGRAMMING;

EID: 0032143812     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00059-3     Document Type: Article

References (32)

1. G. Boole, An Investigation of the Laws of Thought, on which are Founded the Mathematical Theories of Logic and Probabilities, Walton and Maberley, London, 1854 (reprint Dover, New York, 1958).
2. P. Calabrese, An algebraic synthesis of the foundations of logic and probability, Information Sciences 42 (1987) 187-237.
3. V. Chvátal, Linear Programming, Freeman, 1983.
4. Y. Crama, P. Hansen, B. Jaumard, The basic algorithm for pseudo-Boolean programming revisited, Discrete Applied Mathematics 19 (1990) 171-186.
5. S.A. Cook, The complexity of theorem proving procedures, Proceedings Third Annual Symposium on Theory of Computing, ACM, New York, 1971, pp. 151-158.
6. G.B. Dantzig, P. Wolfe, The decomposition algorithm for linear programming, Econometrica 29 (1961) 767-778.
7. J. Desrosiers, F. Soumis, M. Desrochers, Routing with time windows by column generation, Networks 14 (1984) 545-565.
8. M. Desrochers, F. Soumis, A column generation approach to the urban transit crew scheduling problem, Transportation Science 23 (1989) 1-13.
9. W. Dinkelbach, On nonlinear fractional programming, Management Science 13 (1967) 492-498.
10. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
11. G. Georgakopoulos, D. Kavvadias, C.H. Papadimitriou, Probabilistic satisfiability, Journal of Complexity 4 (1988) 1-11.
12. P.C. Gilmore, R.E. Gomory, A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 849-859.
13. F. Glover, Tabu search - Part 1, ORSA Journal on Computing 1 (1989) 190-206.
14. T. Hailperin, Best possible inequalities for the probability of a logical function of events, American Mathematical Monthly 72 (1965) 343-359.
15. T. Hailperin, Probability logic, Notre-Dame Journal of Formal Logic 25 (1984) 198-212.
16. T. Hailperin, Boole's Logic and Probability, Studies in Logic and the Foundations of Mathematics 85, 2nd edition (first edition, 1976), North-Holland, New York, 1986.
17. P. Hansen, B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990) 279-303.
18. P. Hansen, B. Jaumard, V. Mathon, Constrained nonlinear 0-1 programming, ORSA Journal on Computing.
19. P. Hansen, B. Jaumard, M. Poggi de Aragão, Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes, Comptes-Rendus de l'Académie des Sciences de Paris 313 (1991) 557-560.
20. P. Hansen, B. Jaumard, E. Sanlaville, Weight constrained minimum sum-of-stars clustering, Les Cahiers du GERAD, G-93-38, submitted for publication.
21. P. Hansen, M. Labbé, M. Minoux, The p-center sum location problem, Cahiers du Centre d'Études de Recherche Opérationnelle 36 (1994) 203-219.
22. P. Hansen, M. Minoux, M. Labbé, Extension de la programmation linéaire généralisée au cas des programmes mixtes, Comptes Rendus de l'Académie des Sciences de Paris 305 (1987) 569-572.
23. B. Jaumard, P. Hansen, M. Poggi de Aragão, Column generation methods for probabilistic logic, ORSA Journal on Computing 3 (1991) 135-148.
24. D. Kavvadias, C.H. Papadimitriou, A linear programming approach to reasoning about probabilities. Annals of Mathematics and Artificial Intelligence 1 (1990) 189-205.
25. L. Lasdon, Optimization Theory for Large Systems, Macmillan, New York, 1970.
26. R.E. Marsten, The design of the XMP linear programming library, ACM Transactions on Mathematical Software 7 (4) (1981) 481-497.
27. G.L. Nemhauser, L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
28. N.J. Nilsson, Probabilistic logic, Artificial Intelligence 28 (1986) 71-87.
29. C.C. Ribeiro, M. Minoux, C. Penna, An optimal column-generation with ranking algorithm for very large scale set partitioning problems in traffic assignment, European Journal of Operational Research 41 (1989) 232-239.
30. H.S. Stephanou, A.P. Sage, Perspectives on imperfect information processing, IEEE Transactions on Systems, Man, and Cybernetics 17 (1987) 780-798.
31. R.E.D. Woolsey, A candle to St Jude, or four real-world applications of integer programming. Interfaces 2 (1972) 20-27.
32. E. Zemel, Polynomial algorithms for estimating network reliability. Networks 12 (4) (1982) 439-452.