Integer linear programming formulations of the filter partitioning minimization problem
type: Item
instance of: scholarly article
title: Integer linear programming formulations of the filter partitioning minimization problem
zbMATH Open document ID: 1447.90051
author: Hazhar Rahmani
author: Jason M. O'Kane
published in: Journal of Combinatorial Optimization
publication date: 2020-07-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7225489
zbMATH Keywords: combinatorial filters
zbMATH Keywords: state space reduction
zbMATH Keywords: integer linear programming
zbMATH Keywords: automata minimization
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: s10878-020-00609-w
OpenAlex ID: W3035922524
cites work: Cliques, holes and the vertex coloring polytope
cites work: On the asymmetric representatives formulation for the vertex coloring problem
cites work: Orienting polygonal parts without sensors
cites work: New integer linear programming models for the vertex coloring problem
cites work: Planning Algorithms
cites work: Robust bayesian estimation for the linear model and robustifying the Kalman filter
cites work: A cutting plane algorithm for graph coloring
cites work: Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability
cites work: Graph Coloring Lower Bounds from Decision Diagrams
DOI: 10.1007/S10878-020-00609-W
description: scientific article; zbMATH DE number 7225489