The following pages link to (Q3372341):
Displaying 18 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms (Q2393125) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- Оптимизация загрузки упорядоченной совокупности летательных аппаратов (Q5112293) (← links)
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems (Q6494309) (← links)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
