Optimizing over Consecutive 1's and Circular 1's Constraints

DOI10.1137/040603048zbMath1165.90607OpenAlexW1978127982MaRDI QIDQ3440211

Dorit S. Hochbaum, Asaf Levin

Publication date: 22 May 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4e98aa7d5d15a8a1b6a7ae2345ccb4d9f2ebf527

zbMATH Keywords

parametric optimizationparametric shortest pathcircular scheduling problemsconsecutive 1's constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (8)

Capacitated Arc Stabbing ⋮ Approximation for the minimum cost doubly resolving set problem ⋮ Group control for consent rules with consecutive qualifications ⋮ On nonlinear multi-covering problems ⋮ The cyclical scheduling problem ⋮ Improved algorithms for the multicut and multiflow problems in rooted trees ⋮ On interval and circular-arc covering problems ⋮ Fragmented coloring of proper interval and split graphs

This page was built for publication: Optimizing over Consecutive 1's and Circular 1's Constraints