-
Bazgan C., Foucaud F., Sikora F. (2019), Parameterized and approximation complexity of Partial VC Dimension, Theoretical Computer Science, 766, p. 1-15
We introduce the problem Partial VC Dimension that asks, given a hypergraph H = (X, E)and integers k and l, whether one can select a set...
-
Lesca J., Minoux M., Perny P. (2019), The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases, Algorithmica, 81, 1, p. 98â123
We consider a one-to-one assignment problem consisting of matching nobjects with n agents. Any matching leads to a utility vector whose n...
-
Meinard Y., Tsoukiàs A. (2019), On the rationality of decision-aiding processes, European Journal of Operational Research, 273, 3, p. 1074-1084
The notion of rationality plays a crucial role in Decision Aiding (DA), both as a scientific discipline and as a professional practice....
-
Furini F., Traversi E., Belotti P., Frangioni A., Gleixner A., Gould N., Liberti L., Lodi A., Misener R., Mittelmann H., Sahinidis N., Vigerske S., Wiegele A. (2019), QPLIB: a library of quadratic programming instances, Mathematical Programming Computation, 11, 2, p. 237-265
This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed)-integer...
-
Khoshkhah K., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2019), Weighted Upper Edge Cover: Complexity and Approximability, 13th International Conference, WALCOM 2019, Guwahati, India
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp....