- On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
- Cycles and Paths in Semicomplete Multipartite Digraphs, Theorems and Algorithms: A Survey
- Out-branchings with Extremal Number of Leaves Jrgen Bang-Jensen
- Transformations of Generalized ATSP into ATSP D. Ben-Arieh
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles
- Traveling salesman should not be greedy: domination analysis of greedytype heuristics for the TSP
- Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP
- Note on Upper Bounds for TSP Domination Number Gregory Gutin, Angela Koller and Anders Yeo
- Hamilton Cycles in Digraphs of Unitary Matrices S. Severini
- Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs
- Generalizations of tournaments: A survey Jrgen Bang-Jensen
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- An approximate algorithm for combinatorial optimization problems with two parameters
- When n-cycles in n-partite tournaments are longest cycles Gregory Gutin
- On the number of quasi-kernels in digraphs Gregory Gutin
- 5.2 INDEPENDENCE AND CLIQUES 745min 4{26{2003 Gregory Gutin, Royal Holloway, University of London
- Exponential neighbourhood local search for the traveling salesman problem
- Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- The Greedy Algorithm for the Symmetric TSP Gregory Gutin
- Fixed-Parameter Complexity of Minimum Profile Gregory Gutin
- Tolerance-based greedy algorithms for the traveling salesman problem
- Note on edge-colored graphs and digraphs without properly colored cycles
- Orientations of digraphs almost preserving diameter Gregory Gutin
- Convex sets in acyclic digraphs Paul Balister # Stefanie Gerke + Gregory Gutin #
- An algorithm for finding input-output constrained convex sets in an acyclic digraph
- Note on alternating directed cycles Gregory Gutin
- Alternating cycles and trails in 2-edge-coloured complete multigraphs
- Kings in semicomplete multipartite digraphs Gregory Gutin
- Quasihamiltonicity: a series of necessary conditions for a digraph to be hamiltonian
- Upper Bounds on ATSP Neighborhood Size Gregory Gutin \Lambda Anders Yeo y
- Assignment Problem based algorithms are impractical for the Generalized TSP
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
- THE TRAVELING SALESMAN PROBLEM AND ITS VARIATIONS
- Weakly Hamiltonian-connected Ordinary multipartite Tournaments
- Construction heuristics for the asymmetric TSP Fred Glover
- MINIMIZING AND MAXIMIZING THE DIAMETER IN ORIENTATIONS OF GRAPHS
- MAXIMIZING TRAVELING SALESMAN PROBLEM FOR SPECIAL MATRICES
- Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete
- Sufficient conditions for a digraph to be Hamiltonian
- Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
- On the number of connected convex subgraphs of a connected acyclic digraph
- Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
- Alternating cycles and paths in edge-coloured multigraphs: a survey
- Algorithms for Generating Convex Sets in Acyclic P. Balister
- Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs. II
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey
- Spanning directed trees with many leaves Fedor V. Fomin
- On-line bin packing with two item sizes Gregory Gutin, Tommy Jensen and Anders Yeo
- Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour
- Remarks on hamiltonian digraphs Gregory Gutin
- Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
- Domination Analysis of Combinatorial Optimization Algorithms and Problems
- THE TRAVELING SALESMAN PROBLEM AND ITS VARIATIONS
- 4.5 TRAVELING SALESMAN AND RELATED PROBLEMS 627min 2{25{2003 Gregory Gutin, Royal Holloway, University of London
- Domination Analysis of Combinatorial Optimization Problems Gregory Gutin
- Minimum Leaf Out-branching and Related Problems Gregory Gutin
- On n-partite tournaments with unique n-cycle Gregory Gutin, Arash Rafiey and Anders Yeo
- Some Parameterized Problems on Digraphs Gregory Gutin
- The Linear Arrangement Problem Parameterized Above Guaranteed Value
- Kernels in planar digraphs Gregory Gutin
- On Complexity of Minimum Leaf Out-Branching Peter Dankelmann
- Introduction to the Minimum Cost Homomorphism Problem for Directed and Undirected Graphs
- Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
- A Dichotomy for Minimum Cost Graph Homomorphisms
- Minimum Cost and List Homomorphisms to Semicomplete Gregory Gutin
- The Greedy Algorithm for the Symmetric TSP Gregory Gutin
- Domination analysis for minimum multiprocessor scheduling Gregory Gutin
- When the greedy algorithm fails Jrgen Bang-Jensen
- Seismic Vessel Problem Gregory Gutin
- A Heuristic for the Resource-Constrained Traveling Salesman Problem
- Mediated Digraphs and Quantum Nonlocality S. Severini
- Ranking the vertices of a complete multipartite paired comparison digraph
- Batched Bin Packing Gregory Gutin, Tommy Jensen and Anders Yeo
- Paths, Trees and Cycles in Tournaments Jrgen Bang-Jensen
- Hamiltonian cycles avoiding prescribed arcs in tournaments
- Paths and cycles in extended and decomposable Jrgen Bang-Jensen
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- FINDING A LONGEST PATH IN A COMPLETE MULTIPARTITE DIGRAPH
- CHARACTERIZATIONS OF VERTEX PANCYCLIC AND PANCYCLIC ORDINARY COMPLETE MULTIPARTITE DIGRAPHS
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete
- Vertex heaviest paths and cycles in quasi-transitive Jrgen Bang-Jensen
- Hamiltonian paths and cycles in hypertournaments Gregory Gutin
- Antimatroids Gregory Gutin \Lambda
