Combinatorial optimization

graph search algorithm

NP-hard problem in combinatorial optimization

algorithm used for pathfinding and graph traversal

problem in combinatorial optimization

set of edges without common vertices

combinatorial optimization algorithm for the assignment problem

construct related to weighted sums and averages

mathematical optimization problem in which variables are restricted to be integers

theorem in optimization theory

subset of mathematical optimization

algorithm for optimization problems

combinatorial optimization problem about the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers

in graph theory, partition of the vertices in two sets

a cut of a graph whose size is at least the size of any other cut

Canadian mathematician and computer scientist, born 1934

combinatorial optimization problem

mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane

procedure in combinatorial optimization

iterative method for minimizing convex functions

algorithm for graph partitioning

logic puzzle

linear program that arises by removing the integrality constraints in an integer program

the computational problem of choosing as few coins as possible that add up to a given amount of money

combinatorial optimization problem

In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.

study of maximum or minimum size of a set under given conditions

mathematical problem in operations research