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

DOI10.1016/J.DISOPT.2009.03.001MaRDI QIDQ834189zbMATH OpenOpenAlexFDO

Authors Daniel Oron, George Steiner, Vadim G. Timkovsky

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

alternating cyclebipartite posetinvestment portfoliomarginmatchingshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Successive partition of edges of bipartite graph into matchings
• Matchings in colored bipartite networks
• A constrained matching problem
• Alternating cycle-free matchings
• Connected matchings in chordal bipartite graphs

Cites work

• Alternating cycle-free matchings
• Alternating cycles in edge-partitioned graphs
• Flowshop and Jobshop Schedules: Complexity and Approximation
• scientific article; zbMATH DE number 3697161 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Optimal two- and three-stage production schedules with set-up time included
• Some simplified NP-complete graph problems

Cited in

(1)

• Connected matchings in chordal bipartite graphs

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

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