Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
RAIRO-Oper. Res., 40 1 (2006) 53-73
Published online: 2006-07-01
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):
Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design
Rui S. Shibasaki, Mourad Baïou, Francisco Barahona, Philippe Mahey and Maurício C. de SouzaAnnals of Operations Research (2024)
https://doi.org/10.1007/s10479-024-06303-y
Partial Lasserre relaxation for sparse Max-Cut
Juan S. Campos, Ruth Misener and Panos ParpasOptimization and Engineering 24 (3) 1983 (2023)
https://doi.org/10.1007/s11081-022-09763-y
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
Guido Pantuza and Mauricio C. de SouzaInternational Transactions in Operational Research 29 (2) 729 (2022)
https://doi.org/10.1111/itor.13039
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. de SouzaInternational Transactions in Operational Research 28 (1) 296 (2021)
https://doi.org/10.1111/itor.12770
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results
Viet Hung Nguyen and Michel MinouxOptimization Letters 15 (4) 1041 (2021)
https://doi.org/10.1007/s11590-020-01667-z
A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
Gabriela B. Fonseca, Thiago H. Nogueira and Martín Gómez RavettiEuropean Journal of Operational Research 275 (1) 139 (2019)
https://doi.org/10.1016/j.ejor.2018.11.033
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-SilvaJournal of Heuristics 19 (2) 317 (2013)
https://doi.org/10.1007/s10732-012-9198-2
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Franz Rendl, Giovanni Rinaldi and Angelika WiegeleMathematical Programming 121 (2) 307 (2010)
https://doi.org/10.1007/s10107-008-0235-8
Integer Programming and Combinatorial Optimization
Franz Rendl, Giovanni Rinaldi and Angelika WiegeleLecture Notes in Computer Science, Integer Programming and Combinatorial Optimization 4513 295 (2007)
https://doi.org/10.1007/978-3-540-72792-7_23