Jump number problem: The role of matroids

DOI10.1007/BF00337919zbMath0563.06001OpenAlexW1974931478MaRDI QIDQ1057289

Miroslaw Truszczynski

Publication date: 1985

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

matroidoptimallinear extensionsgreedyRado-Edmonds theoremnumber of jumpsRival's Theorem

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Minimizing bumps in linear extensions of ordered sets, Greedy posets for the bump-minimizing problem, The setup polyhedron of series-parallel posets, The jump number and the lattice of maximal antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing setups in ordered sets of fixed width
• Minimizing completion time for a class of scheduling problems
• On the size of jump-critical ordered sets
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Optimal Linear Extensions by Interchanging Chains
• Algorithmic Approaches to Setup Minimization
• The Jump Number of Dags and Posets: An Introduction
• Minimizing Setups for Cycle-Free Ordered Sets