106 articles – 48 references  [version française]
.:. Browse > Derniers dépôts .:.
30 documents ordered by :
1 - 2 Next Last
fulltext access Combinatorial substitutions and sofic tilings
Fernique T., Ollinger N.
[hal-00521215 - version 1] (2010-09-26)
fulltext access Bulking I: an Abstract Theory of Bulking
Delorme M., Mazoyer J., Ollinger N., Theyssier G.
[hal-00451732 - version 2] (2010-09-24)
fulltext access Bulking II: Classifications of Cellular Automata
Delorme M., Mazoyer J., Ollinger N., Theyssier G.
[hal-00451727 - version 2] (2010-09-24)
fulltext access Four states are enough!
Ollinger N., Richard G.
[hal-00469841 - version 2] (2010-08-17)
fulltext access Generating a condensed representation for association rules
Pasquier N., Taouil R., Bastide Y., Stumme G., Lakhal L.
Journal of Intelligent Information Systems 24, 1 (2005) 29-60 [hal-00363015 - version 1]
fulltext access Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
Colmerauer A., Dao T.-B.-H.
In Principles and Practice of Constraint Programming - CP 2000: 6th International Conference, CP 2000, Singapore, September 2000. Proceedings - Principles and Practice of Constraint Programming - CP 2000, Singapore (2000) [hal-00144924 - version 1]
fulltext access Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees
Colmerauer A., Dao T.-B.-H.
Constraints 8, 3 (2003) 283-302 [hal-00144931 - version 1]
fulltext access Résolution de contraintes du premier ordre dans la théorie des arbres finis ou infinis
Dao T.-B.-H.
In Programmation en logique avec contraintes, JFPLC 2000, 28-30 Juin 2000, Marseille, France. Hermes 2000, ISBN 2-7462-0147-X - JFPLC, France (2000) [hal-00144920 - version 1]
fulltext access Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Bonami P., Kilinç M., Linderoth J.
Technical Report #1664, Computer Sciences Department, University of Wisconsin-Madison, 2009. (2009) [hal-00423416 - version 2]
On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Basu A., Bonami P., Cornuéjols G., Margot F.
In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms - Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, United States (2009) [hal-00421761 - version 1]
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
Saxena A., Bonami P., Lee J.
In Integer Programming and Combinatorial Optimization - 13th International Conference, IPCO 2008, France (2008) [hal-00421760 - version 1]
New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing.
Balas E., Bonami P.
In Integer Programming and Combinatorial Optimization - 12th International IPCO Conference, United States (2007) [hal-00421759 - version 1]
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
Balas E., Bonami P.
Mathematical Programming Computations 1, 2-3 (2009) 165-199 [hal-00421758 - version 1]
On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Basu A., Bonami P., Cornuéjols G., Margot F.
Mathematical Programming, Series A (2009) On line first [hal-00421757 - version 1]
An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints
Bonami P., Lejeune M. A.
Operations Research 57 (2009) 650-670 [hal-00421756 - version 1]