Integer linear programming formulations of the filter partitioning minimization problem

DOI10.1007/S10878-020-00609-WMaRDI QIDQ782755zbMATH OpenOpenAlexFDO

Authors Hazhar Rahmani, Jason M. O'Kane

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

automata minimizationcombinatorial filterscombinatorial optimizationinteger linear programmingstate space reduction

Mathematics Subject Classification ID

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

Recommendations

• Cover combinatorial filters and their minimization problem
• Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability
• scientific article; zbMATH DE number 4012317
• Particle interpretation of nonlinear filtering and optimization
• scientific article; zbMATH DE number 3871031

Cites work

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

Cited in

(2)

• Cover combinatorial filters and their minimization problem
• Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782755)