The bipartite margin shop and maximum red matchings free of blue-red alternating cycles

DOI10.1016/j.disopt.2009.03.001zbMath1167.90515OpenAlexW1996281476MaRDI QIDQ834189

Daniel Oron, George Steiner, Timkovsky, Vadim G.

Publication date: 19 August 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.03.001

zbMATH Keywords

matchingshop schedulingbipartite posetalternating cyclemargininvestment portfolio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Connected matchings in chordal bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Alternating cycles in edge-partitioned graphs
• Some simplified NP-complete graph problems
• Alternating cycle-free matchings
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Flowshop and Jobshop Schedules: Complexity and Approximation

This page was built for publication: The bipartite margin shop and maximum red matchings free of blue-red alternating cycles