The following pages link to Arthur F. jun. Veinott (Q378722):
Displaying 39 items.
- Taut-string solution of the equilibrium no-lag Clark-Scarf serial inventory problem (Q378723) (← links)
- Conjugate duality for convex programs: A geometric development (Q1113806) (← links)
- Representation of general and polyhedral subsemilattices and sublattices of product spaces (Q1118621) (← links)
- Staircase transportation problems with superadditive rewards and cumulative capacities (Q1321671) (← links)
- (Q2450682) (redirect page) (← links)
- Sequential stochastic core of a cooperative stochastic programming game (Q2450683) (← links)
- Extreme points of Leontief substitution systems (Q2532765) (← links)
- Computing a graph's period quadratically by node condensation (Q2559390) (← links)
- Gerald J. Lieberman (Q2805305) (← links)
- Markov branching decision chains with interest-rate-dependent rewards (Q2805311) (← links)
- Substitutes, Complements and Ripples in Network Flows (Q3698612) (← links)
- Existence and characterization of minima of concave functions on unbounded convex sets (Q3710322) (← links)
- The Multi-Armed Bandit Problem: Decomposition and Computation (Q3755256) (← links)
- Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348) (← links)
- Optimal Capacity Scheduling—I (Q3850363) (← links)
- (Q4119017) (← links)
- Discovering Hidden Totally Leontief Substitution Systems (Q4165153) (← links)
- Substitutes, complements, and ripples in multicommodity flows on suspension graphs (Q4642469) (← links)
- Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains (Q5244857) (← links)
- Computing Optimal (<i>s, S</i>) Inventory Policies (Q5510089) (← links)
- The Optimal Inventory Policy for Batch Ordering (Q5512689) (← links)
- Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem (Q5518989) (← links)
- Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes (Q5518990) (← links)
- The Status of Mathematical Inventory Theory (Q5518991) (← links)
- The Supporting Hyperplane Method for Unimodal Programming (Q5525794) (← links)
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting (Q5528345) (← links)
- Optimal policy for a dynamic multi‐echelon inventory model (Q5534700) (← links)
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming (Q5541039) (← links)
- Integral Extreme Points (Q5545992) (← links)
- A Solution to a Countable System of Equations Arising in Markovian Decision Processes (Q5557528) (← links)
- Optimality of Myopic Inventory Policies for Several Substitute Products (Q5558798) (← links)
- On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof (Q5561623) (← links)
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems (Q5563833) (← links)
- Discrete Dynamic Programming with a Small Interest Rate (Q5565564) (← links)
- (Q5570004) (← links)
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria (Q5575236) (← links)
- Least <i>d</i>-Majorized Network Flows with Inventory and Statistical Applications (Q5650191) (← links)
- Polyhedral sets having a least element (Q5657902) (← links)
- Constrained Markov Decision Chains (Q5659359) (← links)
