An integer linear programming approach to the steiner problem in graphs, Networks, vol.10, pp.167-178, 1980. ,
The k edge-disjoint 3-hopconstrained paths polytope, Discrete Optimization, vol.7, pp.222-233, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-02082810
Benders decomposition for the hopconstrained survivable network design problem, INFORMS Journal on Computing, vol.25, pp.13-26, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01255255
The Steiner tree problem i: Formulations, compositions and extension of facets, Mathematical Programming, vol.64, pp.209-229, 1994. ,
, The Steiner tree problem ii: Properties and classes of facets, Mathematical Programming, vol.64, pp.231-246, 1994.
1: Users manual for cplex, International Business Machines Corporation, vol.46, p.157, 2009. ,
The primal-dual method for approximation algorithms and its application to network design problems, PWS, pp.144-191, 1997. ,
Multicommodity flow models for spanning trees with hop constraints, European Journal of Operational Research, vol.95, pp.178-190, 1996. ,
Hop constrained Steiner trees with multiple root nodes, European Journal of Operational Research, vol.236, pp.100-112, 2014. ,
, The two-level diameter constrained spanning tree problem, Mathematical Programming, vol.150, pp.49-78, 2015.
Modeling hop-constrained and diameterconstrained minimum spanning tree problems as Steiner tree problems over layered graphs, Mathematical Programming, vol.128, pp.123-148, 2011. ,
Integer programming formulations for the two 4-hopconstrained paths problem, Networks, pp.135-144, 2007. ,
Two edge-disjoint hop-constrained paths and polyhedra, SIAM Journal on Discrete Mathematics, vol.18, pp.287-312, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00281980
Steinlib: An updated library on Steiner tree problems in graphs, Steiner trees in industry, pp.285-325, 2001. ,
A group-strategyproof cost sharing mechanism for the Steiner forest game, SIAM Journal on Computing, vol.37, pp.1319-1341, 2008. ,
Layered graph approaches to the hop constrained connected facility location problem, INFORMS Journal on Computing, vol.25, pp.256-270, 2013. ,
Strong formulations for network design problems with connectivity requirements, Networks, vol.45, pp.61-79, 2005. ,
Hop-level flow formulation for the survivable network design with hop constraints problem, Networks, pp.171-179, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01497005
Dual heuristics on the exact solution of large Steiner problems, Electronic Notes in Disc. Mathematics, vol.7, pp.150-153, 2001. ,
Improved algorithms for the Steiner problem in networks, Discrete Applied Mathematics, vol.112, pp.263-300, 2001. ,
A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems, International Conference on Integer Programming and Combinatorial Optimization, pp.376-388, 2011. ,
, MIP Formulations for the Steiner Forest Problem, 2017.
A dual ascent approach for Steiner tree problems on a directed graph, Mathematical programming, vol.28, pp.271-287, 1984. ,