T. Easton

Available identifiers

Publication	Date of Publication	Type
Two-set inequalities for the binary knapsack polyhedra	2025-01-23	Paper
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming	2022-08-08	Paper
Approximate and exact merging of knapsack constraints with cover inequalities	2021-02-19	Paper
The double pivot simplex method	2018-02-09	Paper
Merging valid inequalities over the multiple knapsack polyhedron	2017-05-31	Paper
Quaternary hyperplane branching with internally generated cutting planes for solving integer programmes	2017-05-31	Paper
Generating class schedules within a complex modular environment with application to secondary schools	2015-11-12	Paper
Solving the multiple platforms configuration problem	2010-11-08	Paper
A large neighborhood search heuristic for the longest common subsequence problem	2008-11-17	Paper
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes	2008-10-29	Paper
https://portal.mardi4nfdi.de/entity/Q3517653	2008-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q5447756	2008-03-20	Paper
Novel evolutionary models and applications to sequence alignment problems	2007-02-05	Paper
Facets of the independent set polytope	2004-03-11	Paper
The linear arrangement problem on recursively constructed graphs	2003-10-29	Paper
On completing latin squares	2002-06-19	Paper
On the complexity of certain completion problems	2002-01-02	Paper
https://portal.mardi4nfdi.de/entity/Q4393287	1998-11-08	Paper

This page was built for person: T. Easton