Topic: np-hard Goto Github
Some thing interesting about np-hard
Some thing interesting about np-hard
np-hard,Deep learning and Reinforcement Learning for solving NP-Hard combinatorial problems like TSP.
User: abhijit-15
np-hard,Scala library for solving NP-hard probems
User: agilot
np-hard,Explore different algorithms for Maximum 0-1 Knapsack
User: akphi
np-hard,finding a short spanning walk throw a connected graph (NP-HARD problem)
User: amirhosseinez
np-hard,Interactive travelling salesman problem solver. Branch & bound | Simulated annealing.
User: andrewb330
np-hard,Optimize packages loading (3d-packing more or less)
User: azbesciak
np-hard,Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).
User: bumbac
np-hard,Genetic algorithm implementation to solve the famous NP-hard problem - The Travelling Salesman
User: chaitanyasd
np-hard,2017华为软件精英挑战赛,基于C++实现非JS
User: dutfangxiang
Home Page: http://codecraft.huawei.com/
np-hard,a collection of benchmarks (in DIMACS format) for various NP-Complete problems
Organization: dynaroars
Home Page: https://unsat.github.io/npbench/
np-hard,UAV path planning using Genetic Algorithm
User: elifbalci
np-hard,An implementation of the Particle Swarm Optimization method applied to the specific problem of Bike Sharing Redistribution
User: giacoballoccu
np-hard,This repo encapsulates a Python implementation of the Simulated Annealing Algorithm to solve by means of a "minimum energy state" heuristic the NP-hard n-machines|no preemption|C_max job shop scheduling problem, considering n=2 machines and jobs having release dates. The code was designed and wrote by me. The whole heuristic design, complexity analysis, optimization, and ideas were made possible by team-working with Arianna Montironi and Chiara Panetta. The developed heuristic is the final deliverable of our project work held during the Quantitative Methods for Decision Aid 2021 Class in Politecnico di Torino.
User: jdgiacomantonio-98
np-hard,A List of Papers on Theoretical Foundations of Graph Neural Networks
User: jiaqingxie
np-hard,Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.
User: joshuaguerin
np-hard,Solving Single Machine Schenduling problem with different approaches
User: kariyum
np-hard,Implemented Particle Swarm Optimization to solve vehicle routing problem for MEALPAL business.
User: kunaldeora
np-hard,A hybrid genetic algorithm for the job shop scheduling problem
User: kwh44
np-hard,Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
Organization: lions-epfl
np-hard,A particle swarm optimization algorithm implementation with simultaneous pickup and drop for medicines distribution management.
User: manasiladdha
np-hard,A Crystal port of @mak-it's 2D Bin Packing solver, using the Maximal Rectangles Algorithm.
User: mattkimmel
np-hard,Problem Solving: A Practical Workbook
User: maxtuno
np-hard,Parallel Tabu Search and Genetic Algorithm for the Job Shop Schedule Problem with Sequence Dependent Set Up Times
User: mcfadd
np-hard, This repository contains a Python implementation of a color coding method for the problem of finding a subtree with k vertices in a given graph.
User: mpiorczynski
np-hard,Optimized Delegated Byzantine Fault Tolerance
Organization: neoresearch
Home Page: http://neoresearch.io
np-hard,Repository of scripts and data for the "Robustness and resilience of complex networks" paper by Oriol Artime, Marco Grassia, Manlio De Domenico, James P. Gleeson, Hernán A. Makse, Giuseppe Mangioni, Matjaž Perc and Filippo Radicchi, published at Nature Review Physics (2024). https://doi.org/10.1038/s42254-023-00676-y
Organization: networkdismantling
Home Page: https://rdcu.be/dvsId
np-hard,Repository of the paper "CoreGDM: Geometric Deep Learning Network Decycling and Dismantling" by M. Grassia and G. Mangioni
Organization: networksciencelab
Home Page: https://link.springer.com/chapter/10.1007/978-3-031-28276-8_8
np-hard,Repository of the paper "Machine learning dismantling and early-warning signals of disintegration in complex systems" by M. Grassia, M. De Domenico and G. Mangioni
Organization: networksciencelab
Home Page: https://rdcu.be/cwqp3
np-hard,A branch-and-bound, and A* type algorithm that solves the NP Hard Scheduling problem with the highest possible performance
User: neville-loh
np-hard,Implementation of the paper "Sudoku as a SAT Problem"
User: oniani
np-hard,OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
Organization: optapy
Home Page: https://www.optapy.org/
np-hard,[university] Exploring various algorithms to approximately solve the single machine total weighted tardiness scheduling problem
User: outfrost
np-hard,A challenge to make this basic closest-strings program more efficient.
User: robertvunabandi
np-hard,[IEEE TKDE | TITS 2023] "Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling" | "Neural Airport Ground Handling"
User: royalskye
np-hard,All my implemented solutions of various problems of different online judges and competitions
User: smh997
np-hard,Application Data Distribution in Edge Computing
User: sravi1210
np-hard,Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
User: taylorc1009
np-hard,My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
User: taylorc1009
np-hard,Записките ми за упражнения по "Дизайн и анализ на алгоритми"
User: toduko
Home Page: https://raw.githubusercontent.com/toduko/design-and-analysis-of-algorithms/master/notes.pdf
np-hard,Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
Organization: universidade-livre
np-hard,A Quantum Approximation algorithm for finding the Max-Cut of directed weighted graphs.
User: wasiq-malik
np-hard,Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
User: wector1
np-hard,Go (golang) bindings for Picosat, the satisfiability solver
User: wkschwartz
np-hard,The ripple-spreading algorithm that determines all Pareto-optimal paths for the multi-category multi-objective path optimization problem.
User: xavier-mayiming
np-hard,The ripple-spreading algorithm for the k-color shortest path problem
User: xavier-mayiming
np-hard,The ripple-spreading algorithm that determines all Pareto-optimal paths from one node to all other nodes for the multi-objective shortest path problem.
User: xavier-mayiming
np-hard,2017华为软件精英挑战赛上合赛区 围墙编队
User: xernyuii
Home Page: http://codecraft.huawei.com/home/detail
np-hard,Part of the greedy algorithm used to solve the 2018 Alibaba Tianchi Competition-Server Dispatch Competition. This method ranks 66 in the preliminary round and is ranked second in the semi-finals. It is a good starting method.
User: zangzelin
np-hard,Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
User: zhelih
Home Page: https://wp.lykhovyd.com/rds
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.