Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1111/itor.13297 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of ILP formulations for the longest induced path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the feedback vertex set problem on undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm to recognize even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding induced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-in-a-tree problem in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordless paths through three vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-tree problem for graphs of girth at least \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations and branch-and-cut procedures for the longest induced path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact solution approaches for the longest induced path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/ITOR.13297 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:48, 30 December 2024

scientific article; zbMATH DE number 7841035
Language Label Description Also known as
English
Integer programming formulations for the \(k\)-in-a-tree problem in graphs
scientific article; zbMATH DE number 7841035

    Statements

    Integer programming formulations for the \(k\)-in-a-tree problem in graphs (English)
    0 references
    30 April 2024
    0 references
    \(k\)-in-a-tree
    0 references
    induced subgraphs
    0 references
    integer programming
    0 references
    0 references

    Identifiers