To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...