Timothy J. Lowe

From MaRDI portal
Person:224841

Available identifiers

zbMath Open lowe.timothy-jMaRDI QIDQ224841

List of research outcomes





PublicationDate of PublicationType
Dangers in using earned duration and other earned value metrics to measure a project's schedule performance2023-06-27Paper
Product price alignment with seller service rating and consumer satisfaction2023-01-23Paper
Exact Solution of Two Location Problems via Branch-and-Bound2016-12-16Paper
Comparative error bound theory for three location models: continuous demand versus discrete demand2014-10-08Paper
Channel coordination in a consignment contract2010-09-09Paper
https://portal.mardi4nfdi.de/entity/Q34041682010-02-08Paper
The stochastic \(p\)-hub center problem with service-level constraints2009-08-14Paper
Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs2009-07-03Paper
Aggregation error for location models: Survey and analysis2009-06-25Paper
Coordinating the supply chain in the agricultural seed industry2007-10-18Paper
The \(k\)-centrum shortest path problem2007-08-08Paper
The \(p\)-hub center allocation problem2006-11-15Paper
Upgrading arcs to minimize the maximum travel time in a network2006-05-16Paper
A framework for demand point and solution space aggregation analysis for location models2004-11-22Paper
Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems2004-03-15Paper
An improved lower bound for the multimedian location problem2003-05-04Paper
https://portal.mardi4nfdi.de/entity/Q31476622002-09-22Paper
Worst-case incremental analysis for a class ofp-facility location problems2002-07-01Paper
Aggregation Error Bounds for a Class of Location Models2002-06-04Paper
Screening location strategies to reduce exchange rate risk2002-01-23Paper
https://portal.mardi4nfdi.de/entity/Q47006482000-07-25Paper
https://portal.mardi4nfdi.de/entity/Q42385701999-10-04Paper
Solving a selected class of location problems by exploiting problem structure: A decomposition approach1999-06-10Paper
Error-bound driven demand point aggregation for the rectilinear distance p-center model1999-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42296171999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q42296371999-02-22Paper
Structured \(p\)-facility location problems on the line solvable in polynomial time1998-03-18Paper
Row-Column Aggregation for Rectilinear Distance p-Median Problems1997-01-07Paper
https://portal.mardi4nfdi.de/entity/Q56898111997-01-07Paper
Specially Structured Uncapacitated Facility Location Problems1996-10-27Paper
Solving Structured Multifacility Location Problems Efficiently1994-08-21Paper
Locating facilities which interact: Some solvable cases1994-06-23Paper
Technical Note—On the Equivalence of Dual Methods for Two Location Problems1994-02-24Paper
On worst-case aggregation analysis for network location problems1993-12-20Paper
An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree1993-04-01Paper
Flow network design for manufacturing systems layout1993-01-16Paper
The generalized P‐forest problem on a tree network1992-07-23Paper
m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases1992-06-28Paper
Dominance and Decomposition Heuristics for Single Machine Scheduling1992-06-26Paper
Locating A Median Subtree On A Network1991-01-01Paper
Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products1990-01-01Paper
Locating an absolute center on graphs that are almost trees1990-01-01Paper
A minimum-length covering subtree of a tree1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33511341990-01-01Paper
Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems1989-01-01Paper
A minimum length covering subgraph of a network1989-01-01Paper
The determination of optimal base-stock inventory policy when the costs of under- and oversupply are uncertain1988-01-01Paper
Locating Two Facilities on a Tree Subject to Distance Constraints1988-01-01Paper
The location of central structures in trees1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37954671988-01-01Paper
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic1987-01-01Paper
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices1986-01-01Paper
On Efficient Solutions to Multiple Objective Mathematical Programs1984-01-01Paper
State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems1983-01-01Paper
State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure1983-01-01Paper
Parameter estimation for the EOQ lot-size model: Minimax and expected value choices1983-01-01Paper
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case1982-01-01Paper
A subgradient algorithm for certain minimax and minisum problems1978-01-01Paper
Distance Constraints for Tree Network Multifacility Location Problems1978-01-01Paper
Convex Location Problems on Tree Networks1976-01-01Paper
The Generalized Market Area Problem1976-01-01Paper

Research outcomes over time

This page was built for person: Timothy J. Lowe