Pages that link to "Item:Q443713"
From MaRDI portal
The following pages link to Robust optimization of graph partitioning involving interval uncertainty (Q443713):
Displayed 7 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- A robust optimization approach for multicast network coding under uncertain link costs (Q526429) (← links)
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
- An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
- Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- Graph clustering with Boltzmann machines (Q6140246) (← links)