Name
Abstract | ||
|---|---|---|
Glass coating is a specific transformation aiming at improving glass performance. The work presented in this paper deals with the determination of the optimal configuration of the production lines used to perform this operation. We propose a first MIP formulation of the problem and then discuss several types of valid inequalities for improving it. The main idea is to exploit explicit or implicit binary exclusion constraints to derive stronger valid inequalities: the maximal clique constraints. Efficient (polynomial time) separation algorithms exploiting special structure of the problem are described, giving rise to a cutting-plane generation procedure for strengthening the initial formulation. The computational study carried out shows that, with the enhanced formulation, good solutions can be obtained within reasonable computation times using currently available integer programming software. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ejor.2009.06.027 | European Journal of Operational Research |
Keywords | DocType | Volume |
Integer programming,Branch and bound,Valid inequalities,Production line design,Glass coating | Journal | 202 |
Issue | ISSN | Citations |
3 | 0377-2217 | 0 |
PageRank | References | Authors |
0.34 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Céline Gicquel | 1 | 8 | 3.28 |
| N. Miègeville | 2 | 5 | 0.83 |
| Michel Minoux | 3 | 741 | 100.18 |
| Yves Dallery | 4 | 881 | 86.93 |