Some comments on preference order dynamic programming models
type: Item
instance of: scholarly article
title: Some comments on preference order dynamic programming models
zbMATH Open document ID: 0468.90080
DOI: 10.1016/0022-247X(81)90039-1
author: Moshe Sniedovich
published in: Journal of Mathematical Analysis and Applications
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 3735584
zbMATH Keywords: preference order dynamic programming
zbMATH Keywords: knapsack
zbMATH Keywords: traveling salesperson
zbMATH Keywords: assembly line balancing
zbMATH Keywords: traveling salesman
MaRDI profile type: Publication
cites work: Preference Order Dynamic Programming
cites work: Ordinal Dynamic Programming
cites work: Q3241581
cites work: Q5734848
cites work: Scheduling to Minimize Interaction Cost
cites work: Composition Principles for Synthesis of Optimal Multistage Processes
cites work: Q5591138
cites work: Q5599448
cites work: Decision Problems with Expected Utility Critera, I: Upper and Lower Convergent Utility
cites work: Decision Problems with Expected Utility Criteria, II: Stationarity
cites work: A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
cites work: A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
cites work: A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
cites work: The concept of state in discrete dynamic programming
cites work: On mean-standard deviation ratio problems and beyond via c-programming
description: scientific article; zbMATH DE number 3735584