Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators

DOI10.1016/0377-2217(94)90237-2zbMath0806.90076OpenAlexW1981864217MaRDI QIDQ1328628

Colin E. Bell

Publication date: 26 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90237-2

zbMATH Keywords

heuristic approachweighted matching problemoptimality of a matchingweekly scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (6)

A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs ⋮ Unnamed Item ⋮ A direct method to compare bipolar LR fuzzy numbers ⋮ A genetic-based framework for solving (multi-criteria) weighted matching problems. ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Approximation algorithms in combinatorial scientific computing

Cites Work

• A good algorithm for smallest spanning trees with a degree constraint
• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item

This page was built for publication: Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators