output
20032026
most citedEnabling Research through the SCIP Optimization Suite 8.0

67 citations

Showing 2024Show all

5 papers · 1 filter

cs.AI20246 cited

A Random-Key Optimizer for Combinatorial Optimization

Antonio A. Chaves, Mauricio G. C. Resende, Martin J. A. Schuetz +4

This paper introduces the Random-Key Optimizer (RKO), a versatile and efficient stochastic local search method tailored for combinatorial optimization problems. Using the random-ke…

math.NT20241 cited

A Mean Value Theorem for general Dirichlet Series

Frederik Broucke, Titus Hilberdink

In this paper we obtain a mean value theorem for a general Dirichlet series with positive coefficients for which the counting function $A(x)…

cs.LO20241 cited

Integer Linear-Exponential Programming in NP by Quantifier Elimination

Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak

This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer line…

cond-mat.str-el20246 cited

Breakdown of order-fractionalization in the CPT model

Aaditya Panigrahi, Alexei Tsvelik, Piers Coleman

We present an analysis of the half-filled CPT model, an analytically tractable Kondo lattice model with Yao-Lee spin-spin interactions on a 3D hyperoctagon lattice, proposed by Col…

math.CO2024

Bijections between Variants of Dyck Paths and Integer Compositions

Manosij Ghosh Dastidar, Michael Wallner

We give bijective results between several variants of lattice paths of length (or ) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{…