Partitioning of sequentially ordered systems using linear programming (Q1362974): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequential Partitions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unresolved Problems in Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Grouping for Maximum Homogeneity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints / rank
 
Normal rank

Revision as of 18:05, 27 May 2024

scientific article
Language Label Description Also known as
English
Partitioning of sequentially ordered systems using linear programming
scientific article

    Statements

    Partitioning of sequentially ordered systems using linear programming (English)
    0 references
    0 references
    0 references
    10 March 1998
    0 references
    0 references
    program segmentation
    0 references
    sequential partitioning
    0 references
    0 references
    0 references