The following pages link to Brian Q. Rieksts (Q238128):
Displayed 10 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- (Q733514) (redirect page) (← links)
- Two-stage inventory models with a bi-modal transportation cost (Q733515) (← links)
- Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability (Q948654) (← links)
- Power-of-two policies for single-warehouse multi-retailer inventory systems with order frequency discounts (Q1013409) (← links)
- Optimal inventory policies with two modes of freight transportation (Q2462151) (← links)
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS (Q3503008) (← links)
- Technical note: Worst-case performance of power-of-two policies for serial inventory systems with incremental quantity discounts (Q3524596) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- Time-relaxed 1-fault tolerant broadcast networks (Q6483537) (← links)