Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

branch and bound · Vinony

EntityQ897659· pop 16· linked from 193 articles

branch and bound

Sign in to save

algorithm for optimization problems

Connections

mathematical optimization

linear programming

travelling salesperson problem

greedy algorithm

A* search algorithm

Bellman–Ford algorithm

convex optimization

cutting-plane method

feasible region

International Standard Book Number

digital object identifier

machine learning

University of Copenhagen

Categories

Combinatorial optimization Optimization algorithms and methods

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

parameterized complexity

Entitydist 0.45

Levenberg–Marquardt algorithm

Entitydist 0.56

computational geometry

Entitydist 0.57

𝑛th root algorithm

Entitydist 0.58

fixed-point iteration

Entitydist 0.58

root-finding algorithm

Entitydist 0.59

Circuit complexity

Entitydist 0.60

Broyden's method

Entitydist 0.62

Entitydist 0.63

computational chemistry

Entitydist 0.63

meshfree method

Entitydist 0.64

SIMPLE algorithm

Entitydist 0.65

What links here193 pages

feature selection

constrained optimization

approximation algorithm

pattern recognition

computational science

golden section search

Dijkstra's algorithm

Broyden–Fletcher–Goldfarb–Shanno algorithm

nonlinear programming

convex optimization

Firefly algorithm

Nelder–Mead method

ant colony optimization algorithms

integer programming

symbolic artificial intelligence

maximum parsimony

Dinic's algorithm

register allocation

nearest neighbor search