A branch-and-price-and-cut method for computing an optimal bramble
type: Item
instance of: scholarly article
title: A branch-and-price-and-cut method for computing an optimal bramble
zbMATH Open document ID: 1387.90281
author: Sibel B. Sonuc
author: J. Cole Smith
author: Illya V. Hicks
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6872068
zbMATH Keywords: bramble
zbMATH Keywords: branch-and-price
zbMATH Keywords: treewidth
zbMATH Keywords: integer programming
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.09.005
OpenAlex ID: W2128439956
cites work: Graph searching and a min-max theorem for tree-width
cites work: Treewidth lower bounds with brambles
cites work: Achievable sets, brambles, and sparse treewidth obstructions
cites work: Q3424767
cites work: Graph minors. XX: Wagner's conjecture
cites work: On tree width, bramble size, and expansion
cites work: On planar graphs with large tree-width and small grid minors
cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
cites work: A graph‐theoretic generalization of the clique concept
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Combinatorial algorithms for the maximum \(k\)-plex problem
cites work: A class of web-based facets for the generalized vertex packing problem
cites work: A polyhedral study of the generalized vertex packing problem
cites work: On clique relaxation models in network analysis
cites work: Cliques and clustering: A combinatorial approach
cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
cites work: Graph-based data clustering with overlaps
cites work: Generalized network design problems.
cites work: On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
cites work: Algorithmic approach to the satisfactory graph partitioning problem
cites work: Satisfactory graph partition, variants, and generalizations
cites work: Easy problems for tree-decomposable graphs
cites work: Linear-time computation of optimal subgraphs of decomposable graphs
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4734791
cites work: Solving partial constraint satisfaction problems with tree decomposition
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
cites work: The Structure and Number of Obstructions to Treewidth
cites work: Contraction and Treewidth Lower Bounds
cites work: A New Lower Bound for Tree-Width Using Maximum Cardinality Search
cites work: Q4426346
cites work: Pruning by isomorphism in branch-and-cut
cites work: Exploiting orbits in symmetric ILP
cites work: Orbital Branching
cites work: Constraint Orbital Branching
cites work: Improving Discrete Model Representations via Symmetry Considerations
DOI: 10.1016/J.DISOPT.2015.09.005
Recommended article: Cutting planes for branch-and-price algorithms
Recommended article: A branch-and-price algorithm for solving the cutting strips problem
Recommended article: A branch-and-price-and-cut algorithm for the pattern minimization problem
Recommended article: Branching in branch-and-price: A generic scheme
Recommended article: A branch-price-and-cut algorithm for the minimum evolution problem
Recommended article: Branch-and-cut for complementarity-constrained optimization
Recommended article: Branch-and-price algorithms for the one-dimensional cutting stock problem
Recommended article: Q3081834
Recommended article: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
description: scientific article; zbMATH DE number 6872068