Separation algorithm for tree partitioning inequalities

DOI10.1016/J.ENDM.2016.03.015MaRDI QIDQ325404zbMATH OpenOpenAlexFDO

Authors Sunil Chopra, Kangbok Lee, Minseok Ryu, Sangho Shim

Publication date 18 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2016.03.015

zbMATH Keywords

integer programmingseparation algorithmtree partitioningvalid inequality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10)

Recommendations

• Separation of partition inequalities
• Separating clique tree and bipartition inequalities in polynomial time
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• Separating from the dominant of the spanning tree polytope
• Formulations and valid inequalities of the node capacitated graph partitioning problem

Cites work

• Efficient Algorithm for the Partitioning of Trees
• The partition problem

Cited in

(5)

• Separating from the dominant of the spanning tree polytope
• Near optimal seperation of tree-like and general resolution
• Characterizing the flow equivalent trees of a network
• Combining tree partitioning, precedence, and incomparability constraints
• Separation of partition inequalities

This page was built for publication: Separation algorithm for tree partitioning inequalities

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