Miguel F. Anjos
RetourCahiers du GERAD
65 résultats — page 4 de 4
This paper explores new connections between the satisfiability problem and semidefinite programming. We show how the process of resolution in satisfiability...
référence BibTeX
This chapter provides an overview of cone optimization models for facility layout and VLSI floorplanning problems. We focus on two classes of problems to w...
référence BibTeX
We present a three-stage method using mathematical-programming techniques for finding high-quality solutions to the multi-floor facility layout problem. The...
référence BibTeXAn Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
Semidefinite programming has been used successfully to build hierarchies of convex relaxations to approximate polynomial programs. This approach rapidly beco...
référence BibTeXSymmetry in Scheduling Problems
The presence of symmetry is common in certain types of scheduling problems. Symmetry can occur when one is scheduling a collection of jobs on multiple identi...
référence BibTeX