Up a level |
This graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Alarie, S., Audet, C., Jaumard, B., & Savard, G. (2001). Concavity Cuts for Disjoint Bilinear Programming. Mathematical Programming, 90(2), 373-398. External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2001). Enumeration of All Extreme Equilibria of Bimatrix Games. SIAM Journal on Scientific Computing, 23(1), 323-338. External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming, 87(1), 131-152. External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Symmetrical Linear Maxmin Approach to Disjoint Bilinear Programming. Mathematical Programming, 85(3), 573-592. External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1998, July). Enumeration of all extreme equilibrum strategies of bimatrix games [Paper]. 8th International Symposium on Dynamic Games and Applications, Maastricht, Netherlands. Unavailable
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1998). On the linear maxmin and related programming problems. In Multilevel Optimization: Algorithms and Applications (Vol. 20, pp. 181-208). External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1997). Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications, 93(2), 273-300. External link
Bilodeau, D., Cremieux, P.-Y., Jaumard, B., Ouellette, P., & Vovor, T. (2004). Measuring Hospital Performance in the Presence of Quasi-Fixed Inputs: an Analysis of Québec Hospitals. Journal of Productivity Analysis, 21(2), 183-199. External link
Barbera, V., & Jaumard, B. (2001). Design of an Efficient Channel Block Retuning. Mobile Networks & Applications, 6(6), 501-510. External link
Caron, G., Hansen, P., & Jaumard, B. (1999). Assignment Problem With Seniority and Job Priority Constraints. Operations Research, 47(3), 449-453. External link
Chen, P. C., Hansen, P., Jaumard, B., & Hoang, T. (1998). Solution of the multisource Weber and conditional Weber problems by D.-C. programming. Operations Research, 46(4), 548-562. External link
Crama, Y., Hansen, P., & Jaumard, B. (1995). Complexity of product positioning and ball intersection problems. Mathematics of Operations Research, 20(4), 885-894.-885-894.. External link
Chen, P.-C., Hansen, P., Jaumard, B., & Tuy, H. (1992). Weber's problem with attraction and repulsion. Journal of Regional Science, 32(4), 467-486. External link
Chen, P.-C., Hansen, P., & Jaumard, B. (1991). On-line and off-line vertex enumeration by adjacency lists. Operations Research Letters, 10(7), 403-409. External link
Douanya Ngueste, G.-B., Hansen, P., & Jaumard, B. (1995, July). Probabilistic satisfiability and decomposition [Paper]. Symbolic and quantitative approaches to reasoning and uncertainty : European conference, ECSQARU '95, Fribourg, Switzerland. External link
Fortin, A., Hail, N., & Jaumard, B. (2003, March). A tabu search heuristic for the dimensioning of 3G multi-service networks [Paper]. WCNC 2003 - IEEE Wireless Communications and Networking Conference. External link
Galinier, P., & Jaumard, B. (2006). A tabu search algorithm for difference triangle sets and golomb rulers. Computers & Operations Research, 33(4), 955-970. External link
Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (2001, January). Constraint-based approach to the Golomb ruler problem [Paper]. 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK. Unavailable
Gourdin, É., Jaumard, B., & Ellaia, R. (1996). Global optimization of holder functions. Journal of Global Optimization, 8(4), 323-348. External link
Gélinas, S., Hansen, P., Jaumard, B., & Hansen, P. (1993, January). A labeling algorithm for minimum sum of diameters partitioning of graphs [Paper]. Partitioning data sets, New Brunswick, NJ. External link
Gourdin, É., Hansen, P., & Jaumard, B. (1994). Finding maximum likelihood estimators for the three-parameter Weibull distribution. Journal of Global Optimization., 5(4), 373-397. External link
Gourdin, E., Jaumard, B., & Macgibbon, B. (1994). Global optimization decomposition methods for bounded parameter minimax risk evaluation. SIAM Journal on Scientific Computing, 15(1), 16-35. External link
Hemazro, T. D., Jaumard, B., & Marcotte, O. (2008). A column generation and branch-and-cut algorithm for the channel assignment problem. Computers & Operations Research, 35(4), 1204-1226. External link
Hansen, P., Jaumard, B., Meyer, C., Simeone, B., & Doring, V. (2003). Maximum Split Clustering Under Connectivity Constraints. Journal of Classification, 20(2), 143-180. External link
Hansen, P., Jaumard, B., & Simeone, B. (2002). Polynomial algorithms for nested univariate clustering. Discrete Mathematics, 245(1-3), 93-105. External link
Hansen, P., & Jaumard, B. (2000). Probabilistic Satisfiability. In Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertainty and Defeasible Reasoning (pp. 321-367). External link
Hansen, P., Jaumard, B., De Aragao, M. P., Chauny, F., & Perron, S. (2000). Probabilistic Satisfiability With Imprecise Probabilities. International Journal of Approximate Reasoning, 24(2-3), 171-189. External link
Hansen, P., Jaumard, B., & Nguetse, G.-B. D. (1999). Best Second Order Bounds for Two-Terminal Network Reliability With Dependent Edge Failures. Discrete Applied Mathematics, 97, 375-393. External link
Hansen, P., Jaumard, B., & Meyer, C. (1999). On Lower Bounds for Numbered Complete Graphs. Discrete Applied Mathematics, 94(1-3), 205-225. External link
Hansen, P., Jaumard, B., & Xiong, J. (1998). An interval arithmetic algorithm for multivariate constrained global optimization using cord-slope forms of Taylor's expansion. Yugoslav Journal of Operations Research, 8(2), 189-202. Unavailable
Hansen, P., Jaumard, B., & Mladenovic, N. (1998). Minimum Sum of Squares Clustering in a Low Dimensional Space. Journal of Classification, 15(1), 37-55. External link
Hansen, P., Jaumard, B., & De Aragao, M. P. (1998). Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. European Journal of Operational Research, 108(3), 671-683. External link
Hansen, P., Jaumard, B., Meyer, C., & Thisse, J.-F. (1998). New Algorithms for Product Positioning. European Journal of Operational Research, 104(1), 154-174. External link
Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79(1-3), 191-215. External link
Hansen, P., Jaumard, B., & Simeone, B. (1996). Espaliers: A generalization of dendrograms. Journal of Classification, 13(1), 107-127. External link
Hansen, P., & Jaumard, B. (1996). Computational Methods in Clustering from a Mathematical Programming Viewpoint. In Bock, H.-H., & Polasek, W. (eds.), Data Analysis and Information Systems (pp. 24-40). External link
Hansen, P., Jaumard, B., & Krau, S. (1995). An algorithm for Weber's problem on the sphere. Location Science, 3(4), 217-237. External link
Hansen, P., Jaumard, B., & Poggi de Aragao, M. Boole's conditions of possible experience and reasoning under uncertainty [Paper]. 6th and 7th Advanced Research Institutes in Discrete Applied Mathematics (ARIDAM VI/VII), Rutgers University. Published in Discrete Applied Mathematics, 60(1-3). External link
Hansen, P., Jaumard, B., Sachs, H., & Zheng, M. L. (1995). Finding a kekule structure in a benzenoid system in linear-time. Journal of Chemical Information and Computer Sciences, 35(3), 561-567. External link
Hansen, P., & Jaumard, B. (1995). Lipschitz optimization. In Handbook of global optimization (Vol. 2, pp. 407-493). External link
Hansen, P., Jaumard, B., & Sanlaville, E. (1993, August). Partitioning Problems in Cluster Analysis: A Review of Mathematical Programming Approaches [Paper]. International Federation of Classification Societies (IFCS), 1993, Paris, France. External link
Hansen, P., Jaumard, B., Lebatteux, C., & Zheng, M. L. (1994). Coding chemical trees with the centered n-tuple code. Journal of Chemical Information and Computer Sciences, 34(4), 782-790. External link
Hansen, P., Jaumard, B., & Xiong, J. (1994). Cord-slope form of Taylor's expansion in univariate global optimization. Journal of Optimization Theory and Applications, 80(3), 441-464. External link
Hertz, A., Jaumard, B., & Ribeiro, C. C. (1994). A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. Discrete Applied Mathematics, 50(3), 255-265. External link
Hertz, A., Jaumard, B., & de Aragao, M. P. Local optima topology for the k-coloring problem [Paper]. Viewpoints on Optimization; and Graph Labelling, Grimentz, Switzerland; Boston, Mass. Published in Discrete Applied Mathematics, 49(1-3). External link
Hertz, A., Jaumard, B., Ribeiro, C. C., & Formosinho Filho, W. P. (1994). A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives. RAIRO: Recherche opérationnelle, 28(3), 303-328. External link
Hansen, P., Jaumard, B., Ruiz, M., & Xiong, J. (1993). Global minimization of indefinite quadratic functions subject to box constraints. Naval Research Logistics, 40(3), 373-392. External link
Hansen, P., Jaumard, B., & Xiong, J. (1993). Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions. Journal of Global Optimization, 3(4), 421-437. External link
Hansen, P., Jaumard, B., & Lu, S.-H. (1992). Global optimization of univariate Lipschitz functions: I. Survey and properties. Mathematical Programming, 55(1-3), 251-272. External link
Hansen, P., Jaumard, B., & Lu, S.-H. (1992). Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. Mathematical Programming, 55(1-3), 273-292. External link
Hansen, P., & Jaumard, B. (1992). Reduction of indefinite quadratic programs to bilinear programs. Journal of Global Optimization, 2(1), 41-60. External link
Hansen, P., Jaumard, B., & Lu, S.-H. (1991). An analytical approach to global optimization. Mathematical Programming, 52(1-3), 227-254. External link
Hansen, P., Jaumard, B., & Lu, S.-H. (1991). On Timonov's algorithm for global optimization of univariate Lipschitz functions. Journal of Global Optimization, 1(1), 37-46. External link
Hansen, P., & Jaumard, B. (1990). Algorithms for the maximum satisfiability problem. Computing, 44(4), 279-303. External link
Hansen, P., Lu, S.-H., & Jaumard, B. (1989). Global minimization of univariate functions by sequential polynomial approximation. International Journal of Computer Mathematics, 28(1-4), 183-193. External link
Jaumard, B., Marcotte, O., Meyer, C., & Vovor, T. (2001). Comparison of Column Generation Models for Channel Assignment in Cellular Networks. Discrete Applied Mathematics, 112(1-3), 217-240. External link
Jaumard, B., & Meyer, C. (2001). On the Convergence of Cone Splitting Algorithms With Omega- Subdivisions. Journal of Optimization Theory and Applications, 110(1), 119-144. External link
Jaumard, B., Semet, F., & Vovor, T. (1998). Generalized Linear Programming Model for Nurse Scheduling. European Journal of Operational Research, 107(1), 1-18. External link
Jaumard, B., & Meyer, C. (1998). A Simplified Convergence Proof for the Cone Partitioning Algorithm. Journal of Global Optimization, 13(4), 407-416. External link
Jaumard, B., Meyer, C., & Tuy, H. (1997). Generalized convex multiplicative programming via quasiconcave minimization. Journal of Global Optimization, 10(3), 229-256. External link
Merle, O. D., Hansen, P., Jaumard, B., & Mladenovic, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21(4), 1485-1505. External link