Pages that link to "Item:Q1650776"
From MaRDI portal
The following pages link to Theoretical challenges towards cutting-plane selection (Q1650776):
Displayed 11 items.
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Machine learning for combinatorial optimization: a methodological tour d'horizon (Q2029358) (← links)
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- A branch\&cut approach to recharging and refueling infrastructure planning (Q2315636) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
- Adaptive cut selection in mixed-integer linear programming (Q6168887) (← links)