Integer linear programming formulations of the filter partitioning minimization problem

DOI10.1007/s10878-020-00609-wzbMath1447.90051OpenAlexW3035922524MaRDI QIDQ782755

Jason M. O'Kane, Hazhar Rahmani

Publication date: 29 July 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00609-w

zbMATH Keywords

combinatorial optimizationinteger linear programmingstate space reductionautomata minimizationcombinatorial filters

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

Cover Combinatorial Filters and Their Minimization Problem

Cites Work

• Orienting polygonal parts without sensors
• Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability
• Cliques, holes and the vertex coloring polytope
• New integer linear programming models for the vertex coloring problem
• A cutting plane algorithm for graph coloring
• On the asymmetric representatives formulation for the vertex coloring problem
• Robust bayesian estimation for the linear model and robustifying the Kalman filter
• Graph Coloring Lower Bounds from Decision Diagrams
• Planning Algorithms

This page was built for publication: Integer linear programming formulations of the filter partitioning minimization problem