5 documentos corresponden a la consulta.
Palabras contadas: cut: 21, branch: 22
Méndez-Díaz, I. - Zabala, P.
Discrete Appl Math 2010;158(4):349-354
2010
Temas: Branch-and-Cut - Graph multicoloring - Integer programming - Branch-and-cut - Branch-and-cut algorithms - Graph multicoloring - Integer programming formulations - Multicoloring - Polytopes - Random instance
Descripción: This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify to the polytope associated with the model. The Branch-and-Cut system includes separation heuristics for the valid inequalities, specific initial and primal heuristics, branching and pruning rules. We report on computational experience with random instances. © 2009 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Méndez-Díaz, I. - Zabala, P.
Discrete Appl Math 2006;154(5 SPEC ISS):826-847
2006
Temas: Branch-and-Cut algorithms - Graph coloring - Integer programming - Graph theory - Integer programming - Mathematical models - Branch-and-cut algorithms - Graph coloring - Algorithms
Descripción: Fil:Méndez-Díaz, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Méndez-Díaz, I. - Zabala, P. - Lucena, A.
Discrete Appl Math 2008;156(17):3223-3237
2008
Temas: Branch-and-cut algorithms - Integer programming - Traveling deliveryman problem - Dynamic programming - Hamiltonians - Integer programming - Linearization - Meats - Particle size analysis - Branch-and-Bound
Descripción: The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamiltonian path equals the sum of the costs for the layers of paths (along the Hamiltonian path) going from the depot vertex to each of the remaining vertices. In this paper, we propose a new Integer Programming formulation for the problem and computationally evaluate the strength of its Linear Programming relaxation. Computational results are also presented for a cutting plane algorithm that uses a number of valid inequalities associated with the proposed formulation. Some of these inequalities are shown to be facet defining for the convex hull of feasible solutions to that formulation. These inequalities proved very effective when used to reinforce Linear Programming relaxation bounds, at the nodes of a Branch and Bound enumeration tree. © 2008 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Bonomo, F. - Marenco, J. - Saban, D. - Stier-Moses, N.E.
Discrete Appl Math 2012;160(18):2573-2590
2012
Temas: Maximum edge subgraph problem - Polyhedral combinatorics - Quasi-cliques - Branch-and-cut algorithms - Computational studies - Integer programming formulations - Polyhedral approach - Polyhedral combinatorics - Polyhedral studies - Polytopes
Descripción: The study of cohesive subgroups is an important aspect of social network analysis. Cohesive subgroups are studied using different relaxations of the notion of clique in a graph. For instance, given a graph and an integer k, the maximum edge subgraph problem consists of finding a k-vertex subset such that the number of edges within the subset is maximum. This work proposes a polyhedral approach for this NP-hard problem. We study the polytope associated to an integer programming formulation of the problem, present several families of facet-inducing valid inequalities, and discuss the separation problem associated to these families. Finally, we implement a branch and cut algorithm for this problem. This computational study illustrates the effectiveness of the classes of inequalities presented in this work. © 2011 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Delle Donne, D. - Marenco, J.
Discrete Optim. 2011;8(4):540-554
2011
Temas: Adjacent colors - Frequency assignment - Integer programming - Adjacent channels - Adjacent colors - Branch-and-cut algorithms - Computational results - Frequency assignments - Frequency channels - Integer programming models
Descripción: In this work we study a particular way of dealing with interference in combinatorial optimization models representing wireless communication networks. In a typical wireless network, co-channel interference occurs whenever two overlapping antennas use the same frequency channel, and a less critical interference is generated whenever two overlapping antennas use adjacent channels. This motivates the formulation of the minimum-adjacency vertex coloring problem which, given an interference graph G representing the potential interference between the antennas and a set of prespecified colors/channels, asks for a vertex coloring of G minimizing the number of edges receiving adjacent colors. We propose an integer programming model for this problem and present three families of facet-inducing valid inequalities. Based on these results, we implement a branch-and-cut algorithm for this problem, and we provide promising computational results. © 2011 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo