We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Abstract. This work discusses the Memory Architecture for Reconfigurable Computers (MARC), a scalable, device-independent memory interface that supports both irregular (via configu...