Brigitte Jaumard

From MaRDI portal
Revision as of 19:46, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Brigitte Jaumard to Brigitte Jaumard: Duplicate)

Person:185380

Available identifiers

zbMath Open jaumard.brigitteMaRDI QIDQ185380

List of research outcomes





PublicationDate of PublicationType
Reformulation and decomposition approaches for traffic routing in optical networks2018-05-23Paper
Energy-efficient service function chain provisioning2018-04-11Paper
Towards optimal and scalable solution for routing and spectrum allocation2018-04-11Paper
Pushing the boundaries of reasoning about qualified cardinality restrictions2018-01-04Paper
An anytime deduction algorithm for the probabilistic logic and entailment problems2010-04-07Paper
On column generation formulations for the RWA problem2009-06-23Paper
A column generation and branch-and-cut algorithm for the channel assignment problem2008-09-01Paper
https://portal.mardi4nfdi.de/entity/Q52940672007-07-23Paper
Equivalence of some LP-based lower bounds for the Golomb ruler problem2006-01-10Paper
A tabu search algorithm for difference triangle sets and Golomb rulers2005-11-01Paper
Maximum split clustering under connectivity constraints2005-02-11Paper
https://portal.mardi4nfdi.de/entity/Q45507752003-06-18Paper
Probabilistic satisfiability with imprecise probabilities2002-07-23Paper
Comparison of column generation models for channel assignment in cellular networks2002-07-04Paper
Erratum to ``Comparison of column generation models for channel assignment in cellular networks2002-06-24Paper
On the convergence of cone splitting algorithms with \(\omega\)-subdivisions2002-05-29Paper
Polynomial algorithms for nested univariate clustering2002-05-15Paper
Enumeration of All Extreme Equilibria of Bimatrix Games2002-04-15Paper
Design of an efficient channel block retuning2002-03-20Paper
Concavity cuts for disjoint bilinear programming2002-02-21Paper
Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming2002-02-07Paper
The Assignment Problem with Seniority and Job Priority Constraints2002-02-07Paper
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming2001-08-20Paper
New algorithms for product positioning2001-02-22Paper
A symmetrical linear maxmin approach to disjoint bilinear programming2000-11-12Paper
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering2000-10-19Paper
https://portal.mardi4nfdi.de/entity/Q49554592000-08-07Paper
https://portal.mardi4nfdi.de/entity/Q44932562000-08-03Paper
On lower bounds for numbered complete graphs2000-07-25Paper
NASH EQUILIBRIA FROM THE CORRELATED EQUILIBRIA VIEWPOINT2000-06-19Paper
Best second order bounds for two-terminal network reliability with dependent edge failures2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27521292000-01-01Paper
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem1999-11-14Paper
https://portal.mardi4nfdi.de/entity/Q42474311999-10-31Paper
A simplified convergence proof for the cone partitioning algorithm1999-07-21Paper
A generalized linear programming model for nurse scheduling1999-07-11Paper
An algorithm for Weber's problem on the sphere1999-02-22Paper
Minimum sum of squares clustering in a low dimensional space1998-12-14Paper
https://portal.mardi4nfdi.de/entity/Q43949841998-08-12Paper
https://portal.mardi4nfdi.de/entity/Q43946011998-06-11Paper
Cluster analysis and mathematical programming1998-05-25Paper
Links between linear bilevel and mixed 0-1 programming problems1998-03-05Paper
On-line 2-satisfiability1997-11-09Paper
Generalized convex multiplicative programming via quasiconcave minimization1997-06-24Paper
Espaliers: A generalization of dendrograms1997-03-18Paper
https://portal.mardi4nfdi.de/entity/Q56872681996-12-11Paper
Global optimization of Hölder functions1996-07-23Paper
Complexity of Product Positioning and Ball Intersection Problems1996-06-09Paper
Boole's conditions of possible experience and reasoning under uncertainty1996-04-15Paper
https://portal.mardi4nfdi.de/entity/Q43269211995-06-06Paper
https://portal.mardi4nfdi.de/entity/Q48338101995-05-23Paper
https://portal.mardi4nfdi.de/entity/Q43269191995-03-27Paper
Finding maximum likelihood estimators for the three-parameter Weibull distribution1995-02-09Paper
https://portal.mardi4nfdi.de/entity/Q43020771995-01-15Paper
Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation1994-10-30Paper
Cord-slope form of Taylor's expansion in univariate global optimization1994-10-27Paper
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing1994-07-18Paper
Local optima topology for the \(k\)-coloring problem1994-07-18Paper
Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions1994-01-13Paper
A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives1994-01-01Paper
Penalty computations for the set partitioning problem1993-12-20Paper
State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming1993-09-16Paper
https://portal.mardi4nfdi.de/entity/Q46973321993-06-29Paper
Column Generation Methods for Probabilistic Logic1993-02-18Paper
Global optimization of univariate Lipschitz functions. I: Survey and properties1993-01-16Paper
Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison1993-01-16Paper
New Branch-and-Bound Rules for Linear Bilevel Programming1993-01-16Paper
Reduction of indefinite quadratic programs to bilinear programs1992-08-13Paper
On-line and off-line vertex enumeration by adjacency lists1992-06-27Paper
An analytical approach to global optimization1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39867031992-06-27Paper
On Timonov's algorithm for global optimization of univariate Lipschitz functions1992-06-26Paper
Efficient algorithms for divisive hierarchical clustering with the diameter criterion1992-06-25Paper
Algorithms for the maximum satisfiability problem1990-01-01Paper
The basic algorithm for pseudo-Boolean programming revisited1990-01-01Paper
A decomposition method for minimizing quadratic pseudo-Boolean functions1989-01-01Paper
Global minimization of univariate functions by sequential polynomial approximation1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37753391988-01-01Paper
Finite precision design of FIR digital filters using a convexity property1988-01-01Paper
On the complexity of the maximum satisfiability problem for Horn formulas1987-01-01Paper
Product form parametric representation of the solutions to a quadratic boolean equation1987-01-01Paper
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs1986-01-01Paper
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities1986-01-01Paper
Uniquely solvable quadratic Boolean equations1985-01-01Paper

Research outcomes over time

This page was built for person: Brigitte Jaumard