Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Rendl, Franz
Rinaldi, Giovanni
and
Wiegele, Angelika
2007.
Integer Programming and Combinatorial Optimization.
Vol. 4513,
Issue. ,
p.
295.
Rendl, Franz
Rinaldi, Giovanni
and
Wiegele, Angelika
2010.
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.
Mathematical Programming,
Vol. 121,
Issue. 2,
p.
307.
Qu, Rong
Xu, Ying
Castro, Juan P.
and
Landa-Silva, Dario
2013.
Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems.
Journal of Heuristics,
Vol. 19,
Issue. 2,
p.
317.
Fonseca, Gabriela B.
Nogueira, Thiago H.
and
Ravetti, Martín Gómez
2019.
A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem.
European Journal of Operational Research,
Vol. 275,
Issue. 1,
p.
139.
Shibasaki, Rui S.
Baiou, Mourad
Barahona, Francisco
Mahey, Philippe
and
de Souza, Mauricio C.
2021.
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods.
International Transactions in Operational Research,
Vol. 28,
Issue. 1,
p.
296.
Nguyen, Viet Hung
and
Minoux, Michel
2021.
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results.
Optimization Letters,
Vol. 15,
Issue. 4,
p.
1041.
Pantuza, Guido
and
de Souza, Mauricio C.
2022.
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem.
International Transactions in Operational Research,
Vol. 29,
Issue. 2,
p.
729.
Campos, Juan S.
Misener, Ruth
and
Parpas, Panos
2023.
Partial Lasserre relaxation for sparse Max-Cut.
Optimization and Engineering,
Vol. 24,
Issue. 3,
p.
1983.
Shibasaki, Rui S.
Baïou, Mourad
Barahona, Francisco
Mahey, Philippe
and
de Souza, Maurício C.
2024.
Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design.
Annals of Operations Research,