The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an a cyclic graph. There are works exploiting tree decomposition for complete search methods. In this paper, we show how tree decomposition can be used to efficiently guide the exploration of local search methods that use large neighborhoods like VNS. We introduce tightness dependent tree...
Weighted CSP (Constraint Satisfaction Problems) are used to model and to solve constraint optimization problems. As most WCSP are solved by local search methods that use large neighborhoods, selecting the neighborhood to explore is crucial. However, designing efficient neighborhoods is difficult and problem dependent. The very few generic heuristics defined for CSP, as ConflictVar or H-PGLNS, are...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.