The Complexity of Integer Bound Propagation
From MaRDI portal
Publication:2996913
DOI10.1613/jair.3248zbMath1216.68238arXiv1401.3887OpenAlexW3103893175WikidataQ129518304 ScholiaQ129518304MaRDI QIDQ2996913
Lucas Bordeaux, Moshe Y. Vardi, Nina Narodytska, George Katsirelos
Publication date: 4 May 2011
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3887
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Domain reduction techniques for global NLP and MINLP optimization ⋮ An algorithm-independent measure of progress for linear constraint propagation
This page was built for publication: The Complexity of Integer Bound Propagation
