On complexity of minimization and compression problems for models of sequential choice
From MaRDI portal
Publication:4268324
DOI10.1016/S0166-218X(02)00312-8zbMath0928.91019OpenAlexW2041524104MaRDI QIDQ4268324
Publication date: 28 October 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00312-8
Decision theory (91B06) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem
- Some aspects of the general theory of best option choice
- Characteristic conditions for a class of choice functions
- Neighborhoods in problems of discrete mathematics
This page was built for publication: On complexity of minimization and compression problems for models of sequential choice