Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem

Guido Pantuza and Mauricio C. de Souza
International Transactions in Operational Research 29 (2) 729 (2022)
DOI: 10.1111/itor.13039
See this article

A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem

Gabriela B. Fonseca, Thiago H. Nogueira and Martín Gómez Ravetti
European Journal of Operational Research 275 (1) 139 (2019)
DOI: 10.1016/j.ejor.2018.11.033
See this article

Integer Programming and Combinatorial Optimization

Franz Rendl, Giovanni Rinaldi and Angelika Wiegele
Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization 4513 295 (2007)
DOI: 10.1007/978-3-540-72792-7_23
See this article

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

Rong Qu, Ying Xu, Juan P. Castro and Dario Landa-Silva
Journal of Heuristics 19 (2) 317 (2013)
DOI: 10.1007/s10732-012-9198-2
See this article

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

Franz Rendl, Giovanni Rinaldi and Angelika Wiegele
Mathematical Programming 121 (2) 307 (2010)
DOI: 10.1007/s10107-008-0235-8
See this article

Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods

Rui S. Shibasaki, Mourad Baiou, Francisco Barahona, Philippe Mahey and Mauricio C. Souza
International Transactions in Operational Research 28 (1) 296 (2021)
DOI: 10.1111/itor.12770
See this article

Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results

Viet Hung Nguyen and Michel Minoux
Optimization Letters 15 (4) 1041 (2021)
DOI: 10.1007/s11590-020-01667-z
See this article