Gutin Gregory

Gregory Gutin

Information about the author Gregory Gutin will soon be added to the site.
Found 17 papers in total
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
2016
The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of...
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
2016
The workflow satisfiability problem ( wsp ) is a problem of practical interest that...
Local search heuristics for the multidimensional assignment problem
Local search heuristics for the multidimensional assignment problem
2011
The Multidimensional Assignment Problem (MAP) (abbreviated s ‐AP in the case of...
Generalized traveling salesman problem reduction algorithms
Generalized traveling salesman problem reduction algorithms
2009
The generalized traveling salesman problem (GTSP) is an extension of the well-known...
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems
2008
Optimization heuristics are often compared with each other to determine which one...
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...
Note on upper bounds for the travelling salesperson problem domination number
Note on upper bounds for the travelling salesperson problem domination number
2006
The domination number, domn (A, n) , of a heuristic A for the Asymmetric TSP is the...
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...
Further extension of the TSP assign neighborhood
Further extension of the TSP assign neighborhood
2005
We introduce a new extension of Punnen's exponential neighborhood for the traveling...
Evaluation of the contract-or-patch heuristic for the asymmetric TSP
Evaluation of the contract-or-patch heuristic for the asymmetric TSP
2005
In this paper tour construction algorithms for the Asymmetric Traveling Salesman...
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...
Exponential neighbourhood local search for the traveling salesman problem
Exponential neighbourhood local search for the traveling salesman problem
1999
We analyse an approach to the TSP, introduced by Punnen, which is a generalization of...
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: