Generating Cuts from Surrogate Constraint Analysis for Zero-Oneand Multiple Choice Programming
Computational Optimization and Applications
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Logic-Based Methods for Optimization
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
ENC '03 Proceedings of the 4th Mexican International Conference on Computer Science
Hi-index | 0.00 |
The Osorio and Glover (2003) use of dual surrogate analysis is exploited to fix variables in capacitated facility location problems (CFLP). The surrogate constraint is obtained by weighting the original problem constraints by their associated dual values in the LP relaxation. A known solution is used to convert the objective function in a constraint that forces the solution to be less or equal to it. The surrogate constraint is paired with the objective function to obtain a combined constraint where negative variables are replaced by complemented variables and the resulting constraint used to fix binary variables in the model.