We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature. To facilitate our analysis, we give a new characterization of branch-and-bound algorithms, which consists of isolating the performed operations without specifying any particular order for their execution.
This paper presents a comprehensive survey of models and algorithms for multicommodity capacitated network design problems, which are mostly encountered in telecommunications and transportation network planning. These problems are important not only due to the major relevance of their applications, but also because they pose considerable modeling and algorithmic challenges. We present a general arc-based model, describe useful alternative formulations and survey the literature on simplex-based cutting plane and Lagrangean relaxation approaches. We then focus on our own contributions that develop and compare several relaxation methods for a particular case of this model, the xed-charge problem. These methods are based on Lagrangean relaxation and nondi erentiable optimization techniques, namely, the subgradient and bundle approaches. Our experimental results, while very encouraging, indicate that solving e ciently these di cult problems requires a judicious combination of cutting planes, Lagrangean relaxation methods and sophisticated heuristics. In addition, due to their inherent decomposition properties, these techniques can beadapted to parallel computing environments, which is highly desirable in order to solve realistically sized instances.Key words : Multicommodity capacitated network design, cutting planes, Lagrangean relaxation, non-di erentiable optimization, parallel computing. R esum eCet article pr esente une revue de la litt erature sur les mod eles et les m ethodes de r esolution de probl emes de conception de r eseaux avec capacit es. Ces probl emes sont importants non seulement en raison de leurs applications en plani cation de r eseaux de transport et de t el ecommunications, mais egalement parce qu'ils posent des d e s consid erables. Nous pr esentons un mod ele g en eral, ainsi que d'autres formulations alternatives int eressantes, et nous passons en revue les travaux portant sur les m ethodes de coupes et de relaxation lagrangienne. Nous d ecrivons egalement nos propres contributions, dans lesquelles nous d eveloppons et comparons plusieurs m ethodes de relaxation pour un cas particulier, le probl eme avec coûts xes. Ces m ethodes sont bas ees sur la relaxation lagrangienne et l'optimisation non-di erentiable, en particulier les algorithmes de sous-gradients et de faisceaux. Nos r esultats exp erimentaux, bien qu'encourageants, sugg erent que les m ethodes les plus prometteuses consistent a combiner les m ethodes de coupes et de relaxation lagrangienne avec des heuristiques sophistiqu ees, et d'adapter ces m ethodes a des environnements parall eles, a n de r esoudre e cacement des exemplaires de grande taille.Mots-cl es : Conception de r eseaux avec capacit es, m ethodes de coupes, relaxation lagrangienne, optimisation non-di erentiable, calcul parall ele.ii
We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved by the addition of extended linking inequalities, derived from variable disaggregation techniques. We show that these extended linking inequalities for the 0-1 model are equivalent to the residual capacity inequalities, a class of valid inequalities derived for the model with general integer variables. In this paper, we compare two cutting-plane algorithms to compute the same lower bound on the optimal value of the problem: one based on the generation of residual capacity inequalities within the model with general integer variables, and the other based on the addition of extended linking inequalities to the 0-1 reformulation. To further improve the computational results of the latter approach, we develop a column-and-row generation approach; the resulting algorithm is shown to be competitive with the approach relying on residual capacity inequalities.
We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory.Key words: piecewise-linear, integer programming, linear relaxation, Lagrangian relaxation. Resum6Nous considerons un probleme de minimisation gen6rique dans lequel l'objectif consiste d'une somme separable de fonctions lineaires par morceaux non convexes. Nous montrons que les relaxations lineaires de trois modeles classiques de programmation en nombres entiers sont equivalentes puisqu'elles fournissent comme approximation de l'objectif son enveloppe convexe inf6rieure. Nous etablissons galement une relation entre ce rsultat et la th6orie de la dualite lagrangienne classique.Mots-cls : lineaire par morceaux, progrmmation en nombres entiers, relaxation lin6aire, relaxation lagrangienne.ii
We discuss an algorithmic scheme, which we call the stabilized structured Dantzig-Wolfe decomposition method, for solving large-scale structured linear programs. It can be applied when the subproblem of the standard Dantzig-Wolfe approach admits an alternative master model amenable to column generation, other than the standard one in which there is a variable for each of the extreme points and extreme rays of the corresponding polyhedron. Stabilization is achieved by the same techniques developed for the standard Dantzig-Wolfe approach and it is equally useful to improve the performance, as shown by computational results obtained on an application to the multicommodity capacitated network design problem.
We present exact algorithms for solving the minimum connected dominating set problem in an undirected graph. The algorithms are based on two approaches: a Benders decomposition algorithm and a branch-and-cut method. We also develop a hybrid algorithm that combines these two approaches. Two variants of each of the three resulting algorithms are considered: a stand-alone version and an iterative probing variant. The latter variant is based on a simple property of the problem, which states that if no connected dominating set of a given cardinality exists, then there are no connected dominating sets of lower cardinality. We present computational results on a large set of instances from the literature.
Multicommodity capacitated network design, Benders decomposition, Metric inequalities, Cutset inequalities,
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
334 Leonard St
Brooklyn, NY 11211
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.