Mathieu Tanneau
Mathieu Tanneau
Coarse roadmap towards implementing the reductions described in [this paper](https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.2018.0857) (which is, AFAIK, the most comprehensive and recent paper on the subject). The table below follows the paper's structure, namely:...
Current progress on upgrading legacy code to the new convention (i.e., rules, reductions and `apply!`-based syntax). * [x] Empty row (#13) * [ ] Row singleton * [ ] Forcing/Dominated...
This is mostly straightforward. One open question: how should we handle unbounded columns with close-to-zero objective? For instance: if a problem has an empty column with no lower bound and...
The question of how MIP reductions (resp. LP reductions) should handle continuous (resp integer) variables has come up a few times now. It might make sense to fully separate LP...
If we want to be able to use [Multifloats.jl](https://github.com/dzhang314/MultiFloats.jl), we need to be careful about arithmetic operations with `Inf`. Our current implementation relies on conventions like `Inf + 1 ==...
Dear PGLib team, Would it be possible to create DOIs and bibtex-like citations for specific versions of PGLib? It can be done with, e.g., [Zenodo](https://zenodo.org/). This would help a lot...
```julia import Gurobi import MathOptInterface MOI = MathOptInterface m = Gurobi.Optimizer() x = MOI.add_variable(m) # Create two linear constraints, wrapped in a single VectorAffineFunction constraint n = 2 c1 =...
The `make_basic_network` function is slow for large networks. The timings below were obtained with `@time make_basic_network(data)` where `data` was loaded with the PGLib package. | Case | #buses | time...
The current version (v0.21.2) supports [`calc_basic_ptdf_matrix`](https://lanl-ansi.github.io/PowerModels.jl/stable/basic-data-utilities/#PowerModels.calc_basic_ptdf_matrix), but there is no Line Outage Distribution Factor (LODF) matrix computation utility. I have a working implementation that I would be happy to contribute...