Tagged articles
6 articles
Page 1 of 1
DataFunSummit
DataFunSummit
Jan 13, 2025 · Artificial Intelligence

Deep Learning Approaches for Solving Graph Optimization Problems

This article reviews the use of deep learning, including supervised, reinforcement, and self‑supervised paradigms, to address graph optimization problems such as facility location and balanced graph partitioning, discusses existing research challenges, presents a three‑stage self‑supervised model with graph contrastive pre‑training, and evaluates its performance on synthetic and real‑world datasets.

Deep Learningcombinatorial optimizationexperimental evaluation
0 likes · 14 min read
Deep Learning Approaches for Solving Graph Optimization Problems
DaTaobao Tech
DaTaobao Tech
Sep 4, 2023 · Artificial Intelligence

Operations Research and Combinatorial Optimization for 3D Interior Layout Generation

The article surveys how operations research and combinatorial optimization model 3‑D interior layout generation as a complex decision problem, describes an iterative optimization framework, and reviews recent AI models like LEGO‑Net and CC3D that reduce collisions but still leave fully automatic high‑quality design as an open challenge.

3D layoutAIOperations Research
0 likes · 14 min read
Operations Research and Combinatorial Optimization for 3D Interior Layout Generation
DataFunSummit
DataFunSummit
Nov 14, 2022 · Artificial Intelligence

Machine Learning Methods for Solving Combinatorial Optimization Problems

This article reviews recent advances in applying machine learning—especially attention mechanisms, graph neural networks, and reinforcement learning—to combinatorial optimization, outlines fundamental problem definitions, classic algorithms, modern ML‑based approaches, experimental results, and future research directions.

AlgorithmsAttention Mechanismcombinatorial optimization
0 likes · 18 min read
Machine Learning Methods for Solving Combinatorial Optimization Problems
Model Perspective
Model Perspective
Nov 7, 2022 · Fundamentals

How Simulated Annealing Mimics Physical Annealing to Find Global Optima

Simulated Annealing, inspired by the physical annealing of solids, uses a Monte‑Carlo based stochastic search that gradually lowers temperature to probabilistically accept worse solutions, enabling it to escape local minima and effectively solve combinatorial optimization problems such as TSP, knapsack, and graph coloring.

Monte Carlocombinatorial optimizationoptimization
0 likes · 5 min read
How Simulated Annealing Mimics Physical Annealing to Find Global Optima
Alibaba Cloud Developer
Alibaba Cloud Developer
Aug 29, 2017 · Artificial Intelligence

Can Deep Reinforcement Learning Shrink Packing Costs? A New 3D Bin Packing Study

This paper introduces a novel three‑dimensional bin‑packing problem where the objective is to minimize the surface area of a single flexible container, proves its NP‑hardness, and demonstrates that a deep reinforcement learning approach using a Pointer Network improves packing efficiency by roughly five percent over traditional heuristics on real‑world data.

3D bin packingcombinatorial optimizationdeep reinforcement learning
0 likes · 16 min read
Can Deep Reinforcement Learning Shrink Packing Costs? A New 3D Bin Packing Study