Pages that link to "Item:Q2884543"
From MaRDI portal
The following pages link to Efficient intelligent backtracking using linear programming (Q2884543):
Displaying 9 items.
- Note on the Hahn-Banach theorem in a partially ordered vector space (Q364419) (← links)
- Forward checking and intelligent backtracking (Q1263983) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking (Q4669649) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)