Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
We show how clique and cover induced inequalities implied from 0-1 knapsack constraints can be obtained as Chvatal-Gomory inequalities. LP tighter and 0-1 equivalent constraints to 0-1 knapsack constraints obtained by the 'big M' reduction procedure can also be generated as Chvatal-Gomory inequalities. We also show how some extended coefficient reduction based LP tighter and 0-1 equivalent constraints can be generated as Gomory fractional cuts. © 1994.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization