Jaumard Brigitte

Brigitte Jaumard

Information about the author Brigitte Jaumard will soon be added to the site.
Found 22 papers in total
Reformulation and decomposition approaches for traffic routing in optical networks
Reformulation and decomposition approaches for traffic routing in optical networks
2016
We consider a multilayer network design model arising from a real‐life...
A column generation and branch-and-cut algorithm for the channel assignment problem
A column generation and branch-and-cut algorithm for the channel assignment problem
2008
We present an exact algorithm for solving the channel assignment problem in cellular...
A Tabu Search algorithm for difference triangle sets and Golomb rulers
A Tabu Search algorithm for difference triangle sets and Golomb rulers
2006
We propose a Tabu Search heuristic to design optimal Golomb rulers and Difference...
The assignment problem with seniority and job priority constraints
The assignment problem with seniority and job priority constraints
1999
Consider an assignment problem in which persons are qualified for some but usually not...
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
2000
We present a branch and cut algorithm that yields in finite time, a globally...
A symmetrical linear maxmin approach to disjoint bilinear programming
A symmetrical linear maxmin approach to disjoint bilinear programming
1999
The disjoint bilinear programming problem can be reformulated using two distinct...
Best second order bounds for two-terminal network reliability with dependent edge failures
Best second order bounds for two-terminal network reliability with dependent edge failures
1999
Given a network modeled by a probabilistic graph G = ( V , E ) with bounds on...
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
1998
The column generation approach to large-scale linear programming is extended to the...
A generalized linear programming model for nurse scheduling
A generalized linear programming model for nurse scheduling
1998
This paper presents a 0–1 column generation model with a resource constrained...
New algorithms for product positioning
New algorithms for product positioning
1998
Two new algorithms are proposed for the problem of positioning a new product in...
An interval arithmetic algorithm for multivariate constrained global optimization using cord-slope forms of Taylor's expansion
An interval arithmetic algorithm for multivariate constrained global optimization using cord-slope forms of Taylor's expansion
1998
A new algorithm, based on interval analysis, is proposed for global optimization of...
Solution of the multisource Weber and conditional Weber problems by d.-c. programming
Solution of the multisource Weber and conditional Weber problems by d.-c. programming
1998
D.-c. programming is a recent technique of global optimization that allows the...
Cluster analysis and mathematical programming
Cluster analysis and mathematical programming
1997
Given a set of entities, Cluster Analysis aims at finding subsets, called clusters,...
Implication graph and quadratic 0-1 optimization
Implication graph and quadratic 0-1 optimization
1994
The authors present in this paper a new approach for the optimization of a quadratic...
An algorithm for Weber’s problem on the sphere
An algorithm for Weber’s problem on the sphere
1995
Weber’s problem is to locate a facility in order to minimize the sum of its...
Penalty computations for the set partitioning problem
Penalty computations for the set partitioning problem
1993
The computation of penalities associated with the continuous relaxation of integer...
Heuristics for the design of part-orienting systems
Heuristics for the design of part-orienting systems
1993
In many manufacturing systems, parts must be fed to automatic machines in a specific...
Global minimization of indefinite quadratic functions subject to box constraints
Global minimization of indefinite quadratic functions subject to box constraints
1993
A branch-and-bound algorithm is proposed for global minimization of indefinite...
Global optimization of univariate Lipschitz functions: I. Survey and properties
Global optimization of univariate Lipschitz functions: I. Survey and properties
1992
The authors consider the following global optimization problems for a univariate...
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
1992
The authors consider the following global optimization problems for a Lipschitz...
An analytical approach to global optimization
An analytical approach to global optimization
1991
Global optimization problems with a few variables and constraints arise in numerous...
A decomposition method for minimizing quadratic pseudo-Boolean functions
A decomposition method for minimizing quadratic pseudo-Boolean functions
1989
A decomposition method is proposed for minimizing quadratic pseudo-Boolean functions....
Papers per page: