Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms

DOI10.1063/1.1624652zbMath1080.37104OpenAlexW2082454863WikidataQ39677903 ScholiaQ39677903MaRDI QIDQ5705387

Tomasz Nowicki, Charles Tresser

Publication date: 8 November 2005

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.1624652

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamical systems in optimization and economics (37N40)

Related Items

Dynamic of error diffusion on several polytopes ⋮ Error diffusion on acute simplices: invariant tiles ⋮ Bounding the errors for convex dynamics on one or more polytopes

Cites Work

• Fair on-line scheduling of a dynamic set of tasks on a single resource
• The Chairman assignment problem
• Combinatorial computation of characteristic classes
• The isoperimetric theorem for general integrands
• The Wulff shape as the asymptotic limit of a growing crystalline interface
• Proportionate progress: A notion of fairness in resource allocation
• On a distribution problem in finite and countable sets
• Dynamics of non-ergodic piecewise affine maps of the torus
• Renormalization on the n-dimensional torus
• An approach to renormalization on the n-torus
• A decoding problem in dynamics and in number theory
• The Wulff theorem revisited