Incremental Satisfiability and Implication for UTVPI ConstraintsOpen Website

Published: 2010, Last Modified: 15 May 2023INFORMS J. Comput. 2010Readers: Everyone
Abstract: Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints that are polynomial time solvable (unless P = NP). There is considerable interest in their ...
0 Replies

Loading