https://github.com/cheikh025/DistrictNet
공식 코드DistrictNet: Decision-aware learning for geographical districting
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Combinatorial Optimization is a category of problems which requires optimizing a function over a combination of discrete objects and the solutions are constrained. Examples include finding shortest paths in a graph, maximizing value in the Knapsack problem and finding boolean settings that satisfy a set of constraints. Many of these problems are NP-Hard, which means that no polynomial time solution can be developed for them. Instead, we can only produce approximations in polynomial time that are guaranteed to be some factor worse than the true optimal solution.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
DistrictNet: Decision-aware learning for geographical districting
Exploring the Power of Graph Neural Networks in Solving Linear Optimization Problems
Reconstructing Compact Building Models from Point Clouds Using Deep Implicit Fields
PRANCE: Joint Token-Optimization and Structural Channel-Pruning for Adaptive ViT Inference
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone
Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver
Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization
A Survey and Analysis of Evolutionary Operators for Permutations
FusDreamer: Label-efficient Remote Sensing World Model for Multimodal Data Classification
Learning the Markov Decision Process in the Sparse Gaussian Elimination
SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning
Lagrange Oscillatory Neural Networks for Constraint Satisfaction and Optimization
HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization
Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing
TOP-Former: A Multi-Agent Transformer Approach for the Team Orienteering Problem
Pruning Edges and Gradients to Learn Hypergraphs from Larger Sets
Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach
BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization
Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs
DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization
One model Packs Thousands of Items with Recurrent Conditional Query Learning
Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers
Exact Combinatorial Optimization with Graph Convolutional Neural Networks
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Pretrained Cost Model for Distributed Constraint Optimization Problems
Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications
Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.