The following pages link to Timothy J. Lowe (Q224841):
Displayed 50 items.
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- On worst-case aggregation analysis for network location problems (Q689246) (← links)
- The stochastic \(p\)-hub center problem with service-level constraints (Q833535) (← links)
- The \(p\)-hub center allocation problem (Q852943) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- Channel coordination in a consignment contract (Q992694) (← links)
- The \(k\)-centrum shortest path problem (Q997931) (← links)
- Item:Q224841 (redirect page) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- The location of central structures in trees (Q1097827) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
- Locating an absolute center on graphs that are almost trees (Q1263510) (← links)
- Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
- An improved lower bound for the multimedian location problem (Q1872010) (← links)
- A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
- Coordinating the supply chain in the agricultural seed industry (Q2456431) (← links)
- Product price alignment with seller service rating and consumer satisfaction (Q2678615) (← links)
- (Q3147662) (← links)
- On Efficient Solutions to Multiple Objective Mathematical Programs (Q3216460) (← links)
- Parameter estimation for the EOQ lot-size model: Minimax and expected value choices (Q3309409) (← links)
- (Q3351134) (← links)
- Locating A Median Subtree On A Network (Q3359989) (← links)
- (Q3404168) (← links)
- (Q3479805) (← links)
- Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs (Q3635004) (← links)
- State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems (Q3659493) (← links)
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure (Q3659494) (← links)
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872) (← links)
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic (Q3775351) (← links)
- (Q3795467) (← links)
- Locating Two Facilities on a Tree Subject to Distance Constraints (Q3796939) (← links)
- (Q3798450) (← links)
- Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems (Q3829319) (← links)
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case (Q3963619) (← links)
- Dominance and Decomposition Heuristics for Single Machine Scheduling (Q3980517) (← links)
- m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (Q3990564) (← links)
- The generalized <i>P</i>‐forest problem on a tree network (Q3993630) (← links)
- Convex Location Problems on Tree Networks (Q4109496) (← links)
- The Generalized Market Area Problem (Q4126010) (← links)
- Distance Constraints for Tree Network Multifacility Location Problems (Q4166605) (← links)
- A subgradient algorithm for certain minimax and minisum problems (Q4174536) (← links)
- Error-bound driven demand point aggregation for the rectilinear distance p-center model (Q4228765) (← links)
- (Q4229617) (← links)
- (Q4229637) (← links)
- (Q4238570) (← links)
- (Q4248931) (← links)
- Technical Note—On the Equivalence of Dual Methods for Two Location Problems (Q4280738) (← links)
- Solving Structured Multifacility Location Problems Efficiently (Q4302927) (← links)