The following pages link to Richard L. Francis (Q458943):
Displaying 50 items.
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- On worst-case aggregation analysis for network location problems (Q689246) (← links)
- (Q754776) (redirect page) (← links)
- Efficiency in integral facility design problems (Q754778) (← links)
- Demand point aggregation for planar covering location models (Q816417) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- The Euclidean inscribed polygon (Q968643) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- On characterizing supremum and \(l_ p-\)efficient facility designs (Q1144499) (← links)
- Finding efficient solutions for rectilinear distance location problems efficiently (Q1148204) (← links)
- Locational analysis (Q1173002) (← links)
- A \(p\)-center grid-positioning aggregation procedure (Q1304506) (← links)
- (Q1407408) (redirect page) (← links)
- The deceptive primes to \(2\cdot 10^7\) (Q1407410) (← links)
- Modern mathematical milestones: Morley's mystery (Q1407449) (← links)
- A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
- Primes, semi-primes, and strong composites (Q2504154) (← links)
- Long-ago problems for the student of today (Q2504157) (← links)
- Can't see the math for the problems (Q2504187) (← links)
- Probable prime predicaments (Q2504256) (← links)
- A renaissance of geometric constructions (Q2504274) (← links)
- Some duality relationships for the generalized Neyman-Pearson problem (Q2532763) (← links)
- Duality relationships for a nonlinear version of the generalized Neyman- Pearson problem (Q2554174) (← links)
- Between consecutive squares (Q2567536) (← links)
- (Q3147662) (← links)
- Mathematical Haystacks: Another Look at Repunit Numbers (Q3150570) (← links)
- (Q3351134) (← links)
- (Q3353082) (← links)
- (Q3404168) (← links)
- A minimum-length covering subtree of a tree (Q3479805) (← 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)
- (Q3688061) (← links)
- Locating Two Facilities on a Tree Subject to Distance Constraints (Q3796939) (← links)
- Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems (Q3829319) (← links)
- Some Layout Problems on the Line with Interdistance Constraints and Costs (Q3859537) (← links)
- A "Uniformity Principle" for Evacuation Route Allocation (Q3926353) (← links)
- Distance-constrained multifacility minimax location problems on tree networks (Q3989543) (← links)
- (Q4096245) (← links)
- Convex Location Problems on Tree Networks (Q4109496) (← links)
- A Least Total Distance Facility Configuration Problem Involving Lattice Points (Q4120337) (← links)
- Distance Constraints for Tree Network Multifacility Location Problems (Q4166605) (← links)
- (Q4193538) (← links)
- A note on a nonlinear minimax location problem in tree networks (Q4196264) (← links)
- Error-bound driven demand point aggregation for the rectilinear distance p-center model (Q4228765) (← links)
- Locating the paper trail: A personal perspective (Q4228778) (← links)
- (Q4229617) (← links)
- (Q4277677) (← links)
- (Q4359751) (← links)
- Bottleneck Resource Allocation in Manufacturing (Q4363727) (← links)
