The Gilbert and Pollak conjecture - a generalization. - Dan Trietsch; Gabriel Y. Handler (Networks, 1985)

On Highway Fuel and Time Expenditures. - Dan Trietsch; Gabriel Y. Handler (Transp. Sci., 1985)

A Family of Methods for Preliminary Highway Alignment. - Dan Trietsch (Transp. Sci., 1987)

Comprehensive Design of Highway Networks. - Dan Trietsch (Transp. Sci., 1987)

A Decision Support System for Purchasing Management of Large Projects: Special Focus Article. - Boaz Ronen; Dan Trietsch (Oper. Res., 1988)

Interconnecting networks in the plane: The steiner case. - Dan Trietsch (Networks, 1990)

Basic Techniques for Lot Streaming. - Dan Trietsch; Kenneth R. Baker (Oper. Res., 1993)

Optimal multifacility defensive location on planes with rectilinear distances. - Dan Trietsch (Networks, 1993)

Makespan-related criteria for comparing schedules in stochastic environments. - Victor Portougal; Dan Trietsch (J. Oper. Res. Soc., 1998)

Maximizing the number of mixed packages subject to variety constraints. - David J. Robb; Dan Trietsch (Comput. Oper. Res., 1999)

Pseudo-Gilbert-Steiner trees. - Dan Trietsch; J. F. Weng (Networks, 1999)

Stochastic scheduling with optimal customer service. - Victor Portougal; Dan Trietsch (J. Oper. Res. Soc., 2001)

The Think-Piece: Scientific Publishing in the Global Electronic Village Some Thoughts. - Dan Trietsch; Rajendra Akerkar (Int. J. Comput. Sci. Appl., 2005)

Setting due dates in a stochastic single machine environment. - Victor Portougal; Dan Trietsch (Comput. Oper. Res., 2006)

Johnson's problem with stochastic processing times and optimal service level. - Victor Portougal; Dan Trietsch (Eur. J. Oper. Res., 2006)

Minimizing the number of tardy jobs with stochastically-ordered processing times. - Dan Trietsch; Kenneth R. Baker (J. Sched., 2008)

Safe scheduling: Setting due dates in single-machine problems. - Kenneth R. Baker; Dan Trietsch (Eur. J. Oper. Res., 2009)

Optimal Crashing and Buffering of Stochastic Serial Projects. - Dan Trietsch (Int. J. Inf. Technol. Proj. Manag., 2010)

Three heuristic procedures for the stochastic, two-machine flow shop problem. - Kenneth R. Baker; Dan Trietsch (J. Sched., 2011)

Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation. - Dan Trietsch; Lilit Mazmanyan; Lilit Gevorgyan; Kenneth R. Baker (Eur. J. Oper. Res., 2012)

Trading off due-date tightness and job tardiness in a basic scheduling model. - Kenneth R. Baker; Dan Trietsch (J. Sched., 2015)