The following pages link to James E. Ward (Q757254):
Displayed 22 items.
- Approaches to sensitivity analysis in linear programming (Q757255) (← links)
- The stochastic location-assignment problem on a tree (Q816410) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- Item:Q757254 (redirect page) (← links)
- Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case (Q957358) (← links)
- A parts selection model with one-way substitution (Q1328592) (← links)
- An improved lower bound for the multimedian location problem (Q1872010) (← links)
- Two-groups and Jordan algebras (Q2538876) (← links)
- Correction to: Two-groups and Jordan algebras (Q2545928) (← links)
- On Efficient Solutions to Multiple Objective Mathematical Programs (Q3216460) (← links)
- Some Properties of Location Problems with Block and Round Norms (Q3221721) (← links)
- Locating A Median Subtree On A Network (Q3359989) (← links)
- (Q3479805) (← links)
- Using Block Norms for Location Modeling (Q3705189) (← links)
- A Note on "Economic Order Quantity under Conditions of Permissible Delay in Payments" (Q3745584) (← links)
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems (Q3887188) (← links)
- Vector Spaces of Magic Squares (Q3913529) (← links)
- The Probability of Election Reversal (Q3934107) (← links)
- Two-Interval Inventory-Allocation Policies in a One-Warehouse N-Identical-Retailer Distribution System (Q4282283) (← links)
- Balancing Retailer Inventories (Q4384083) (← links)
- Risk-Pooling Along a Fixed Delivery Route Using a Dynamic Inventory-Allocation Policy (Q4849348) (← links)
- (Q5689811) (← links)