#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1985

2018

- This year (15)
- Last 5 years (59)
- Last 10 years (155)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pierre Hansen, Brigitte Jaumard
- Computing
- 1990

Old and new algorithms for the Maximum Satisfiability problem are studied. We first summarize the different heuristics previously proposed, i.e., the approximation algorithms of Johnson and ofâ€¦ (More)

- Pierre Hansen, Brigitte Jaumard, Gilles Savard
- SIAM J. Scientific Computing
- 1992

- Brigitte Jaumard, Bruno Simeone
- Inf. Process. Lett.
- 1987

or equivalently, as I-Iom formulas. As many authors have pointed out (see, e.g., [S]), Horn formulas naturally arise in logic databases; actually, they are used to formulate queries and to expressâ€¦ (More)

- Pierre Hansen, Brigitte Jaumard
- Math. Program.
- 1997

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clustering and criteria lbr homogeneity or separationâ€¦ (More)

- Olivier du Merle, Pierre Hansen, Brigitte Jaumard, Nenad Mladenovic
- SIAM J. Scientific Computing
- 1999

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from a Euclidean m-space into a given number of clusters in order toâ€¦ (More)

- Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard
- Math. Program.
- 2000

We present a branch and cut algorithm that yields in nite time, a globally -optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadraticâ€¦ (More)

- Yves Crama, Pierre Hansen, Brigitte Jaumard
- Discrete Applied Mathematics
- 1990

The basic algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear O-l functions by recursively eliminating one variable at each iteration. We show it hasâ€¦ (More)

- Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard
- Math. Program.
- 1999

The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the optimal solutions of the reformulationsâ€¦ (More)

Anycast Routing for Survivable Optical Grids: Scalable Solution Methods and the Impact of Relocation

- Arshiya Shaikh, Jeroen Buysse, Brigitte Jaumard, Chris Develder
- IEEE/OSA Journal of Optical Communications andâ€¦
- 2011

In this paper, we address the issue of resiliency against single link network failures in optical grids and show how the anycast routing principle, which is typical of grids, can be exploited inâ€¦ (More)

- Michel Gendreau, Jacques A. Ferland, +5 authors Patrick Soriano
- PATAT
- 2006

We discuss the problem of constructing physician schedules in emergency rooms. Starting from practical instances encountered in six different hospitals of the Montreal (Canada) area, we first weâ€¦ (More)