2 papers
math.OC2026
Impact of Scaling and Rounding on Metaheuristic Performance for the Vehicle Routing Problem with Time Windows
Florian Rascoussier, Romain Billot, Lina Fahed +1
Classical Euclidean instances for the Vehicle Routing Problem with Time Windows (VRPTW) have floating-point arc costs derived from node coordinates. This raises reproducibility and…
cs.AR2026
Decompose, Optimize, and Reconstruct: Very Large Constant Multiplication at Scale
Théo Cantaloube, Nicolai Fiege, Anastasia Volkova +1
Efficient arithmetic circuit design for resourceconstrained hardware involves challenging combinatorial optimization problems, among which Multiple Constant Multiplication (MCM) is…