On solving mixed-integer constraint satisfaction problems with unbounded variables

DOI10.1007/978-3-642-38171-3_15MaRDI QIDQ4922914zbMATH OpenOpenAlexFDO

Authors Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes, Hermann Schichl

Publication date 4 June 2013

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38171-3_15

zbMATH Keywords

interval analysisdirected acyclic graphsconstraint propagationrelaxation methodsunbounded variablesmixed-integer CSPs

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• Global Optimization over Unbounded Domains
• A reduction from unbounded linear mixed arithmetic problems into bounded problems
• Complete search in continuous global optimization and constraint satisfaction
• On the solution of bounded and unbounded mixed complementarity problems
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects

Cited in

(5)

• scientific article; zbMATH DE number 1942454 (Why is no real title available?)
• Linear and parabolic relaxations for quadratic constraints
• Piecewise linear valued constraint satisfaction problems with fixed number of variables
• A reduction from unbounded linear mixed arithmetic problems into bounded problems
• On the solution of bounded and unbounded mixed complementarity problems

This page was built for publication: On solving mixed-integer constraint satisfaction problems with unbounded variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922914)