scientific article; zbMATH DE number 7262444

zbMath1455.90141arXiv1612.01966MaRDI QIDQ5126619

No author found.

Publication date: 20 October 2020

Full work available at URL: https://arxiv.org/abs/1612.01966

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer programmingcutting plane/facetnetworks/graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (2)

Solving Graph Problems via Potential Maximal Cliques ⋮ Learning chordal extensions

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chordal editing is fixed-parameter tractable
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
• Positive definite completions of partial Hermitian matrices
• Minimal triangulations of graphs: a survey
• Detecting holes and antiholes in graphs
• On a property of minimal triangulations
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Chordal completions of planar graphs
• Characterizations and algorithmic applications of chordal graph embeddings
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Minimum fill-in of sparse graphs: kernelization and approximation
• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
• Incidence matrices and interval graphs
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
• On the Desirability of Acyclic Database Schemes
• The Use of Linear Graphs in Gauss Elimination
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• The Evolution of the Minimum Degree Ordering Algorithm
• Computing the Minimum Fill-In is NP-Complete
• A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Minimum Fill-in on Circle and Circular-Arc Graphs
• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
• Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
• How to use the minimal separators of a graph for its chordal triangulation
• Approximating the Bandwidth for Asteroidal Triple-Free Graphs
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• A Benders Approach to the Minimum Chordal Completion Problem
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: