An effective structured approach to finding optimal partitions of networks

DOI10.1007/BF02241700zbMath0485.90079OpenAlexW174824797MaRDI QIDQ1164549

H. Widjaja

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02241700

zbMATH Keywords

discrete optimizationdepth-first searchcombinatorial programmingthree-stage procedureexpansion treeessential blockadjacent setbranch-and-bound structuredisjoint subgraphsedge-valued node-weighted finite connected simple graphoptimal network partitioningoptimality theoremweight constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithms for bin packing
• Combinatorial Solution to the Partitioning of General Graphs
• An Algorithm for the Solution of 0-1 Loading Problems
• Set Partitioning: A survey
• Technical Note—On Mitten's Axioms for Branch-and-Bound
• P-Complete Approximation Problems
• Some theoretical implications of local optimization
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• A note on the monotonicity of pseudo-Boolean functions
• Correction to "Minimization of Switching Circuits Subject to Reliability Conditions"
• Computer Solutions of the Traveling Salesman Problem
• Backtrack Programming
• Branch-and-Bound Methods: A Survey
• Discrete Programming by the Filter Method
• Discrete Optimizing
• A Dynamic Programming Algorithm for Cluster Analysis
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An Approach to Solving Linear Discrete Optimization Problems
• Optimal Political Districting by Implicit Enumeration Techniques
• Optimal Sequential Partitions of Graphs
• Optimum Network Partitioning
• The Loading Problem
• Branch-and-Bound Methods: General Formulation and Properties
• Depth-First Search and Linear Graph Algorithms
• The complexity of theorem-proving procedures
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems

This page was built for publication: An effective structured approach to finding optimal partitions of networks