LP Relaxations of Multiple all_different Predicates
This paper examines sets of all_different predicates that appear in multidimensional assignment problems. It proposes the study of certain LP relaxations as a prerequisite of integrating CP with IP on these problems. The convex hull of vectors satisfying simultaneously two predicates is analysed and a separation algorithm for facet-defining inequalities is proposed.
KeywordsConvex Hull Assignment Problem Constraint Programming Linear Programming Relaxation Integer Program Model
Unable to display preview. Download preview PDF.
- 2.Appa, G., Magos, D., Mourtos, I.: Polyhedral resuls for assignment problems. LSE CDAM Workin Paper Series, URL: http://www.cdam.lse.ac.uk/Reports/Files/cdam-2002-01.pdf
- 4.Christoff, T., Löbel, A.: Polyhedral Representation Transformation Algorithm v.1.4.0 (2003), URL: http://www.zib.de/Optimization/Software/Porta
- 8.Spieksma, F.C.R.: Multi-index assignment problems: complexity, approximation, applications. In: Pitsoulis, L., Pardalos, P. (eds.) Nonlinear Assignment Problems, Algorithms and Applications, pp. 1–12. Kluwer Academic Publishers, Dordrecht (2000)Google Scholar