Optimizing compatible sets in wireless networks through integer programming
Year of publication: |
2014
|
---|---|
Authors: | Li, Yuan ; Pióro, Michał ; Yuan, Di ; Su, Jinshu |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 2.2014, 1/2, p. 1-15
|
Subject: | SINR | Branch-and-cut | Matching polytope | Gomory-Hu tree | Minimum odd-cut generation | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Mobilkommunikation | Mobile communications | Operations Research | Operations research |
-
Chance-constrained multiple bin packing problem with an application to operating room planning
Wang, Shanshan, (2021)
-
An asynchronous parallel Benders decomposition method for stochastic network design problems
Rahmaniani, Ragheb, (2021)
-
A new formulation and branch-and-cut method for single-allocation hub location problems
Espejo, Inmaculada, (2023)
- More ...
-
PSSRC: A Web Service Registration Cloud Based on Structured P2P and Semantics
He, Qian, (2016)
-
Optimizing flow thinning protection in multicommodity networks with variable link capacity
Pióro, Michał, (2016)
-
On total traffic domination in non-complete graphs
Mariño, Pablo Pavón, (2011)
- More ...