The Secretary Problem with Optimal Assignment

DOI10.1287/OPRE.32.4.847MaRDI QIDQ3337949zbMATH OpenOpenAlexFDO

Authors Mitsushi Tamaki

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.32.4.847

zbMATH Keywords

combinatorial optimizationoptimal assignmentsecretary problemsequential assignmentsuboptimal strategy

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Operations research and management science (90B99)

Recommendations

• A Generalized Problem of Optimal Selection and Assignment
• Secretary problem
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• scientific article; zbMATH DE number 1766760
• SELECTING SATISFACTORY SECRETARIES

Cited in

(16)

• scientific article; zbMATH DE number 7077336 (Why is no real title available?)
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• The solution of a generalized secretary problem via analytic expressions
• Score-based secretary problem
• Secretary Problems via Linear Programming
• Robust Algorithms for the Secretary Problem
• Secretary Problems via Linear Programming
• The secretary recommendation problem
• scientific article; zbMATH DE number 572375 (Why is no real title available?)
• The senior and junior secretaries problem
• scientific article; zbMATH DE number 4166402 (Why is no real title available?)
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• The Secretary Problem with a Choice Function
• Dynamic programming and the secretary problem
• A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates
• Selecting the best choice in the weighted secretary problem

This page was built for publication: The Secretary Problem with Optimal Assignment

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