Zobrazeno 1 - 10
of 11 722
pro vyhledávání: '"Beck, J"'
The quadratic traveling salesperson problem (QTSP) is a generalization of the traveling salesperson problem, in which all triples of consecutive customers in a tour determine the travel cost. We propose compact optimization models for QTSP in mixed-i
Externí odkaz:
http://arxiv.org/abs/2408.16680
We study the relationship between the discrete and the continuous versions of the Kronecker--Weyl equidistribution theorem, as well as their possible extension to manifolds in higher dimensions. We also investigate a way to deduce in some limited way
Externí odkaz:
http://arxiv.org/abs/2404.00077
We study some new dynamical systems where the corresponding piecewise linear flow is neither time reversible nor measure preserving. We create a dissipative system by starting with a finite polysquare translation surface, and then modifying it by inc
Externí odkaz:
http://arxiv.org/abs/2404.00078
We extend the famous result of Katok and Zemlyakov on the density of half-infinite geodesics on finite flat rational surfaces to half-infinite geodesics on a finite polycube translation $3$-manifold. We also extend this original result to establish a
Externí odkaz:
http://arxiv.org/abs/2403.19960
Almost nothing is known concerning the extension of $3$-dimensional Kronecker--Weyl equidistribution theorem on geodesic flow from the unit torus $[0,1)^3$ to non-integrable finite polycube translation $3$-manifolds. In the special case when a finite
Externí odkaz:
http://arxiv.org/abs/2403.19958
The class of 2-dimensional non-integrable flat dynamical systems has a rather extensive literature with many deep results, but the methods developed for this type of problems, both the traditional approach via Teichm\"{u}ller geometry and our recent
Externí odkaz:
http://arxiv.org/abs/2403.19954
Autor:
Zhang, Jiachen, Beck, J. Christopher
We propose domain-independent dynamic programming (DIDP) and constraint programming (CP) models to exactly solve type-1 and type-2 assembly line balancing problem with sequence-dependent setup times (SUALBP). The goal is to assign tasks to assembly s
Externí odkaz:
http://arxiv.org/abs/2403.06780
Autor:
Kuroiwa, Ryo, Beck, J. Christopher
For combinatorial optimization problems, model-based paradigms such as mixed-integer programming (MIP) and constraint programming (CP) aim to decouple modeling and solving a problem: the `holy grail' of declarative problem solving. We propose domain-
Externí odkaz:
http://arxiv.org/abs/2401.13883
Fully Observable Non-Deterministic (FOND) planning is a variant of classical symbolic planning in which actions are nondeterministic, with an action's outcome known only upon execution. It is a popular planning paradigm with applications ranging from
Externí odkaz:
http://arxiv.org/abs/2312.11675