The following pages link to (Q4796190):
Displaying 9 items.
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- (Q5020877) (← links)
- (Q5140710) (← links)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
- ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)