Pages that link to "Item:Q2183192"
From MaRDI portal
The following pages link to A decomposition heuristic for mixed-integer supply chain problems (Q2183192):
Displaying 7 items.
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
- Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system (Q2661605) (← links)
- Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
- Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate (Q6601549) (← links)
