Pages that link to "Item:Q2462107"
From MaRDI portal
The following pages link to Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107):
Displaying 9 items.
- An exact model for cell formation in group technology (Q373207) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- Computing Weighted Strength and Applications to Partitioning (Q4558887) (← links)
- (Q5077149) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
