OptAtlas

Graph explorer

The full OptAtlas graph. Filter by node type, edge type, and minimum evidence grade, then inspect entries and relationships in the list below. The graph is also directly explorable on desktop.

Graph data (list view) · Showing 48 nodes · 98 edges

Nodes

Relationships

  • 1D Cutting Stock —[shares method with]→ 2D Bin Packing
  • 1D Cutting Stock —[direct benchmark]→ BPPLIB
  • 1D Cutting Stock —[uses method]→ Branch and Bound
  • 1D Cutting Stock —[uses method]→ Column Generation
  • 1D Cutting Stock —[uses method]→ Integer Linear Programming
  • 2D Bin Packing —[shares method with]→ 2D Strip Packing
  • 2D Bin Packing —[direct benchmark]→ 2DPackLib
  • 2D Bin Packing —[uses method]→ Branch and Bound
  • 2D Bin Packing —[uses method]→ Column Generation
  • 2D Bin Packing —[uses method]→ First-Fit Decreasing
  • 2D Bin Packing —[uses method]→ Genetic Algorithm
  • 2D Bin Packing —[uses method]→ Integer Linear Programming
  • 2D Bin Packing —[uses method]→ Lower Bounds
  • 2D Bin Packing —[uses method]→ Tabu Search
  • 2D Irregular Nesting —[shares method with]→ 2D Bin Packing
  • 2D Irregular Nesting —[generalizes]→ 2D Strip Packing
  • 2D Irregular Nesting —[adjacent benchmark]→ 2DPackLib
  • 2D Irregular Nesting —[uses method]→ Bottom-Left Fill
  • 2D Irregular Nesting —[open-source implementation]→ Deepnest
  • 2D Irregular Nesting —[direct benchmark]→ ESICUP
  • 2D Irregular Nesting —[uses method]→ Genetic Algorithm
  • 2D Irregular Nesting —[uses method]→ Inner-Fit Polygon
  • 2D Irregular Nesting —[open-source implementation]→ libnest2d
  • 2D Irregular Nesting —[uses method]→ Minkowski Sum
  • 2D Irregular Nesting —[uses method]→ No-Fit Polygon
  • 2D Irregular Nesting —[uses method]→ Phi-functions
  • 2D Irregular Nesting —[uses method]→ Reinforcement Learning
  • 2D Irregular Nesting —[uses method]→ Simulated Annealing
  • 2D Irregular Nesting —[open-source implementation]→ SVGnest
  • 2D Irregular Nesting —[uses method]→ Tabu Search
  • 2D Knapsack —[shares method with]→ 2D Bin Packing
  • 2D Knapsack —[direct benchmark]→ 2DPackLib
  • 2D Knapsack —[uses method]→ Branch and Bound
  • 2D Knapsack —[uses method]→ Dynamic Programming
  • 2D Knapsack —[uses method]→ Genetic Algorithm
  • 2D Knapsack —[generalizes]→ Knapsack Problem
  • 2D Strip Packing —[shares method with]→ 2D Irregular Nesting
  • 2D Strip Packing —[shares method with]→ 2D Knapsack
  • 2D Strip Packing —[direct benchmark]→ 2DPackLib
  • 2D Strip Packing —[uses method]→ Bottom-Left Fill
  • 2D Strip Packing —[uses method]→ First-Fit Decreasing
  • 2D Strip Packing —[uses method]→ Genetic Algorithm
  • 2D Strip Packing —[uses method]→ Integer Linear Programming
  • 2D Strip Packing —[uses method]→ Simulated Annealing
  • 2D Strip Packing —[uses method]→ Tabu Search
  • 3D Bin Packing —[generalizes]→ 2D Bin Packing
  • 3D Bin Packing —[uses method]→ Branch and Bound
  • 3D Bin Packing —[uses method]→ Genetic Algorithm
  • 3D Bin Packing —[uses method]→ Reinforcement Learning
  • Apparel Marker Making —[industry instance of]→ 2D Irregular Nesting
  • Apparel Marker Making —[occurs in]→ Apparel
  • Column Generation —[shares method with]→ Branch and Bound
  • Container Loading —[industry instance of]→ 3D Bin Packing
  • Container Loading —[occurs in]→ Logistics
  • Deepnest —[shares method with]→ SVGnest
  • First-Fit Decreasing —[shares method with]→ Bottom-Left Fill
  • Guillotine Cutting —[variant of]→ 2D Bin Packing
  • Guillotine Cutting —[shares method with]→ 2D Knapsack
  • Guillotine Cutting —[shares method with]→ 2D Strip Packing
  • Guillotine Cutting —[adjacent benchmark]→ 2DPackLib
  • Guillotine Cutting —[uses method]→ Branch and Bound
  • Guillotine Cutting —[uses method]→ Column Generation
  • Guillotine Cutting —[uses method]→ Dynamic Programming
  • Guillotine Cutting —[uses method]→ Genetic Algorithm
  • Inner-Fit Polygon —[shares method with]→ No-Fit Polygon
  • Integer Linear Programming —[shares method with]→ Branch and Bound
  • Integer Linear Programming —[open-source implementation]→ Google OR-Tools
  • Knapsack Problem —[shares method with]→ 1D Cutting Stock
  • Knapsack Problem —[uses method]→ Branch and Bound
  • Knapsack Problem —[uses method]→ Dynamic Programming
  • Knapsack Problem —[uses method]→ Integer Linear Programming
  • Knapsack Problem —[direct benchmark]→ OR-Library
  • Knapsack Problem —[open-source implementation]→ Google OR-Tools
  • Lower Bounds —[shares method with]→ Branch and Bound
  • Minkowski Sum —[shares method with]→ No-Fit Polygon
  • Pallet Loading —[variant of]→ 2D Bin Packing
  • Pallet Loading —[shares method with]→ 2D Knapsack
  • Pallet Loading —[shares method with]→ 3D Bin Packing
  • Pallet Loading —[uses method]→ Dynamic Programming
  • Paper Roll Slitting —[industry instance of]→ 1D Cutting Stock
  • Paper Roll Slitting —[occurs in]→ Paper Manufacturing
  • Phi-functions —[shares method with]→ No-Fit Polygon
  • Sheet-metal True-shape Nesting —[industry instance of]→ 2D Irregular Nesting
  • Sheet-metal True-shape Nesting —[shares method with]→ Apparel Marker Making
  • Sheet-metal True-shape Nesting —[commercial tool]→ RADAN Radnest
  • Sheet-metal True-shape Nesting —[occurs in]→ Sheet-metal Fabrication
  • Sheet-metal True-shape Nesting —[shares method with]→ Shipbuilding Plate Nesting
  • Shipbuilding Plate Nesting —[industry instance of]→ 2D Irregular Nesting
  • Shipbuilding Plate Nesting —[shares method with]→ Apparel Marker Making
  • Shipbuilding Plate Nesting —[occurs in]→ Shipbuilding
  • Shipbuilding Plate Nesting —[commercial tool]→ SigmaNEST
  • Variable-Sized Bin Packing —[shares method with]→ 1D Cutting Stock
  • Variable-Sized Bin Packing —[variant of]→ 2D Bin Packing
  • Wäscher Typology —[mentions]→ 1D Cutting Stock
  • Wäscher Typology —[mentions]→ 2D Bin Packing
  • Wäscher Typology —[mentions]→ 2D Knapsack
  • Wood Panel Cutting —[occurs in]→ Furniture Manufacturing
  • Wood Panel Cutting —[industry instance of]→ Guillotine Cutting