%0 Conference Paper %1 conf/drcn/BendaliDBMM07 %A Bendali, Fatiha %A Diarrassouba, Ibrahima %A Biha, Mohamed Didi %A Mahjoub, Ali Ridha %A Mailfert, Jean %B DRCN %D 2007 %I IEEE %K dblp %P 1-8 %T The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. %U http://dblp.uni-trier.de/db/conf/drcn/drcn2007.html#BendaliDBMM07 %@ 978-1-4244-3824-2

@inproceedings{conf/drcn/BendaliDBMM07, added-at = {2022-10-19T00:00:00.000+0200}, author = {Bendali, Fatiha and Diarrassouba, Ibrahima and Biha, Mohamed Didi and Mahjoub, Ali Ridha and Mailfert, Jean}, biburl = {https://www.bibsonomy.org/bibtex/29dd1b5057114179aa68b12e4e636857c/dblp}, booktitle = {DRCN}, crossref = {conf/drcn/2007}, ee = {https://doi.org/10.1109/DRCN.2007.4762290}, interhash = {8d29a5b762cc34226a95cc65512121a1}, intrahash = {9dd1b5057114179aa68b12e4e636857c}, isbn = {978-1-4244-3824-2}, keywords = {dblp}, pages = {1-8}, publisher = {IEEE}, timestamp = {2024-04-10T00:54:32.000+0200}, title = {The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut.}, url = {http://dblp.uni-trier.de/db/conf/drcn/drcn2007.html#BendaliDBMM07}, year = 2007 }