Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
RAIRO-Oper. Res., 20 4 (1986) 273-285
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
235 (2014)
https://doi.org/10.1002/9781119005216.ch9
https://doi.org/10.1002/9781119005216.biblio
235 (2013)
https://doi.org/10.1002/9781118600245.ch9
Column-Generation in Integer Linear Programming
Nelson Maculan, Marcos de Mendonça Passini, José André de Moura Brito and Irene LoiseauRAIRO - Operations Research 37 (2) 67 (2003)
https://doi.org/10.1051/ro:2003014
On combined minmax-minsum optimization
Abraham P. PunnenComputers & Operations Research 21 (6) 707 (1994)
https://doi.org/10.1016/0305-0548(94)90084-1
A heuristic for decomposing traffic matrices in TDMA satellite communication
G�nter Rote and Andreas VogelZOR Zeitschrift f� Operations Research Methods and Models of Operations Research 38 (3) 281 (1993)
https://doi.org/10.1007/BF01416610
Algorithms for large scale set covering problems
N. Christofides and J. PaixãoAnnals of Operations Research 43 (5) 259 (1993)
https://doi.org/10.1007/BF02025297
Minimum deviation and balanced optimization: A unified approach
C.W. Duin and A. VolgenantOperations Research Letters 10 (1) 43 (1991)
https://doi.org/10.1016/0167-6377(91)90085-4
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications
M. MinouxMathematical Programming 45 (1-3) 361 (1989)
https://doi.org/10.1007/BF01589111
Models and algorithms for optimal traffic assignment in SS/TDMA switching systems
M. Minoux and C. BrouderInternational Journal of Satellite Communications 5 (1) 33 (1987)
https://doi.org/10.1002/sat.4600050106
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
M. MinouxRAIRO - Operations Research 21 (2) 105 (1987)
https://doi.org/10.1051/ro/1987210201051
Lower bounds to the graph partitioning problem through generalized linear programming and network flows
M. Minoux and E. PinsonRAIRO - Operations Research 21 (4) 349 (1987)
https://doi.org/10.1051/ro/1987210403491