Conference paper
Logical Credal Networks
Radu Marinescu, Haifeng Qian, et al.
NeurIPS 2022
We study the classical linear programing relaxation of the p-median problem, together with the so-called “odd directed cycle inequalities.” We characterize in terms of forbidden subgraphs, the oriented graphs for which this system of inequalities defines an integral polytope. This completes the study started in Baïou and Barahona (2016), where oriented graphs with no triangles were treated.
Radu Marinescu, Haifeng Qian, et al.
NeurIPS 2022
David Melville, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2010
Francisco Barahona, Ranga Anbil
Discrete Applied Mathematics
Mourad Baïou, Francisco Barahona
Discrete Optimization