An efficient cutting plane aglorithm for the minimum weighted elementary directed cycle problem in planar digraphs
Year of publication: |
July-September 2016
|
---|---|
Authors: | Ibrahim, Mamane Souley ; Maculan F., Nelson ; Ouzia, Hacène |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 3, p. 665-675
|
Subject: | Digraph | cycle | linear relaxation | valid inequality | polytope | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Integer programming approaches to the multiple team formation problem
Campêlo, Manoel, (2021)
-
Integer programming formulation and polyhedral results for windy collaborative arc routing problem
Khorramizadeh, Mostafa, (2022)
- More ...
-
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
Ibrahim, Mamane Souley, (2009)
-
A new second-order conic optimization model for the Euclidean Steiner tree problem in Rd\
Pinto, Renan Vicente, (2023)
-
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Lucena, Abílio, (2010)
- More ...