• Publications
  • Influence
New Branch-and-Bound Rules for Linear Bilevel Programming
TLDR
A new branch-and-bound algorithm for linear bilevel programming is proposed. Expand
  • 527
  • 21
Cluster analysis and mathematical programming
TLDR
We review the mathematical programming approach to cluster analysis from a mathematical programming viewpoint. Expand
  • 455
  • 18
Algorithms for the maximum satisfiability problem
TLDR
Old and new algorithms for the Maximum Satisfiability problem are studied. Expand
  • 219
  • 17
On the Complexity of the Maximum Satisfiability Problem for Horn Formulas
TLDR
We prove the IW-completeness of the maximum satisfiability problem for Morn formulas even under strong restrictions on the I-Iom formulas. Expand
  • 52
  • 13
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
TLDR
We present a branch and cut algorithm that yields in finite time, a globally ε-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. Expand
  • 162
  • 12
A generalized linear programming model for nurse scheduling
TLDR
We present a generalized O-1 linear programming model for the complex nurse scheduling problem, which considers most of the characteristics of a real-world situation. Expand
  • 264
  • 8
Links Between Linear Bilevel and Mixed 0–1 Programming Problems
TLDR
A new reformulation of the linear mixed 0–1 programming problem into a linear bilevel programming one, which does not require the introduction of a large finite constant, is presented. Expand
  • 112
  • 8
Minimum sum of diameters clustering
The problem of determining a partition of a given set ofN entities intoM clusters such that the sum of the diameters of these clusters is minimum has been studied by Brucker (1978). He proved that itExpand
  • 50
  • 8
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
TLDR
An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of squared distances from all points to the centroid of the cluster to which they belong. Expand
  • 106
  • 7
  • PDF
Physician Scheduling in Emergency Rooms
TLDR
We discuss the problem of constructing physician schedules in emergency rooms. Expand
  • 60
  • 7
  • PDF