Brian Q. Rieksts

According to our database, Brian Q. Rieksts authored at least 8 papers between 2002 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2016

Binary linear programming models for robust broadcasting in communication networks.

Ronald G. McGarvey, Brian Q. Rieksts, José A. Ventura, Namsu Ahn

Discret. Appl. Math., 2016

2010

Two-stage inventory models with a bi-modal transportation cost.

Brian Q. Rieksts, José A. Ventura

Comput. Oper. Res., 2010

2009

Time-Relaxed 1-Fault Tolerant Broadcast Networks.

Brian Q. Rieksts, José A. Ventura

Parallel Process. Lett., 2009

Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability.

José A. Ventura, Brian Q. Rieksts

Eur. J. Oper. Res., 2009

Power-of-two policies for single-warehouse multi-retailer inventory systems with order frequency discounts.

Brian Q. Rieksts, José A. Ventura, Yale T. Herer

Comput. Oper. Res., 2009

2008

Optimal inventory policies with two modes of freight transportation.

Brian Q. Rieksts, José A. Ventura

Eur. J. Oper. Res., 2008

2007

A Compounding Algorithm for 1-Fault Tolerant Broadcast Networks.

Brian Q. Rieksts, José A. Ventura

Asia Pac. J. Oper. Res., 2007

2002

The cable trench problem: combining the shortest path and minimum spanning tree problems.

Francis J. Vasko, Robert S. Barbieri, Brian Q. Rieksts, Kenneth L. Reitmeyer, Kenneth L. Stott Jr.

Comput. Oper. Res., 2002