A branch-and-bound algorithm for the acyclic partitioning problem

DOI10.1016/j.cor.2013.08.013zbMath1348.90551OpenAlexW2138233678MaRDI QIDQ336782

Erwin Pesch, Jenny Nossack

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.013

zbMATH Keywords

branch-and-boundconstraint propagationgraph partitioningacyclic graphcontainer transshipment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Solving Graph Partitioning Problems Arising in Tagless Cache Management ⋮ Reformulated acyclic partitioning for rail-rail containers transshipment ⋮ Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Facets of the clique partitioning polytope
• A cutting plane algorithm for a clustering problem
• Cliques and clustering: A combinatorial approach
• The node capacitated graph partitioning problem: A computational study
• Min-cut clustering
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• New bounds and constraint propagation techniques for the clique partitioning problem
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Combinatorial optimization. Theory and applications.
• Recent directions in netlist partitioning: a survey
• Integer Programming Formulation of Traveling Salesman Problems
• An Automatic Method of Solving Discrete Programming Problems
• Multiple-way network partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• Fast Clustering Algorithms
• Handbook of Graph Theory
• The clique partitioning problem: Facets and patching facets
• Efficient Algorithm for the Partitioning of Trees
• Optimal Sequential Partitions of Graphs
• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices

This page was built for publication: A branch-and-bound algorithm for the acyclic partitioning problem