Publications à Polytechnique

Ces données sont extraites du Répertoire des publications de l'École Polytechnique de Montréal. La liste ci-dessous contient seulement les publications auxquelles a participé le professeur ou le chercheur depuis son entrée en fonction à l’École. De plus, certaines publications ne sont pas dans cette liste, notamment les notes de cours et les rapports techniques internes plus d'information...
1	Pesant, G., Quimper, C.-G., Zanarini, A. (2012). Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. Journal of Artificial Intelligence Research, 43, p. 173-210.
2	Meignan, D., Frayret, J.-M., Pesant, G. (2011). An Interactive Heuristic Approach for the P-Forest Problem. IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011, p. 1009-1013.
3	Bhattacharya, N., Sakti, A., Antoniol, G., Gueheneuc, Y.-G., Pesant, G. (2011). Divide-by-Zero Exception Raising Via Branch Coverage. 3rd International Symposium on Search-Based Software Engineering, SSBSE 2011, p. 204-218.
4	Berbeglia, G., Pesant, G., Rousseau, L.-M. (2011). Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming. Transportation Science, 45(3), p. 399-412.
5	Galinier, P., Hertz, A., Paroz, S., Pesant, G. (2011). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. Annals of Operations Research, 184, p. 121-135.
6	Pesant, G., Zanarini, A. (2011). Recovering Indirect Solution Densities for Counting-Based Branching Heuristics. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, p. 170-175.
7	Lodi, A., Pesant, G., Rousseau, L.-M. (2011). On Counting Lattice Points and Chvatal-Gomory Cutting Planes. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, p. 131-136.
8	Abdelilah, S., Gueheneuc, Y.-G., Pesant, G. (2011). CP-SST : approche bassée surla programmation par contraintes pour le test structurel du logiciel. 7e Journées francophones de programmation par contraintes, p. 289-298.
9	Bhattacharya, N., Sakti, A., Antoniol, G., Gueheneuc, Y.-G., Pesant, G. (2011). Performance Analysis of Metaheuristic and Constraint Programming Approaches. 4th International Conference on Software Testing, Verification and Validation.
10	Pesant, G. (2010). Constraints: Editor's Note. Constraints, 15(3), p. 305-306.
11	Zanarini, A., Pesant, G. (2010). More Robust Counting-Based Search Heuristics With Alldifferent Constraints. 7th International Conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CPAIOR 2010, p. 354-368.
12	Le Bras, R., Zanarini, A., Pesant, G. (2009). Efficient Generic Search Heuristics Within the Embp Framework. 15th International Conference on Principles and Practice of Constraint Programming, CP 2009, v. 5732 LNCS, p. 539-553.
13	Pesant, G., Quimper, C.-G., Rousseau, L.-M., Sellmann, M. (2009). The Polytope of Context-Free Grammar Constraints. 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, p. 223-232.
14	Gaudreault, J., Frayret, J.-M., Pesant, G. (2009). Distributed Search for Supply Chain Coordination. Computers in Industry, 60(6), p. 441-451.
15	van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A. (2009). New Filtering Algorithms for Combinations of Among Constraints. Constraints, 14(2), p. 273-292.
16	Zanarini, A., Pesant, G. (2009). Solution Counting Algorithms for Constraint-Centered Search Heuristics. Constraints, 14(3), p. 392-413.
17	Gaudreault, J., Pesant, G., Frayret, J.-M., D'amours, S. (2009). An Adaptive Search Strategy for Efficient Distributed Decision Making. Learning and Intelligent Optimization Conference.
18	Galinier, P., Hertz, A., Paroz, S., Pesant, G. (2008). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, p. 298-302.
19	Pesant, G., Quimper, C.-G. (2008). Counting Solutions of Knapsack Constraints. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, v. 5015 , p. 203-217.
20	Gaudreault, J., Frayret, J.-M., Pesant, G., Forget, P., D'Amours, S. (2008). Operations Coordination in the Lumber Industry: From Heuristics Sto Machine Learning. 13th Annual International Conference on Industrial Engineering Theory, Applications & Practice.
21	Zanarini, A., Pesant, G. (2007). Solution Counting Algorithms for Constraint-Centered Search Heuristics. 13th International Conference on Principles and Practice of Constraint Programming 2007, p. 743-757.
22	Zanarini, A., Pesant, G. (2007). Generalizations of the Global Cardinality Constraint for Hierarchical Resources. CPAIOR 2007. Proceedings of the 4th International Conference on Integration of Artificial Intelligence, Constraint Programming, and Operations Research Techniques for Combinatorial Optimization Problems, p. 361-375.
23	Gaudreault, J., Frayret, J.-M., Pesant, G. (2007). Discrepancy-Based Method for Hierarchical Distributed Optimization. 19th IEEE International Conference on Tools With Artificial Intelligence, v. 2, p. 75-81.
24	Gaudreault, J., Frayret, J.-M., Pesant, G. (2007). Discrepancy-Based Optimization for Distributed Supply Chain Operations Planning. Ninth International Workshop on Distributed Constraint Reasoning.
25	Demassey, S., Pesant, G., Rousseau, L.M. (2006). A Cost-Regular Based Hybrid Column Generation Approach. Constraints, 11(4), p. 315-333.
26	Zanarini, A., Milano, M., Pesant, G. (2006). Improved Algorithm for the Soft Global Cardinality Constraint. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Third International Conference, CPAIOR 2006. Proceedings, p. 288-299.
27	Pomerleau, Y., Chamberland, S., Pesant, G. (2006). On Solving the Tree-Topology Design Problem for Wireless Cellular Networks. Journal of Communication and Networks, 8(1), p. 85-92.
28	Van Hoeve, W.-J., Pesant, G., Rousseau, L.-M. (2006). On Global Warming: Flow-Based Soft Global Constraints. Journal of Heuristics, 12(4-5), p. 347-373.
29	Van Hoeve, W.J., Pesant, G., Rousseau, L.M., Sabharwal, A. (2006). Revisiting the Sequence Constraint. Principles and Practice of Constraint Programming - Cp 2006, p. 620-634.
30	Gendron, B., Lebbah, H., Pesant, G. (2005). Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : Second International Conference, CPAIOR, p. 217-227.
31	Andre, M., Pesant, G., Pierre, S. (2005). A Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless Networks. Journal of Computer Sciences, 1(2), p. 175-181.
32	Pesant, G. (2005). Counting Solutions of CSPs : A Structural Approach. Proceedings of Teh Nineteenth International Joint Conference on Artificial Intelligence, p. 260-265.
33	Pesant, G., Régin, J.-C. (2005). SPREAD : a Balancing Constraint Based on Statistics. Eleventh International Conference, p. 460-474.
34	Demassey, S., Pesant, G., Rousseau, L.-M. (2005). Constraint Programming Based Column Generation for Employee Timetabling. Second International Conference (CPAIOR'05), p. 217-227.
35	Soumis F., Pesant G., Rousseau L.-M. (2005). Gestion des horaires et affectations du personnel. Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs. Montréal: Pressses Polytechnique. p. 71-111.
36	Pesant G., Rousseau L.-M. (2005). Programmation par contraintes. Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs. Montréal: Presses Polytechnique. p. 223-247.
37	Hellsten, L., Pesant, G., Van Beek, P. (2004). A Domain Consistency Algorithm for the Stretch Constraint. Principles and Practice of Constraint Programming - CP 2004, Proceedings, p. 290-304.
38	Laporte, G., Pesant, G. (2004). A General Multi-Shift Scheduling System. Journal of the Operational Research Society, 55(11), p. 1208-1217.
39	Meric, L., Pesant, G., Pierre, S. (2004). Variable Neighbourhood Search for Optical Routing in Networks Using Latin Routers. Annales des télécommunications, 59(3-4), p. 265-280.
40	Pesant, G. (2004). A Regular Language Membership Constraint for Finite Sequences of Variables. Principles and Practice of Constraint Programming - CP 2004. 10th International Conference, CP 2004. Proceedings, p. 482-495.
41	Rousseau, L.-M., Focacci, F., Gendreau, M., Pesant G. (2004). Solving VRPTW With Constraint Programming Based Column Generation. Annals of Operations Research, 130, p. 199-216.
42	van Hoeve W.J., Pesant G ., Rousseau L-M (2004). On Global Warming (Softening Global Constraints). Workshop on Preferences and Soft Constraints.
43	Amoussou, G., Andre, M., Pesant, G., Pierre, S. (2003). A Constraint Programming Approach to Assign Cells to Switches in Personal Communication Networks. Annales des télécommunications, 58(3-4), p. 584-604.
44	Bourdais, S., Galinier, P., Pesant, G. (2003). HIBISCUS: a Constraint Programming Application to Staff Scheduling in Health Care. Lecture Notes in Computer Science, 2833, p. 153-167.
45	Pesant, G. (2003). Regular Language Membership Constraint for Sequences of Variables. Principles and Practice of Constraint Programming : Proceedings of the Ninth International Conference (CP'03), p. 110-119.
46	Pomerleau, Y., Chamberland, S., Pesant, G. (2003). A Constraint Programming Approach for the Design Problem of Cellular Wireless Networks. CCECE 2003: Canadian Conference on Electrical and Computer Engineering, Vols 1-3, Proceedings - Toward a Caring and Humane Technology, p. 881-884.
47	Rousseau, L.M., Gendreau, M., Pesant, G. (2003). Synchronized Vehicle Dispatching Problem. Proc. Odysseus 2003.
48	Amoussou, G., André, M., Pesant, G., Pierre, S. (2002). Affectation de cellules à des commutateurs dans les réseaux cellulaires mobiles par programmation par contraintes. 2002 Canadian Conference on Electrical and Computer Engineering (CCECE'02), v. 3, p. 1311-1316.
49	André, M., Pesant, G., Pierre, S. (2002). Using Tabu Search for Assigning Cells to Switches in Mobile Cellular Networks. 21st Biennal Symposium on Communications, p. 129-133.
50	Bourjolly, J.-M., Laporte, G., Pesant, G. (2002). An Exact Algorithm for the Maximum K-Club Problem in an Undirected Graph. European Journal of Operational Research, 138(1), p. 21-28.
51	Gendreau, M., Pesant, G., Rousseau, L.-M. (2002). Using Constraint-Based Operators to Solve the Vehicle Routing Plroblem With Time Windows. Journal of Heuristics, 8, p. 43-58.
52	Pesant, G., Laporte, G. (2002). Algorithme robuste pour la confection d'horaires cycliques. Journées francophones de programmation logique et programmation par contraintes (JFPLC'02).
53	Pesant, G., Soriano, P. (2002). An Optimal Strategy for the Constrained Cycle Cover Problem. Annals of Mathematics and Artificial Intelligence, 34(4), p. 313-325.
54	Rousseau, L.-M., Gendreau, M., Pesant, G. (2002). Solving Small VRPTWs With Constraint Programming Based Column Generation. International Symposium on Combinatorial Optimization.
55	Rousseau, L.-M., Pesant, G., Gendreau, M. (2002). General Approach to the Physician Rostering Problem. Annals of Operations Research, 115, p. 193-205.
56	Amoussou, G., Pesant, G., Pierre, S. (2001). Affectation de cellules à des commutateurs par programmation par contraintes. Proceedings 2001 Canadian Conference on Electrical and Computer Engineering, v. 2, p. 1017-1022.
57	Galinier, Ph., Jaumard, B., Morales, R., Pesant, G. (2001). Constraint-Based Approach to the Golomb Ruler Problem. 3rd International Workshop on the Intergration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR01).
58	Pesant, G. (2001). A Filtering Algorithm for the Stretch Constraint, Principles and Practice of Constraint Programming. Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, p. 183-195.
59	Rousseau, L.-M., Pesant, G., Gendreau, M. (2001). Building Negative Reduced Cost Paths Using Constraint Programming. Principles and Practice of Constraint Programming: 7th International Conference (CP'01), v. 2239, p. 778.
60	Bourjolly, J.M., Laporte, G., Pesant, G. (2000). Heuristics for Finding K-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), p. 559-569.
61	Rousseau, L.-M., Gendreau, M., Pesant, G. (2000). A Hybrid Algorithm to Solve Physician Rostering Problem. Second Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.
62	Pesant, G., Boyer, M. (1999). Reasoning About Solids Using Constraints Logic Programming. Journal of Automated Reasoning, 22, p. 241-262.
63	Pesant, G., Gendreau, M. (1999). Constraint Programming Framework for Local Search Methods. Journal of Heuristics, 5, p. 255-279.
64	Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M. (1999). On the Flexibility of Constraints Programming Models: From Single to Multiple Time Windows for the Traveling Salesman Problem. European Journal of Operational Research, 117, p. 253-263.
65	Rousseau, L.-M., Gendreau, M., Pesant, G. (1999). Hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. Journées francophones de programmation logique et programmation par contraintes (JF-PLC'99), p. 145-160.
66	Rousseau, L.-M., Gendreau, M., Pesant, G. (1999). Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. Actes des 8ième journées francophones de programmation logique et programmation par contraintes, p. 145-160.
67	Rousseau, L.-M., Gendreau, M., Pesant, G. (1999). Using Constraint-Based Operators With Variable Neighborhood Search to Solve the Vehicle Routing Problem With Time Windows. First Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.
68	Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, L.-M. (1998). Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem With Time Windows. Transportation Science, 32, p. 12-29.
69	Pesant, G., Gendreau, M., Rousseau, J.-M. (1997). GENIUS-CP: a Generic Single-Vehicle Routing Algorithm. Principles and Practice of Constraints Programming, 3rd International Conference (CP'97), p. 420-434.
70	Pesant, G., Séguin, R., Soriano, P. (1997). High School Timetabling by Constraint Programming. 2nd International Conference on the Practice and Theory of Automated Timetabling (PATAT'97), p. 340-344.
71	Pesant, G., Gendreau, M. (1996). View of Local Search in Constraint Programming. Principles and Practice of Constraint Programming, 2nd International Conference (CP'96), p. 353-366.