Greedy posets for the bump-minimizing problem

DOI10.1007/BF00337888zbMATH Open0636.06002OpenAlexW2033549036MaRDI QIDQ1097902FDOQ1097902

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

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

zbMATH Keywords

jumpbumpfinite posetlinear extensiongreedy poset

Mathematics Subject Classification ID

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

Cites Work

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

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)