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

DOI10.1016/J.COR.2013.08.013zbMATH Open1348.90551OpenAlexW2138233678MaRDI QIDQ336782FDOQ336782

Authors: Jenny Nossack, Erwin Pesch 

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

Recommendations

• An exact approach for the multi-constraint graph partitioning problem
• Computational study of a branching algorithm for the maximum \(k\)-cut problem
• scientific article; zbMATH DE number 1974111
• New bounds and constraint propagation techniques for the clique partitioning problem
• scientific article; zbMATH DE number 3997175

zbMATH Keywords

graph partitioningacyclic graphbranch-and-boundconstraint propagationcontainer 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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Automatic Method of Solving Discrete Programming Problems
• Title not available (Why is that?)
• Integer Programming Formulation of Traveling Salesman Problems
• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Recent directions in netlist partitioning: a survey
• Handbook of Graph Theory
• A cutting plane algorithm for a clustering problem
• 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
• Fast Clustering Algorithms
• The clique partitioning problem: Facets and patching facets
• Facets of the clique partitioning polytope
• The node capacitated graph partitioning problem: A computational study
• Min-cut clustering
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Efficient Algorithm for the Partitioning of Trees
• Cliques and clustering: A combinatorial approach
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• Combinatorial optimization. Theory and applications.
• Multiple-way network partitioning
• Optimal Sequential Partitions of Graphs

Cited In (4)

• Reformulated acyclic partitioning for rail-rail containers transshipment
• Solving graph partitioning problems arising in tagless cache management
• Multilevel algorithms for acyclic partitioning of directed acyclic graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336782)