Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
local searchinteger linear programmingHamiltonian decompositionsubtour elimination constraintsvariable neighborhood descent1-skeletontraveling salesperson polytopechain edge fixingDantzig-Fulkerson-Johnson formulationedge-disjoint 2-factorsMiller-Tucker-Zemlin formulation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Mathematical programming (90Cxx)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
- A note on Hamilton decompositions of even-regular multigraphs
- Finding and enumerating Hamilton cycles in 4-regular graphs
- Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
- On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3659288 (Why is no real title available?)
- scientific article; zbMATH DE number 3485514 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- A Short Proof of the Factor Theorem for Finite Graphs
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
- Adjacency on the constrained assignment problem
- An efficient algorithm for the minimum capacity cut problem
- Combinatorial and geometric properties of the max-cut and min-cut problems
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
- Error-correcting codes from permutation groups
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
- Integer Programming Formulation of Traveling Salesman Problems
- NP-completeness of some problems of partitioning and covering in graphs
- Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
- On pedigree polytopes and Hamiltonian cycles
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- On the skeleton of the polytope of pyramidal tours
- On vertex adjacencies in the polytope of pyramidal tours with step-backs
- Paths, Trees, and Flowers
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Reducibility among combinatorial problems
- Signature Methods for the Assignment Problem
- Simplex pivots on the set packing polytope
- Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
- Solution of a Large-Scale Traveling-Salesman Problem
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- The Hirsch conjecture for the fractional stable set polytope
- The adjacency relation on the traveling salesman polytope is NP-Complete
- The number of Hamiltonian decompositions of regular graphs
- The traveling salesman problem. A computational study.
- The wonderful Walecki construction
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- Vertex adjacencies in the set covering polyhedron
This page was built for publication: Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645186)
