Greedy posets for the bump-minimizing problem

DOI10.1007/BF00337888MaRDI QIDQ1097902zbMATH OpenOpenAlexFDO

Authors 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

jumpbumpfinite posetlinear extensiongreedy poset

Mathematics Subject Classification ID

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

Recommendations

• Greedy linear extensions for minimizing bumps
• scientific article; zbMATH DE number 221764
• Minimizing bumps in linear extensions of ordered sets
• On minimizing the jump number for interval orders
• Minimizing bumps for posets of width two

Cites work

• scientific article; zbMATH DE number 3896963 (Why is no real title available?)
• scientific article; zbMATH DE number 3908482 (Why is no real title available?)
• scientific article; zbMATH DE number 3697161 (Why is no real title available?)
• scientific article; zbMATH DE number 3641455 (Why is no real title available?)
• Constructing greedy linear extensions by interchanging chains
• Greedy linear extensions for minimizing bumps
• Greedy linear extensions to minimize jumps
• Greedy linear extensions with constraints
• Jump number of dags having Dilworth number 2
• Jump number problem: The role of matroids
• Minimizing Setups for Cycle-Free Ordered Sets
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Minimizing bumps for posets of width two
• Minimizing bumps in linear extensions of ordered sets
• Minimizing setups in ordered sets of fixed width
• On finding the jump number of a partial order by substitution decomposition
• On the size of jump-critical ordered sets
• Optimal Linear Extensions by Interchanging Chains

Cited in

(11)

• Minimizing the sum cost in linear extensions of a poset
• Greedy linear extensions for minimizing bumps
• Computing the bump number is easy
• On minimizing the jump number for interval orders
• Substitution and atomic extension on greedy posets
• scientific article; zbMATH DE number 221764 (Why is no real title available?)
• The connection between the bump number problem and flow-shop scheduling with precedence constraints
• Minimizing bumps in ordered sets by substitution decomposition
• Minimizing bumps for posets of width two
• scientific article; zbMATH DE number 800166 (Why is no real title available?)
• scientific article; zbMATH DE number 6683604 (Why is no real title available?)

This page was built for publication: Greedy posets for the bump-minimizing problem

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