A strong formulation for the graph partition problem

DOI10.1002/net.21916OpenAlexW2981501323WikidataQ126978743 ScholiaQ126978743MaRDI QIDQ6068542

Sang Ho Shim, Sunil Chopra

Publication date: 13 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21916

zbMATH Keywords

combinatorial optimizationInteger programmingextended formulationnetwork clusteringgraph partition problemextended graph formulationprimal dual construction

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (2)

Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks ⋮ An Exact Solution Method for the Political Districting Problem

Cites Work

• Unnamed Item
• Unnamed Item
• The projected faces property and polyhedral relations
• Facets of the clique partitioning polytope
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• A cutting plane algorithm for a clustering problem
• A concise characterization of strong knapsack facets
• Cyclic group blocking polyhedra
• The partition problem
• Polyhedral Characterization of Discrete Dynamic Programming
• Efficient Algorithm for the Partitioning of Trees
• Scheduling to Minimize Interaction Cost
• Extended formulations in combinatorial optimization

This page was built for publication: A strong formulation for the graph partition problem