Constraint propagation, relational arithmetic in AI systems and mathematical programs
From MaRDI portal
Publication:918408
DOI10.1007/BF02022097zbMath0705.90056OpenAlexW2088605711MaRDI QIDQ918408
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02022097
Programming involving graphs or networks (90C35) Linear programming (90C05) Logic in artificial intelligence (68T27) Applications of set theory (03E75)
Related Items (5)
Model-based inference in CHARME. ⋮ Constraint propagation on quadratic constraints ⋮ Variable Bound Tightening and Valid Constraints for Multiperiod Blending ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Constraint propagation, relational arithmetic in AI systems and mathematical programs
Cites Work
- Unnamed Item
- Unnamed Item
- Redundancy in mathematical programming. A state-of-the-art survey
- Constraint propagation, relational arithmetic in AI systems and mathematical programs
- Constraint propagation with interval labels
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models
This page was built for publication: Constraint propagation, relational arithmetic in AI systems and mathematical programs