Skip to search formSkip to main contentSkip to account menu

Combinatorial optimization

Known as: Combinatorial optimisation 
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Abstract—Gravitational search algorithm (GSA) is a swarm intelligence heuristic optimization algorithm based on the law of… 
2010
2010
An improved artificial fish swarm algorithm (AFSA) for solving a combinatorial optimization problem— a berth allocation problem… 
2005
2005
Object extraction is a core component of computer vision with application to segmentation, tracking, etc. In this paper we… 
2004
2004
Novel results are obtained by investigating the search algorithms predicated in “no free lunch” (NFL) theorems rather than NFL… 
2004
2004
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we show its successful… 
2002
2002
In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines… 
1997
1997
We describe a method for recovering the camera position and orientation parameters from a single mountain image. It is based on… 
1995
1995
The notion of frequency computation concerns approximative computations of n distinct parallel queries to a set A. A is called (m…