The following pages link to Thomas L. Morin (Q714536):
Displaying 33 items.
- Proof of the perpetuity equation (Q714538) (← links)
- Steepest ascent algorithms for nonconical multiple objective programming (Q795749) (← links)
- Conjugate duality and the curse of dimensionality (Q811416) (← links)
- Generalized dynamic programming for multicriteria optimization (Q908857) (← links)
- (Q1055345) (redirect page) (← links)
- Nonconical optimality conditions: Some additional results (Q1055346) (← links)
- The optimality of balancing workloads in certain types of flexible manufacturing systems (Q1066800) (← links)
- The location of central structures in trees (Q1097827) (← links)
- Theory and applications of generalized dynamic programming: An overview (Q1119492) (← links)
- Optimality conditions in nonconical multiple objective programming (Q1166418) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
- Locating an obnoxious facility (Q1195639) (← links)
- Algorithms for computing centroids (Q1207205) (← links)
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions (Q1223621) (← links)
- Characterizing centers of convex bodies via optimization (Q1332230) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- The strategic value of flexibility in sequential decision making (Q1388907) (← links)
- Monotonicity and the principle of optimality (Q1838705) (← links)
- Complexity of the Project Sequencing Problem (Q3325432) (← links)
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization (Q3468885) (← links)
- Solution of Spatial Equilibrium Problems with Benders Decomposition (Q3890419) (← links)
- (Q3908789) (← links)
- (Q3974980) (← links)
- Dominance and Decomposition Heuristics for Single Machine Scheduling (Q3980517) (← links)
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System (Q4018152) (← links)
- Technical Note—Multidimensional Sequencing Rule (Q4058811) (← links)
- Branch-and-Bound Strategies for Dynamic Programming (Q4123112) (← links)
- An Algorithm for Nonlinear Knapsack Problems (Q4133409) (← links)
- The Vector Maximization Problem: Proper Efficiency and Stability (Q4133426) (← links)
- (Q4136936) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- (Q5202836) (← links)
- A differential dynamic programming algorithm for differential games (Q5317800) (← links)
