Gusein-Zade problem for directed path

DOI10.1016/j.disopt.2009.08.001zbMath1271.90100OpenAlexW2080387854MaRDI QIDQ1952502

Małgorzata Sulkowska, Michał Przykucki

Publication date: 31 May 2013

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.08.001

zbMATH Keywords

directed pathsecretary problemGusein-Zade problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15)

Related Items (4)

The best choice problem for upward directed graphs ⋮ Percolation and best-choice problem for powers of paths ⋮ Optimal stopping in a search for a vertex with full degree in a random graph ⋮ From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an optimal stopping problem of Gusein-Zade
• Who solved the secretary problem
• Partial-order analogue of the secretary problem: The binary tree case
• The best-choice problem for partially ordered objects.
• On a universal best choice algorithm for partially ordered sets
• On a best-choice problem by dependent criteria
• Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
• Dynamic Programming and Decision Theory

This page was built for publication: Gusein-Zade problem for directed path