-
Hi, thank you for your excellent work!
After reading your article and code, I want to ask if Hedgehog is applicable to combinatorial optimization problems such as the traveling salesman problem, be…
-
我们图上的组合优化问题,例如 Graph maxcut,下面的论文提出了对图结构进行了编码的方案:
- 论文 Learning Combinatorial Optimization Algorithms over Graphs (宋乐教授)
- 代码 https://github.com/Hanjun-Dai/graphnn
直接复现上面的代码,因为版本问题,不容易,我有以下建议:
-…
-
Hello!
The error is the following.
Note I tried multiple versions of dependencies and multiple people tried the same things.
```shell
new_x, state, acc = stp_burnin(
ValueError: vmap g…
-
**Describe the bug**
I am running into an invalid search space bound error (`Cannot generate a random real if the lower bound is larger than the upper bound`, raised by the `uniform_real_from_range_c…
-
Hello, I have read your paper and open-source code and feel that I have benefited a lot. But as I have just started, there are still some areas that I don't understand that I would like to ask you for…
-
### Hungarian-Algorithm
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal-dual methods.
-
Hi there 👋🏼
First of all, thanks a lot for your library, it has inspired several works in our research group!
We are actively developing [RL4CO](https://github.com/kaist-silab/rl4co), a library fo…
-
https://developers.google.com/optimization
简直就是宝藏!!!
> OR-Tools is open source software for _combinatorial optimization_, which seeks to find the best solution to a problem out of a very large s…
-
### Team Name:
IrrationalQuanta
### Project Description:
The vehicle routing problem (VRP) is a [combinatorial optimization](https://en.wikipedia.org/wiki/Combinatorial_optimization) and [i…
-
Quantum Approximate Optimization Algorithm is a proposed method of finding combinatorial optimization solutions that is somewhat speculated to hold a better approximation ratio than some classical app…