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

DOI10.1016/0377-2217(94)90237-2MaRDI QIDQ1328628zbMATH OpenOpenAlexFDO

Authors 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 approachoptimality of a matchingweekly schedulingweighted matching problem

Mathematics Subject Classification ID

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

Recommendations

• A survey of heuristics for the weighted matching problem
• A recurrent algorithm to solve the weighted matching problem
• scientific article; zbMATH DE number 3902700
• A note on the weighted matching with penalty problem
• A polyhedral approach for a constrained matching problem

Cites work

• A good algorithm for smallest spanning trees with a degree constraint
• scientific article; zbMATH DE number 3902700 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices

Cited in

(7)

• A direct method to compare bipolar LR fuzzy numbers
• A genetic-based framework for solving (multi-criteria) weighted matching problems.
• Minimization of the weighted total sparsity of cosmonaut training courses
• A \(2/3\)-approximation algorithm for vertex-weighted matching
• A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
• Maintaining perfect matchings at low cost
• Approximation algorithms in combinatorial scientific computing

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

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