Pages that link to "Item:Q4427349"
From MaRDI portal
The following pages link to Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming (Q4427349):
Displaying 14 items.
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- Mixed global constraints and inference in hybrid CLP--IP solvers (Q1601927) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Constraint satisfaction problems: Algorithms and applications (Q1809839) (← links)
- An algorithm-independent measure of progress for linear constraint propagation (Q2112621) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming (Q2489122) (← links)
- A unified framework for partial and hybrid search methods in constraint programming (Q2489124) (← links)
- Accelerating column generation for aircraft scheduling using constraint propagation (Q2489131) (← links)
- Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)
- Switching among Solvers: Collaborative Algorithms with Parameter Control (Q3589750) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)