On solving mixed-integer constraint satisfaction problems with unbounded variables Hermann Schichl? , Arnold Neumaier, Mih´ aly Csaba Mark´ot, and Ferenc Domes Faculty of Mathematics, University of Vienna, Austria

First Page		Document Content
Date: 2013-01-14 04:38:39 Computing Constraint satisfaction Local consistency Mathematical optimization Projective space Transcendental number Linear programming Constraint logic programming Constraint programming Software engineering Computer programming		On solving mixed-integer constraint satisfaction problems with unbounded variables Hermann Schichl? , Arnold Neumaier, Mih´ aly Csaba Mark´ot, and Ferenc Domes Faculty of Mathematics, University of Vienna, Austria Add to Reading List Source URL: www.mat.univie.ac.at Download Document from Source Website File Size: 275,65 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