μβ
μβ
Home
Experience
Publications
Posts
Work with me
Contact
Light
Dark
Automatic
julia
Leveraging special graph shapes in Graphs
In a previous post, we pushed the boundaries of the Graphs.jl abstraction to see how conforming the algorithms are to the declared interface, noticing some implied assumptions that were not stated.
Last updated on 2023-10-21
4 min read
Vertex removal in LightGraphs
In various graph-related algorithms, a graph is modified through successive operations, merging, creating and deleting vertices. That’s the case for the Blossom algorithm finding a best matching in a graph and using contractions of nodes.
Last updated on 2020-01-06
6 min read
A take on Benders decomposition in JuMP
Cracking Benders decomposition, one cut at a time.
Last updated on 2023-10-24
8 min read
Variables are not values: types and expressions in mathematical optimization
Some digging in representations for optimization modelling
Last updated on 2023-10-24
10 min read
Picking different names with integer optimization
Making social events easier as a graph problem.
Last updated on 2023-10-21
4 min read
Static lists in Julia
Pushing the type system for more compile-time information
Last updated on 2023-10-24
8 min read
Multiple dispatch - an example for mathematical optimizers
Leveraging one of Julia central features for clearer formulation of an optimization problem.
Last updated on 2023-10-24
8 min read
Winter warm-up: toy models for heat exchangers
Last updated on 2023-10-21
8 min read
Building our own graph type in Julia
Who needs libraries when from scratch looks so good
Last updated on 2023-10-21
6 min read
The cutting stock problem: part 2, solving with column generation
A column generation algorithm for the cutting width problem using Julia and JuMP
Last updated on 2023-10-21
9 min read
«
»
Cite
×