Semidefinite programming and combinatorial optimization.
Signal Group: Definitions and Algorithms
Solution approaches to large shift scheduling problems
This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions. Two solution approaches are proposed to solve the problems over a multiple-day planning horizon. The first approach is based on a local branching strategy and the second one is based on a temporal decomposition of the problem. Local branching is very efficient in finding good feasible solutions when compared to a classical branch-and-bound...
Solving the sensor cover energy problem via integer linear programming
This paper demonstrates that the sensor cover energy problem in wireless communication can be transformed into a linear programming problem with max-plus linear inequality constraints. Consequently, by a well-developed preprocessing procedure, it can be further reformulated as a 0-1 integer linear programming problem and hence tackled by the routine techniques developed in linear and integer optimization. The performance of this two-stage solution approach is evaluated on a set of randomly generated...
Some Experience in Human Nutrition and Institutional Menu Planning and Programming - Models, Solution Methods, Applications
Some remarks on two degrees of asymmetry in the traveling salesman problem
Staging in Balas' algorithm
Sur le problème du couplage maximal
Sur l'utilisation de troncatures de Gomory dans les algorithmes énumératifs
Sur quelques formes quadratiques associées à des partitions d'entiers
Sur un problème d'optimisation en nombres entiers de T.L. Saaty