Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Thomas H. Byers
Technical Note—Determining All Optimal and Near-Optimal Solutions When Solving Shortest Path Problems by Dynamic Programming
Operations Research
Management Science
Computer Science Applications
Operations Research
Related publications
Using Stochastic Dual Dynamic Programming in Problems With Multiple Near-Optimal Solutions
Water Resources Research
Water Science
Technology
Convergence of Sample Path Optimal Policies for Stochastic Dynamic Programming
Computing All Optimal Solutions in Satisfiability Problems With Preferences
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Existence of Solutions in Non-Convex Dynamic Programming and Optimal Investment
Mathematics and Financial Economics
Uncertainty
Statistics
Finance
Probability
Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems
Technical Note—Solving Constrained Multi-Facility Location Problems InvolvinglpDistances Using Convex Programming
Operations Research
Management Science
Computer Science Applications
Operations Research
Optimal Learning and Approximate Dynamic Programming
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
INFORMS Journal on Computing
Management Science
Computer Science Applications
Information Systems
Operations Research
Software
Optimal Control and the Dynamic Programming Principle
