Selecting the best choice in the weighted secretary problem

DOI10.1016/0377-2217(95)00045-3zbMath0916.90266OpenAlexW2044335360MaRDI QIDQ1268240

Young Hak Chun

Publication date: 7 March 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00045-3

zbMATH Keywords

stochastic processesgoal programmingheuristic

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items

Optimal stopping problems by two or more decision makers: a survey ⋮ Buying and selling an asset over the finite time horizon: a non-parametric approach ⋮ Optimal Stopping Problem with Controlled Recall ⋮ Expert-mediated sequential search ⋮ Business process reengineering for health-care system using multicriteria mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The secretary problem for a random walk
• Who solved the secretary problem
• Optimal selection based on relative rank (the 'Secretary Problem')
• The Secretary Problem and Its Extensions: A Review
• Optimal Sequential Assignments with Random Arrival Times
• A Bayesian Approach to a Generalized House Selling Problem
• Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
• A Sequential Stochastic Assignment Problem
• Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem