{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:29:42Z","timestamp":1648891782156},"reference-count":18,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1051\/ro\/2015052","type":"journal-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T07:36:23Z","timestamp":1447400183000},"page":"665-675","source":"Crossref","is-referenced-by-count":2,"title":["An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs"],"prefix":"10.1051","volume":"50","author":[{"given":"Mamane Souley","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hac\u00e8ne","family":"Ouzia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Balas E. and Oosten M., On the cycle polytope of a directed graph.Networks36(2000) 34\u201346.","DOI":"10.1002\/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Balas E. and Stephan R., On the cycle polytope of a directed graph and its relaxations.Networks54(2009) 47\u201355.","DOI":"10.1002\/net.20304"},{"key":"R3","unstructured":"P. Bauer, A Polyhedral Approach to the Weighted Girth Problem. Dissertation, Institut fur informatik, Universitat zu Koln (1994)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Coppersmith D. and Winograd S., Matrix multiplicationviaarithmetic progressions.J. Symbolic Comput.9(1990) 251\u2013280.","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Coullard C. and Pulleyblank W.R., On cycle cones and polyhedra.Linear Algebra Appl.114\u2013115(1989) 613\u2013640.","DOI":"10.1016\/0024-3795(89)90483-7"},{"key":"R6","unstructured":"Fortune S., Hopcroft J. and Wyllie J., The directed subgraph homeomorphism problem.Theoret. Comput. Sci.10(1980) 111\u2013121."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"V. Kaibel and R. Stephan, On cardinality constrained cycle and path polytopes. ZIB report (2007).","DOI":"10.1007\/s10107-008-0257-2"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"M.S. Ibrahim, N. Maculan and H. Ouzia, A new class of valid inequalities for the minimum weighted elementary directed cycle problem in digraph. Submitted (2016).","DOI":"10.1051\/ro\/2015052"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Ibrahim M.S., Maculan N. and Minoux M., Strong flow-based formulation for the shortest path problem in digraphs with negative cycles.Int. Trans. Oper. Res. (ITOR)16(2009) 361\u2013369.","DOI":"10.1111\/j.1475-3995.2008.00681.x"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Ibrahim M.S., Maculan N. and Minoux M., A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem.Pesquisa Operacional34(2014) 117\u2013124.","DOI":"10.1590\/S0101-74382014000100009"},{"key":"R11","unstructured":"Ibrahim M.S., Maculan N. and Minoux M., Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles.Optim. Lett.9(2015) 345\u2013357."},{"key":"R12","unstructured":"Itai A. and Rodeh M., Finding a minimum circuit in a graph.SIAM J. Comput.7(1978) 413\u2013423."},{"key":"R13","unstructured":"Letchford A.N. and Pearson N.A., A fast algorithm for minimum weight odd circuits and cuts in planar graphs.Oper. Res. Lett.33(2005) 625\u2013628."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Lingas A. and Lundell E., Efficient approximation algorithms for shortest cycles in undirected graphs.J. Inf. Process. Lett.109(2009) 493\u2013498.","DOI":"10.1016\/j.ipl.2009.01.008"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Maculan N., Plateau G. and Lisser A., Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems.Pesquisa Operacional23(2003) 161\u2013168.","DOI":"10.1590\/S0101-74382003000100012"},{"key":"R16","unstructured":"Minoux M. and Ouzia H., An Hierarchy of Strong Block-Decomposable Linear Relaxations for 0\u20131 MIPs.Discrete Appl. Math.158(2010) 2031\u20132048."},{"key":"R17","unstructured":"L. Roditty and V.V. Williams, Minimum weight cycles and triangles: equivalences and algorithms.Proc. of the52ndAnnual IEEE Symposium on Foundations of Computer Science (FOCS)(2011) 180\u2013189."},{"key":"R18","unstructured":"Yuster R. and Zwick U., Finding even cycles faster.SIAM. J. Discrete Math.10(1997) 209\u20131227."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015052\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T14:07:18Z","timestamp":1567346838000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":18,"journal-issue":{"issue":"3"},"alternative-id":["ro151115"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015052","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7]]}}}