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

DOI10.1137/040603048zbMATH Open1165.90607OpenAlexW1978127982MaRDI QIDQ3440211FDOQ3440211

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)

Cited In (9)

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

   Recommendations

• Optimal algorithms for constrained 1-center problems 👍 👎
• Title not available (Why is that?) 👍 👎
• A new sequential optimality condition for constrained optimization and algorithmic consequences 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimization over Degree Sequences 👍 👎
• Title not available (Why is that?) 👍 👎
• On an optimization problem with nested constraints 👍 👎
• Minimizing and Stationary Sequences of Constrained Optimization Problems 👍 👎
• Constraint ordinal optimization 👍 👎

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

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