Releases: GiggleLiu/ProblemReductions.jl
Releases · GiggleLiu/ProblemReductions.jl
v0.2.3
ProblemReductions v0.2.3
Merged pull requests:
- New: Set Packing => Independent Set (#124) (@SciCodePhy)
- New: Independent set to vertex covering (#126) (@c-allergic)
- Fix maximum matching problem (#128) (@GiggleLiu)
- New: Reduction from Matching to Set Packing (#129) (@c-allergic)
Closed issues:
- Errors when using findbest to solve Matching (#127)
v0.2.2
ProblemReductions v0.2.2
Merged pull requests:
v0.2.1
ProblemReductions v0.2.1
Merged pull requests:
- Fix energy based modeling of problems (#118) (@GiggleLiu)
Closed issues:
- Separate the core package out (#108)
v0.2.0
ProblemReductions v0.2.0
Merged pull requests:
- Friendly error people when the type signature is not correct (#113) (@GiggleLiu)
- Polish documents (#114) (@GiggleLiu)
- Refactor 2.0 (#116) (@GiggleLiu)
- Refactor interface for generic tensor networks (#117) (@GiggleLiu)
v0.1.1
ProblemReductions v0.1.1
Merged pull requests:
- New Reduction: SAT to Circuit SAT (#89) (@SciCodePhy)
- Ising machines document (#93) (@c-allergic)
- Factoring documentation (#94) (@c-allergic)
- Coloring document (#95) (@c-allergic)
- Maxcut doctument (#96) (@c-allergic)
- Set Covering document (#97) (@c-allergic)
- Independent Set Document (#98) (@SciCodePhy)
- Fix the Typo of Spin Glass Documentation; Dominating Set Documentation (#99) (@SciCodePhy)
- Set Packing Documentation (#100) (@SciCodePhy)
- QUBO Documentation (#101) (@SciCodePhy)
- SAT documentation (#102) (@SciCodePhy)
- Vertex Covering Documentation (#103) (@SciCodePhy)
- Documentation: Independent Set -> Set Packing (#104) (@SciCodePhy)
- Documentation: Update "Problem Reduction Rules" (#105) (@SciCodePhy)
- Refactor (#106) (@GiggleLiu)
- Bump codecov/codecov-action from 4 to 5 (#109) (@dependabot[bot])
- Merge API reduceto (#110) (@GiggleLiu)
- Refactor grid graph (#112) (@GiggleLiu)
Closed issues:
v0.1.0
ProblemReductions v0.1.0
Merged pull requests:
- Bump julia-actions/setup-julia from 1 to 2 (#1) (@dependabot[bot])
- Bump codecov/codecov-action from 3 to 4 (#2) (@dependabot[bot])
- Bump julia-actions/cache from 1 to 2 (#3) (@dependabot[bot])
- CompatHelper: add new compat entry for BitBasis at version 0.9, (keep existing compat) (#4) (@github-actions[bot])
- CompatHelper: bump compat for UnitDiskMapping to 0.4, (keep existing compat) (#7) (@github-actions[bot])
- Add a new example (#20) (@GiggleLiu)
- Jg/example1 (#21) (@GiggleLiu)
- Logic circuit to spin-glass (#26) (@GiggleLiu)
- Model and rules interfaces (#31) (@GiggleLiu)
- Clean up files, update descriptions (#33) (@GiggleLiu)
- Implement the edge iterators for the constrained topology problem types (#34) (@hmyuuu)
- Fix coloring model (#36) (@GiggleLiu)
- Add Statisfiability Problem (#37) (@SciCodePhy)
- Set covering (#39) (@c-allergic)
- Fix set cover (#41) (@GiggleLiu)
- New: MaxCut model (#42) (@c-allergic)
- remove
terms
interface (#43) (@GiggleLiu) - New: Reduction between simple kinds of SpinGlass and MaxCut problems (#44) (@c-allergic)
- Add a new type: Independent Set (without weights) (Renamed) (#46) (@SciCodePhy)
- Add a new type: Dominating Set problem (without weights) (#48) (@SciCodePhy)
- New: Vertex Covering model (#49) (@c-allergic)
- Add a new type: Set Packing Problem (without weights) (#51) (@SciCodePhy)
- Fix Set Covering: Update doc (pre-compilng) and variables (#52) (@SciCodePhy)
- New: Reduction from vertex covering to set covering (#53) (@c-allergic)
- Add a new type: QUBO (#54) (@SciCodePhy)
- Update QUBO: construct QUBO from graph (#55) (@SciCodePhy)
- New: reduction from Sat to Coloring (#56) (@c-allergic)
- Clean up: unnecessary type deduction (#57) (@c-allergic)
- Add: Reduction from SpinGlass{HyperGraph} -> MaxCut (#61) (@c-allergic)
- [WIP] New factoring (#62) (@GiggleLiu)
- New Reduction Rule: General SAT to 3-SAT (#63) (@SciCodePhy)
- New Reduction Rule: 3-SAT to Independent Set Problem (#65) (@SciCodePhy)
- Problem reduction from QUBO to spinglass (#66) (@GiggleLiu)
- Implement reduction path (#68) (@GiggleLiu)
- Update reduction rule: General SAT to Independent Set (#69) (@SciCodePhy)
- Fix:
xor
symbol and others bugs (#70) (@c-allergic) - Fix Bug: General SAT to Independent Set (#71) (@SciCodePhy)
- New: Maximal Independent Set (#78) (@c-allergic)
- New: matching model (#79) (@c-allergic)
- Refactor satisfiability to independent set reduction (#80) (@GiggleLiu)
- fix:
parameters
andset_parameters
inMatching.jl
and add tests (#81) (@c-allergic) - New Interface: "extract_multiple_solutions" method for all reductions (#82) (@SciCodePhy)
- New: PaintShop model (#83) (@c-allergic)
- New Reduction: SAT to Dominating Set (#84) (@SciCodePhy)
- New Reduction: Independent Set to Set Packing (#85) (@SciCodePhy)
- Minor typo in MaxCut.jl (#87) (@SciCodePhy)
- Revise reduction path (#88) (@GiggleLiu)
- Update README.md (#90) (@GiggleLiu)
- Refactor problem size interface (#91) (@GiggleLiu)
Closed issues:
- Reduce 3-SAT to independent set problems (#11)
- Reduce k-SAT to 3-SAT (#12)
- Reduce from cutting problem to/from spin-glass (#13)
- Reduce 3-SAT problem to coloring problem (#14)
- Setup a testing framework (#15)
- Reduce from 3-SAT to the dominating set problem (#16)
- Reduce independent set problem to set packing problem (#17)
- Reduce set covering problem to vertex covering problem (#18)
- Decision: how to applied to reduction to constrained topology (#19)
- Decision: questionable interfaces (#38)
- Variables Interface in SAT and Set Covering [Need to be discussed] (#50)
- potential problems in SpinGlass.jl (#60)
- Reduction path design and complexity analysis (#64)
- Reduce general SAT to independent problems (#67)
- More models (#75)
- Extract Multiple Solutions Interface (#76)