scientific article; zbMATH DE number 6860804
From MaRDI portal
Publication:4637014
zbMath1440.90083arXiv1701.05654MaRDI QIDQ4637014
No author found.
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1701.05654
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Sparse inverse covariance estimation with the graphical lasso
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- A branch and bound algorithm for the acyclic subgraph problem
- More facets from fences for linear ordering and acyclic subgraph polytopes
- Approximations for the maximum acyclic subgraph problem
- Approximating minimum feedback sets and multicuts in directed graphs
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Learning Bayesian networks: The combination of knowledge and statistical data
- Lifting for mixed integer programs with variable upper bounds
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Reducibility Among Combinatorial Problems
- Learning Causal Bayesian Network Structures From Experimental Data
- On the acyclic subgraph polytope
- Finding a minimum feedback arc set in reducible flow graphs
- A Minimax Theorem for Directed Graphs
- The strongest facets of the acyclic subgraph polytope are unknown
- Exclusion Regions for Systems of Equations
- New Facets of the Linear Ordering Polytope
- 10.1162/153244303321897717
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
This page was built for publication:
