Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information - Integer programming - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2008-11-28 08:00:26 Constraint programming Operations research Constraint satisfaction problem Local consistency Mathematical optimization Heuristic Integer programming Constraint satisfaction Search algorithm Local search Look-ahead Decomposition method		Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information & Communication Systems Engineering University of th Add to Reading List Source URL: ceur-ws.org Download Document from Source Website File Size: 397,99 KB Share Document on Facebook

	Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson DocID: 1xUdh - View Document
	PDF Document DocID: 1xSrV - View Document
	Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka DocID: 1vleR - View Document
	Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995 DocID: 1v7SC - View Document
	Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be DocID: 1v72L - View Document