The following pages link to Les R. Foulds (Q486407):
Displaying 43 items.
- Turning restriction design in traffic networks with a budget constraint (Q486412) (← links)
- A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing (Q499379) (← links)
- A network flow model of group technology (Q597530) (← links)
- Construction properties of combinatorial deltahedra (Q599825) (← links)
- (Q1026566) (redirect page) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- Testing the theory of evolution: A novel application of combinatorial optimization (Q1084042) (← links)
- Enumerating phylogenetic trees with multiple labels (Q1112830) (← links)
- Proving phylogenetic trees minimal with l-clustering and set partitioning (Q1144514) (← links)
- Comparison of phylogenetic trees (Q1148241) (← links)
- The Steiner problem in phylogeny is NP-complete (Q1167073) (← links)
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time (Q1167074) (← links)
- Graph theory applications (Q1189421) (← links)
- A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network (Q1197968) (← links)
- Integer programming approaches to facilities layout models with forbidden areas (Q1265901) (← links)
- Integrating the analytic hierarchy process and graph theory to model facilities layout (Q1270622) (← links)
- Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs (Q1288216) (← links)
- Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217) (← links)
- Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case (Q1288289) (← links)
- An exact algorithm for a milk tanker scheduling and sequencing problem (Q1290167) (← links)
- A variation of the generalized assignment problem arising in the New Zealand dairy industry (Q1357774) (← links)
- On center cycles in grid graphs (Q1413759) (← links)
- Modelling and solving central cycle problems with integer programming. (Q1427116) (← links)
- A positive linear discrete-time model of capacity planning and its controllability properties (Q1764970) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← links)
- Open-independent, open-locating-dominating sets in complementary prism graphs (Q2132352) (← links)
- A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
- A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data (Q2356223) (← links)
- Optimal bin location and sequencing in printed circuit board assembly (Q2367380) (← links)
- A probabilistic dynamic programming model of rape seed harvesting (Q2505258) (← links)
- Dynamic network flow models of sustainable grain silo location (Q2505313) (← links)
- The sustainable cell formation problem: manufacturing cell creation with machine modification costs (Q2571192) (← links)
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent (Q3042824) (← links)
- (Q3328567) (← links)
- An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles (Q3337497) (← links)
- (Q3338271) (← links)
- (Q3347592) (← links)
- (Q3347902) (← links)
- (Q3352823) (← links)
- Scheduling contractors' farm‐to‐farm crop harvesting operations (Q5488239) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
