Integer programming formulations for the \(k\)-in-a-tree problem in graphs

Cites Work

A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
The \(k\)-in-a-tree problem for graphs of girth at least \(k\)
The three-in-a-tree problem
Chordless paths through three vertices
The four-in-a-tree problem in triangle-free graphs
Classification of travelling salesman problem formulations
Finding induced trees
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
On the complexity of testing for odd holes and induced odd paths
An analytical comparison of different formulations of the travelling salesman problem
The traveling salesman problem: An overview of exact and approximate algorithms
Solving the feedback vertex set problem on undirected graphs
On exact solution approaches for the longest induced path problem
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
An experimental study of ILP formulations for the longest induced path problem
Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
A faster algorithm to recognize even-hole-free graphs
The \(k\)-in-a-path problem for claw-free graphs
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
New formulations and branch-and-cut procedures for the longest induced path problem
Maximal Flow Through a Network
Integer Programming Formulation of Traveling Salesman Problems
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
Solving Steiner tree problems in graphs to optimality
Detecting induced subgraphs

This page was built for publication: Integer programming formulations for the \(k\)-in-a-tree problem in graphs