Greedy posets for the bump-minimizing problem

DOI10.1007/BF00337888zbMath0636.06002OpenAlexW2033549036MaRDI QIDQ1097902

Nejib Zaguia

Publication date: 1987

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

finite posetbumpjumplinear extensiongreedy poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Deterministic scheduling theory in operations research (90B35) Graph theory (05C99)

Related Items

Computing the bump number is easy, Minimizing bumps in ordered sets by substitution decomposition, Minimizing the sum cost in linear extensions of a poset, The connection between the bump number problem and flow-shop scheduling with precedence constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing setups in ordered sets of fixed width
• Jump number of dags having Dilworth number 2
• On the size of jump-critical ordered sets
• Jump number problem: The role of matroids
• Greedy linear extensions to minimize jumps
• Minimizing bumps in linear extensions of ordered sets
• Constructing greedy linear extensions by interchanging chains
• On finding the jump number of a partial order by substitution decomposition
• Greedy linear extensions for minimizing bumps
• Minimizing bumps for posets of width two
• Greedy linear extensions with constraints
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Optimal Linear Extensions by Interchanging Chains
• Minimizing Setups for Cycle-Free Ordered Sets