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

DOI10.1137/040603048MaRDI QIDQ3440211zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal algorithms for constrained 1-center problems
• Publication:5751489
• A new sequential optimality condition for constrained optimization and algorithmic consequences
• scientific article; zbMATH DE number 2219758
• scientific article; zbMATH DE number 15474
• Optimization over degree sequences
• scientific article; zbMATH DE number 2196283
• On an optimization problem with nested constraints
• Minimizing and Stationary Sequences of Constrained Optimization Problems
• Constraint ordinal optimization

Cited in

(10)

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

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)