Yeo Anders

Anders Yeo

Information about the author Anders Yeo will soon be added to the site.
Found 9 papers in total
A proof of a conjecture on diameter 2‐critical graphs whose complements are claw‐free
A proof of a conjecture on diameter 2‐critical graphs whose complements are claw‐free
2011
A graph G is diameter 2‐critical if its diameter is 2, and the deletion of any...
The greedy algorithm for the symmetric traveling salesman problem
The greedy algorithm for the symmetric traveling salesman problem
2007
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and...
On-line bin packing with two item sizes
On-line bin packing with two item sizes
2006
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of...
A problem of finding an acceptable variant in generalized project networks
A problem of finding an acceptable variant in generalized project networks
2005
A project network often has some activities or groups of activities which can be...
Batched bin packing
Batched bin packing
2005
We introduce and study the batched bin packing problem (BBPP), a bin packing problem...
When the greedy algorithm fails
When the greedy algorithm fails
2004
We provide a characterization of the cases when the greedy algorithm may produce the...
TSP tour domination and Hamilton cycle decompositions of regular digraphs
TSP tour domination and Hamilton cycle decompositions of regular digraphs
2001
In this paper, we solve a problem by Glover and Punnen from the context of domination...
Construction heuristics for the asymmetric traveling salesman problem
Construction heuristics for the asymmetric traveling salesman problem
2001
Non-Euclidean traveling salesman problem (TSP) construction heuristics, and especially...
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
1999
A neighbourhood N ( T ) of a tour T (in the travelling salesman problem (TSP) with n...
Papers per page: