When dealing with real-world optimization problems, decision-makers usually face high levels of uncertainty associated partial information, unknown parameters, or complex relationships between these and the problem decision variables. In this work, we develop a novel Chance Constraint Learning (CCL) methodology focus on mixed-integer linear problems which combines ideas from chance constraint l...

Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there...

We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value precedence into ternary constraints that is both efficient and effective at breaking symmetry. We then extend value precedence to deal with a number of generalizations like wreath value and partial interchangeability. We also show that value precedence is...

Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our proposed models exploit non-binary (global) constraints, redundant modelling, channelling constraints, and symmetry breaking constraints. Our initial experiments show that with our best integrated model, we are able to eit...

Quark-meson duality for two-point functions of vector and axial-vector QCD currents is investigated in the large-Nc approximation. We find that the joint constraints of duality and chiral symmetry imply degeneracy of excited vector and axial-vector mesons in the large-Nc limit. We compare model-independent constraints with expectations based on the VenezianoLovelace-Shapiro string model. Severa...