A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
RAIRO-Oper. Res., 21 2 (1987) 105-136
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):
1601 (2015)
https://doi.org/10.1007/978-90-481-9707-1_20
Redundancy Allocation for Series-Parallel Systems Using a Column Generation Approach
Leila Zia and David W. CoitIEEE Transactions on Reliability 59 (4) 706 (2010)
https://doi.org/10.1109/TR.2010.2085530
Large-scale Task/Target Assignment for UAV Fleets Using a Distributed Branch and Price Optimization Scheme
Sertac Karaman and Gokhan InalhanIFAC Proceedings Volumes 41 (2) 13310 (2008)
https://doi.org/10.3182/20080706-5-KR-1001.02255
Selected Topics in Column Generation
Marco E. Lübbecke and Jacques DesrosiersOperations Research 53 (6) 1007 (2005)
https://doi.org/10.1287/opre.1050.0234
A column generation approach to capacitated p-median problems
Luiz A.N. Lorena and Edson L.F. SenneComputers & Operations Research 31 (6) 863 (2004)
https://doi.org/10.1016/S0305-0548(03)00039-X
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
Abordagens complementares para problemas de p-medianas
Edson Luiz França Senne and Luiz Antonio Nogueira LorenaProduction 13 (3) 78 (2003)
https://doi.org/10.1590/S0103-65132003000300007
A relaxação Lagrangeana/surrogate e o método de geração de colunas: novos limitantes e novas colunas
Luiz A. N. Lorena, Marcos A. Pereira and Silvely N. A. SalomãoPesquisa Operacional 23 (1) 29 (2003)
https://doi.org/10.1590/S0101-74382003000100004
Broadband Communications
Chi-Chung Cheung, Hon-Wai Chu, Danny H. K. Tsang and Sanjay GuptaBroadband Communications 457 (2000)
https://doi.org/10.1007/978-0-387-35579-5_39
An exact algorithm for IP column generation
François Vanderbeck and Laurence A. WolseyOperations Research Letters 19 (4) 151 (1996)
https://doi.org/10.1016/0167-6377(96)00033-8
1 513 (1996)
https://doi.org/10.1109/ICC.1996.542249
On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions
M. MinouxAnnals of Operations Research 58 (3) 141 (1995)
https://doi.org/10.1007/BF02032129
Graph partitioning applied to the logic testing of combinational circuits
Madlaine Davis-Moradkhan and Catherine RoucairolDiscrete Applied Mathematics 62 (1-3) 131 (1995)
https://doi.org/10.1016/0166-218X(94)00150-C
A column generation approach to job grouping for flexible manufacturing systems
Yves Crama and Alwin G. OerlemansEuropean Journal of Operational Research 78 (1) 58 (1994)
https://doi.org/10.1016/0377-2217(94)90122-8
Approximation algorithms for integer covering problems via greedy column generation
Y. Crama and J. Van De KlundertRAIRO - Operations Research 28 (3) 283 (1994)
https://doi.org/10.1051/ro/1994280302831
On combined minmax-minsum optimization
Abraham P. PunnenComputers & Operations Research 21 (6) 707 (1994)
https://doi.org/10.1016/0305-0548(94)90084-1
Traffic classification and scheduling in ATM networks
Sanjay Gupta and Magda El ZarkiTelecommunication Systems 2 (1) 51 (1993)
https://doi.org/10.1007/BF02109850
820 (1993)
https://doi.org/10.1109/INFCOM.1993.253287
1353 (1991)
https://doi.org/10.1109/INFCOM.1991.147662
Performance modeling and optimization of networks of bridged LANs
Sanjay Gupta and Keith W. RossQueueing Systems 9 (1-2) 113 (1991)
https://doi.org/10.1007/BF01158794
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
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