The following pages link to Brigitte Jaumard (Q185380):
Displaying 50 items.
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
- (Q1025993) (redirect page) (← links)
- On column generation formulations for the RWA problem (Q1025995) (← links)
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533) (← links)
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion (Q1176597) (← links)
- On Timonov's algorithm for global optimization of univariate Lipschitz functions (Q1177913) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison (Q1198733) (← links)
- A simplified convergence proof for the cone partitioning algorithm (Q1281480) (← links)
- New algorithms for product positioning (Q1291641) (← links)
- On lower bounds for numbered complete graphs (Q1293201) (← links)
- A generalized linear programming model for nurse scheduling (Q1296052) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
- Penalty computations for the set partitioning problem (Q1309877) (← links)
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976) (← links)
- Cord-slope form of Taylor's expansion in univariate global optimization (Q1321477) (← links)
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing (Q1327210) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- Finding maximum likelihood estimators for the three-parameter Weibull distribution (Q1342904) (← links)
- Polynomial algorithms for nested univariate clustering (Q1348116) (← links)
- On-line 2-satisfiability (Q1356216) (← links)
- Generalized convex multiplicative programming via quasiconcave minimization (Q1359123) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- Minimum sum of squares clustering in a low dimensional space (Q1393051) (← links)
- A symmetrical linear maxmin approach to disjoint bilinear programming (Q1586213) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
- Pushing the boundaries of reasoning about qualified cardinality restrictions (Q1687544) (← links)
- Energy-efficient service function chain provisioning (Q1742239) (← links)
- Towards optimal and scalable solution for routing and spectrum allocation (Q1742253) (← links)
- Maximum split clustering under connectivity constraints (Q1762820) (← links)
- Boole's conditions of possible experience and reasoning under uncertainty (Q1894361) (← links)
- Global optimization of Hölder functions (Q1918982) (← links)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming (Q1970300) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Espaliers: A generalization of dendrograms (Q2563538) (← links)
- A tabu search algorithm for difference triangle sets and Golomb rulers (Q2571189) (← links)
- Equivalence of some LP-based lower bounds for the Golomb ruler problem (Q2581563) (← links)
- (Q2752129) (← links)
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming (Q2770097) (← links)
