Logical Processing for Integer Programming

Guignard, Monique; Johnson, Ellis L.; Spielberg, Kurt

doi:10.1007/s10479-005-3974-4

Cited by 2 publications

(1 citation statement)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Work in constraint (logic) programming, see for instance Barth (1995), also considers models of logical relations but solves the associated optimisation problems using logical techniques, rather than LP-based techniques. Two recent review papers, Balas (2005) and Guignard et al (2005) and the paper Balas et al (2004) also have a bearing on the work presented here.…”

Section: Introductionmentioning

confidence: 87%

Modelling either-or relations in integer programming

2008

View full text Add to dashboard Cite

Logical relations occur frequently in integer programming problems and are modelled by introducing binary variables in association with linear expressions. Applications requiring constraints involving precedence, exclusion, implication and other conditions give rise to the logical relations OR and IMPLIES in the models. These relations will be considered in this paper from a modelling point of view and formulations investigated for situations where the logical variables link sets of integer variables. Valid inequalities (cuts) that can be added to a model will be developed for a number of the formulations and the computational benefits of these cuts will be considered from an experimental point of view by considering the performance of sets of problem instances. New formulations and combinations of older established formulations will be considered. It will be contended that tight formulations may not always be the most successful.

show abstract

Section: Introductionmentioning

confidence: 87%