Partitioning of sequentially ordered systems using linear programming
From MaRDI portal
Recommendations
Cites work
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- An Efficient Heuristic Procedure for Partitioning Graphs
- Cluster Analysis and Mathematical Programming
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
- Integer Programming and the Theory of Grouping
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On Grouping for Maximum Homogeneity
- Optimal Sequential Partitions of Graphs
- Optimal partitions
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
- Structured Partitioning Problems
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
- The Optimal Partitioning of Graphs
- Unresolved Problems in Cluster Analysis
Cited in
(4)
This page was built for publication: Partitioning of sequentially ordered systems using linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362974)