×

zbMATH — the first resource for mathematics

Easton, Todd

Compute Distance To:
Author ID: easton.todd Recent zbMATH articles by "Easton, Todd"
Published as: Easton, T.; Easton, Todd
External Links: ORCID
Documents Indexed: 15 Publications since 1996

Publications by Year

Citations contained in zbMATH

10 Publications have been cited 28 times in 22 Documents Cited by Year
A large neighborhood search heuristic for the longest common subsequence problem. Zbl 1211.90302
Easton, Todd; Singireddy, Abhilash
5
2008
A specialized branching and fathoming technique for the longest common subsequence problem. Zbl 1213.90263
Easton, Todd; Singireddy, Abhilash
5
2007
Facets of the independent set polytope. Zbl 1060.90078
Easton, Todd; Hooker, Kevin; Lee, Eva K.
5
2003
A solvable case of the optimal linear arrangement problem on Halin graphs. Zbl 0899.05058
Easton, Todd; Horton, Steve; Parker, R. Gary
4
1996
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes. Zbl 1151.90026
Easton, Todd; Hooker, Kevin
3
2008
On completing latin squares. Zbl 0987.05024
Easton, T.; Parker, R. Gary
2
2001
The double pivot simplex method. Zbl 1390.90387
Vitor, Fabio; Easton, Todd
1
2018
Merging valid inequalities over the multiple knapsack polyhedron. Zbl 1362.90297
Hickman, Randal; Easton, Todd
1
2015
Solving the multiple platforms configuration problem. Zbl 1198.90108
Ben-Arieh, D.; Easton, T.; Choubey, A. M.
1
2009
On the complexity of certain completion problems. Zbl 0976.05048
Horton, S. B.; Easton, T.; Parker, R. Gary
1
2000
The double pivot simplex method. Zbl 1390.90387
Vitor, Fabio; Easton, Todd
1
2018
Merging valid inequalities over the multiple knapsack polyhedron. Zbl 1362.90297
Hickman, Randal; Easton, Todd
1
2015
Solving the multiple platforms configuration problem. Zbl 1198.90108
Ben-Arieh, D.; Easton, T.; Choubey, A. M.
1
2009
A large neighborhood search heuristic for the longest common subsequence problem. Zbl 1211.90302
Easton, Todd; Singireddy, Abhilash
5
2008
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes. Zbl 1151.90026
Easton, Todd; Hooker, Kevin
3
2008
A specialized branching and fathoming technique for the longest common subsequence problem. Zbl 1213.90263
Easton, Todd; Singireddy, Abhilash
5
2007
Facets of the independent set polytope. Zbl 1060.90078
Easton, Todd; Hooker, Kevin; Lee, Eva K.
5
2003
On completing latin squares. Zbl 0987.05024
Easton, T.; Parker, R. Gary
2
2001
On the complexity of certain completion problems. Zbl 0976.05048
Horton, S. B.; Easton, T.; Parker, R. Gary
1
2000
A solvable case of the optimal linear arrangement problem on Halin graphs. Zbl 0899.05058
Easton, Todd; Horton, Steve; Parker, R. Gary
4
1996

Citations by Year