Branch and bound method for sensor scheduling in discrete time
From MaRDI portal
Publication:2583324
DOI10.3934/jimo.2005.1.499zbMath1127.90353OpenAlexW2314798192MaRDI QIDQ2583324
Publication date: 16 January 2006
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2005.1.499
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Robust design of sensor fusion problem in discrete time ⋮ Manifold relaxations for integer programming ⋮ Hybrid method for a general optimal sensor scheduling problem in discrete time ⋮ Optimal switching signal design with a cost on switching action ⋮ Sensor deployment for pipeline leakage detection via optimal boundary control strategies ⋮ On the global optimal solution for linear quadratic problems of switched system
This page was built for publication: Branch and bound method for sensor scheduling in discrete time
