A Generalized Problem of Optimal Selection and Assignment

DOI10.1287/OPRE.34.3.486MaRDI QIDQ4723566zbMATH OpenOpenAlexFDO

Authors Mitsushi Tamaki

Publication date 1986

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

optimal strategysecretary probleminfinite stream of applicants

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Operations research and management science (90B99)

Recommendations

• The generalized assignment problem
• scientific article; zbMATH DE number 3918100
• scientific article; zbMATH DE number 1357789
• An optimal assignment problem with choice strategy
• scientific article; zbMATH DE number 2239572
• Some optimization problems in selection procedures
• scientific article; zbMATH DE number 3866373
• Solution of a class of generalized assignment problem
• Generalized sequential stochastic assignment problem
• On a Generalization of the Classical Allocation Problem

Cited in

(10)

• An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period
• The secretary problem for a random walk
• An optimal assignment problem with choice strategy
• scientific article; zbMATH DE number 1271323 (Why is no real title available?)
• The Secretary Problem with Optimal Assignment
• Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
• Sequential Assignment Match Processes with Arrivals of Candidates and Offers
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• Optimal Sequential Selection of Secretaries
• On the General Position Subset Selection Problem

This page was built for publication: A Generalized Problem of Optimal Selection and Assignment

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