SettingsCombinatorial optimization
1-center problem
The 1-center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities location type.
The 1-center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities location type.
A* search algorithm
In computer science, A* is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes.
In computer science, A* is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes.
Assignment problem
The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics.
The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics.
B*
In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.
In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.
Bee colony optimization
The bee colony optimization algorithm is inspired by the behaviour of a honey bee colony in nectar collection.
The bee colony optimization algorithm is inspired by the behaviour of a honey bee colony in nectar collection.
Bottleneck traveling salesman problem
The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization.
The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization.
Branch and bound
Branch and bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization.
Branch and bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization.
Branch and cut
Branch and cut (sometimes written as branch-and-cut) is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the...
Branch and cut (sometimes written as branch-and-cut) is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the...
Bridge and torch problem
The bridge and torch problem (also known as The Midnight Train and Dangerous crossing) is a logic puzzle that deals with 4 people, a bridge and a torch.
The bridge and torch problem (also known as The Midnight Train and Dangerous crossing) is a logic puzzle that deals with 4 people, a bridge and a torch.
Change-making problem
The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations? It is a knapsack type problem, and has...
The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations? It is a knapsack type problem, and has...
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
Continuous knapsack problem
The continuous knapsack problem, also known as the fractional knapsack problem, is similar to the classic knapsack problem but in this problem fractions of an item can be put into the knapsack.
The continuous knapsack problem, also known as the fractional knapsack problem, is similar to the classic knapsack problem but in this problem fractions of an item can be put into the knapsack.
Criss-cross algorithm
In mathematical optimization, the criss-cross algorithm denotes a family of algorithms for linear programming.
In mathematical optimization, the criss-cross algorithm denotes a family of algorithms for linear programming.
Cut (graph theory)
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets.
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets.
Cutting stock problem
The cutting-stock problem is an optimization problem, or more specifically, an integer linear programming problem.
The cutting-stock problem is an optimization problem, or more specifically, an integer linear programming problem.
Dijkstra's algorithm
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a g...
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a g...
Edge cycle cover
In mathematics, an edge cycle cover (sometimes called simply cycle cover) of a graph is a set of cycles which are subgraphs of G and contain all edges of G.
In mathematics, an edge cycle cover (sometimes called simply cycle cover) of a graph is a set of cycles which are subgraphs of G and contain all edges of G.
Ellipsoid method
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions.
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions.
Extremal combinatorics
Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.
Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.
Floorplan (microelectronics)
In electronic design automation, a floorplan of an integrated circuit is a schematic representation of tentative placement of its major functional blocks.
In electronic design automation, a floorplan of an integrated circuit is a schematic representation of tentative placement of its major functional blocks.
Gomory-Hu tree
In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that consists of edges representing all pairs minimum s-t cut in the graph.
In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that consists of edges representing all pairs minimum s-t cut in the graph.
Gomory–Hu tree
In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that consists of edges representing all pairs minimum s-t cut in the graph.
In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that consists of edges representing all pairs minimum s-t cut in the graph.
Graph bandwidth
In graph theory, the graph bandwidth problem is stated as follows.
In graph theory, the graph bandwidth problem is stated as follows.
Greedoid
In combinatorics, a greedoid is a type of set system.
In combinatorics, a greedoid is a type of set system.
Greedy randomized adaptive search procedure
The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems.
The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems.
Harmony search
In computer science and operations research, harmony search (HS) is a phenomenon-mimicking algorithm (also known as metaheuristic algorithm, soft computing algorithm or evolutionary algorithm) i...
In computer science and operations research, harmony search (HS) is a phenomenon-mimicking algorithm (also known as metaheuristic algorithm, soft computing algorithm or evolutionary algorithm) i...
Hungarian algorithm
The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal-dual methods.
The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal-dual methods.
Integer programming
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
Jack Edmonds
Jack R. Edmonds (born 1934) is a mathematician, regarded as one of the most important contributors to the field of combinatorial optimization.
Jack R. Edmonds (born 1934) is a mathematician, regarded as one of the most important contributors to the field of combinatorial optimization.
Kernighan–Lin algorithm
Kernighan–Lin is a O(n2 log n ) heuristic algorithm for solving the graph partitioning problem.
Kernighan–Lin is a O(n2 log n ) heuristic algorithm for solving the graph partitioning problem.
Knapsack problem
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a...
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a...
Lin-Kernighan heuristic
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
Linear bottleneck assignment problem
In combinatorial optimization, a field within mathematics, the linear bottleneck assignment problem (LBAP) is similar to the linear assignment problem.
In combinatorial optimization, a field within mathematics, the linear bottleneck assignment problem (LBAP) is similar to the linear assignment problem.
Linear programming relaxation
In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that e...
In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that e...
Lin–Kernighan heuristic
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
Matching (graph theory)
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
Matroid intersection
In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set.
In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set.
Max-flow min-cut theorem
In optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which ...
In optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which ...
Maximum cut
For a graph, a maximum cut is a cut whose size is not smaller than the size of any other cut.
For a graph, a maximum cut is a cut whose size is not smaller than the size of any other cut.
Maximum satisfiability problem
In computational complexity theory, the Maximum Satisfiability problem, or MAX-SAT, is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be sat...
In computational complexity theory, the Maximum Satisfiability problem, or MAX-SAT, is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be sat...
Metric k-center
In graph theory, the metric k-center, is a combinatorial optimization problem studied in theoretical computer science.
In graph theory, the metric k-center, is a combinatorial optimization problem studied in theoretical computer science.
Minimum cut
In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible.
In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible.
Minimum k-cut
In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to k connected components.
In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to k connected components.
Oriented matroid
An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of arrangements of vectors in a vector space over an ordered field (particularly for partial...
An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of arrangements of vectors in a vector space over an ordered field (particularly for partial...
Quadratic assignment problem
The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of t...
The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of t...
Quadratic bottleneck assignment problem
In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research, from the ...
In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research, from the ...
Set TSP problem
In combinatorial optimization, the set TSP, also known as the, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman Problem, is a generalization of the T...
In combinatorial optimization, the set TSP, also known as the, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman Problem, is a generalization of the T...
Smallest circle problem
The smallest circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.
The smallest circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.
Submodular set function
Submodular functions are set functions which usually appear in approximation algorithms, functions modeling user preferences in game theory.
Submodular functions are set functions which usually appear in approximation algorithms, functions modeling user preferences in game theory.
Traveling tourist problem
In combinatorial optimization, a mathematical discipline, the traveling tourist problem is similar to the traveling salesman problem: a tourist wishes to see all monuments (nodes) in a city, and...
In combinatorial optimization, a mathematical discipline, the traveling tourist problem is similar to the traveling salesman problem: a tourist wishes to see all monuments (nodes) in a city, and...
Weapon Target Assignment Problem
The weapon target assignment problem is a class of combinatorial optimization problems present in the fields of optimization and operations research.
The weapon target assignment problem is a class of combinatorial optimization problems present in the fields of optimization and operations research.
Weapon target assignment problem
The weapon target assignment problem is a class of combinatorial optimization problems present in the fields of optimization and operations research.
The weapon target assignment problem is a class of combinatorial optimization problems present in the fields of optimization and operations research.
Weight function
A weight function is a mathematical device used when performing a sum, integral, or average in order to give some elements more "weight" or influence on the result than other elements in the sam...
A weight function is a mathematical device used when performing a sum, integral, or average in order to give some elements more "weight" or influence on the result than other elements in the sam...