Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
DOI10.1063/1.1624652zbMATH Open1080.37104OpenAlexW2082454863WikidataQ39677903 ScholiaQ39677903MaRDI QIDQ5705387FDOQ5705387
Authors: 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
Recommendations
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)
Cites Work
- Proportionate progress: A notion of fairness in resource allocation
- The Chairman assignment problem
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- The Wulff shape as the asymptotic limit of a growing crystalline interface
- Renormalization on the n-dimensional torus
- The Wulff theorem revisited
- The isoperimetric theorem for general integrands
- Combinatorial computation of characteristic classes
- Dynamics of non-ergodic piecewise affine maps of the torus.
- A decoding problem in dynamics and in number theory
- An approach to renormalization on the n-torus
- On a distribution problem in finite and countable sets
Cited In (7)
- Bounding the errors for convex dynamics on one or more polytopes
- Convex dynamics with constant input
- Convex dynamics: properties of invariant sets
- From greedy to lazy expansions and their driving dynamics
- Convex dynamics and applications
- Error diffusion on acute simplices: invariant tiles
- Dynamic of error diffusion on several polytopes
This page was built for publication: Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705387)
