Some comments on preference order dynamic programming models

DOI10.1016/0022-247X(81)90039-1zbMath0468.90080MaRDI QIDQ1156704

Moshe Sniedovich

Publication date: 1981

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

traveling salesmanknapsackassembly line balancingpreference order dynamic programmingtraveling salesperson

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Dynamic programming (90C39)

Related Items (2)

Theory and applications of generalized dynamic programming: An overview ⋮ A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The concept of state in discrete dynamic programming
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• Preference Order Dynamic Programming
• Ordinal Dynamic Programming
• A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
• Decision Problems with Expected Utility Critera, I: Upper and Lower Convergent Utility
• Decision Problems with Expected Utility Criteria, II: Stationarity
• On mean-standard deviation ratio problems and beyond via c-programming
• Composition Principles for Synthesis of Optimal Multistage Processes
• Scheduling to Minimize Interaction Cost

This page was built for publication: Some comments on preference order dynamic programming models