New formulations and branch-and-cut procedures for the longest induced path problem
From MaRDI portal
Publication:2669795
Recommendations
- An experimental study of ILP formulations for the longest induced path problem
- Exact and approximate algorithms for the longest induced path problem
- On exact solution approaches for the longest induced path problem
- Exact approaches for the orderly colored longest path problem: performance comparison
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
Cites work
- A catalog of steiner tree formulations
- A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
- Algorithm 457: finding all cliques of an undirected graph
- Algorithms for maximum weight induced paths
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An experimental study of ILP formulations for the longest induced path problem
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Coloring graphs without short cycles and long induced paths
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Emergence of Scaling in Random Networks
- Exact and approximate algorithms for the longest induced path problem
- Exhaustive search for snake-in-the-box codes
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 434900 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- Introduction to algorithms.
- Mim-width. I. Induced path problems
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- On cliques in graphs
- On exact solution approaches for the longest induced path problem
- Snake-in-the-Box Codes for Rank Modulation
- Snakes, coils, and single-track circuit codes with spread \(k\)
- Solving the feedback vertex set problem on undirected graphs
- Some results on graphs without long induced paths
- The k-regular induced subgraph problem
- The Maximum Weight Connected Subgraph Problem
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Cited in
(12)- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- On exact solution approaches for the longest induced path problem
- An experimental study of ILP formulations for the longest induced path problem
- Exact and approximate algorithms for the longest induced path problem
- MIP formulations for induced graph optimization problems: a tutorial
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
- New formulations and branch-and-cut procedures for the longest induced path problem
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs
- Exact methods for the longest induced cycle problem
- The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
- A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
- Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
This page was built for publication: New formulations and branch-and-cut procedures for the longest induced path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669795)
