scientific article; zbMATH DE number 3860892

MaRDI QIDQ3329227zbMATH OpenFDO

Authors U. Faigle, Gerhard Gierz

Publication date 1984

zbMATH Keywords

bipartite sum of ordered setscombinatorial optimizationseries-parallel connections of ordered setsstrongly greedy ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Integer programming (90C10)

Recommendations

• Greedy balanced pairs in \(N\)-free ordered sets
• Constructing greedy linear extensions by interchanging chains
• On the greedy dimension of a partial order
• Algorithmic Approaches to Setup Minimization
• scientific article; zbMATH DE number 786159

Cited in

(6)

• Jump number problem: The role of matroids
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
• On finding the jump number of a partial order by substitution decomposition
• Greedy balanced pairs in \(N\)-free ordered sets
• On the greedy dimension of a partial order

This page was built for publication:

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