Using Constraint Propagation to Bound Linear Programs.
Tomás DlaskTomás WernerPublished in: J. Artif. Intell. Res. (2024)
Keyphrases
- constraint propagation
- linear program
- linear programming
- upper bound
- constraint satisfaction problems
- primal dual
- simplex method
- np hard
- stochastic programming
- column generation
- lower bound
- temporal constraints
- constraint programming
- constraint satisfaction
- worst case
- quantifier elimination
- linear programming problems
- objective function
- extreme points
- optimal solution
- feasible solution
- dynamic programming
- interior point methods
- integer program
- search space
- tree search
- constraint graph
- mixed integer linear program
- semidefinite programming
- path consistency
- mixed integer
- mathematical programming
- interior point
- simplex algorithm
- linear inequalities
- strongly polynomial