88 citations · 120 across the 12 of their papers we have counts for
13 papers
QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization
Pedro Maciel Xavier, Pedro Ripper, Tiago Andrade +3
We present QUBO.jl, an end-to-end Julia package for working with QUBO (Quadratic Unconstrained Binary Optimization) instances. This tool aims to convert a broad range of optimizati…
Graphs whose vertices of degree at least 2 lie in a triangle
Vinicius L. do Forte, Min Chih Lin, Abilio Lucena +3
A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle…
Cycle-based formulations in Distance Geometry
Leo Liberti, Gabriele Iommazzo, Carlile Lavor +1
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight s…
New error measures and methods for realizing protein graphs from distance data
Claudia D'Ambrosio, Ky Vu, Carlile Lavor +2
The interval Distance Geometry Problem (iDGP) consists in finding a realization in of a simple undirected graph with nonnegative intervals assigned to the…
Distance geometry approach for special graph coloring problems
Rosiane de Freitas, Bruno Dias, Nelson Maculan +1
One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or…
A speed and departure time optimization algorithm for the Pollution-Routing Problem
Raphael Kramer, Nelson Maculan, Anand Subramanian +1
We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified optimal schedule. Thi…