The following pages link to Todd Easton (Q684155):
Displaying 18 items.
- (Q221668) (redirect page) (← links)
- The double pivot simplex method (Q684156) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Generating class schedules within a complex modular environment with application to secondary schools (Q892836) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Facets of the independent set polytope (Q1424284) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Quaternary hyperplane branching with internally generated cutting planes for solving integer programmes (Q2627305) (← links)
- Merging valid inequalities over the multiple knapsack polyhedron (Q2627629) (← links)
- (Q2716514) (← links)
- Solving the multiple platforms configuration problem (Q3055665) (← links)
- (Q3517653) (← links)
- (Q4393287) (← links)
- The linear arrangement problem on recursively constructed graphs (Q4432765) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- (Q5447756) (← links)
- On completing latin squares (Q5951961) (← links)
