Author of the publication

A layered compact formulation for the Multiple Steiner TSP with Order constraints.

, , and . CoDIT, page 1462-1467. IEEE, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut., , , and . Math. Program., 105 (1): 85-111 (2006)Simulated evolution based algorithm versus exact method for virtual private network design., , , and . ICNC, page 245-249. IEEE, (2014)On the complexity of the Eulerian closed walk with precedence path constraints problem., , and . Electron. Notes Discret. Math., (2010)Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval., and . Comput. Ind. Eng., 56 (4): 1708-1712 (2009)On the Polytope of the (1, 2)-Survivable Network Design Problem., , and . SIAM J. Discret. Math., 22 (4): 1640-1666 (2008)Distance Transformation for Network Design Problems., , , and . SIAM J. Optim., 29 (2): 1687-1713 (2019)Design of survivable IP-over-optical networks., , , and . Ann. Oper. Res., 146 (1): 41-73 (2006)Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem., , , , and . Networks, 67 (2): 148-169 (2016)Preface: New trends on combinatorial optimization for network and logistical applications., , and . Ann. Oper. Res., 298 (1): 1-5 (2021)On the k edge-disjoint 2-hop-constrained paths polytope., , , and . Oper. Res. Lett., 34 (5): 577-582 (2006)