Pages that link to "Item:Q4904321"
From MaRDI portal
The following pages link to Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321):
Displaying 13 items.
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Benders' decomposition for the balancing of assembly lines with stochastic demand (Q2030547) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
- Meta partial Benders decomposition for the logistics service network design problem (Q2116853) (← links)
- A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
