A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints
DOI10.1007/S10878-009-9240-YzbMATH Open1209.90071OpenAlexW1966565800MaRDI QIDQ626451FDOQ626451
Authors: Juan-Miguel Gracia
Publication date: 18 February 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9240-y
Recommendations
- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints
- scientific article; zbMATH DE number 2200743
- Strictly Nonblocking Multirate logd(N,m,p) Networks
- ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM
- Log/sub 2/ (N, m, p) strictly nonblocking networks
Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cites Work
Cited In (2)
This page was built for publication: A linear programming duality approach to analyzing strictly nonblocking \(d\)-ary multilog networks under general crosstalk constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626451)