Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,049,158 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Alexander Schrijver
Alpha–beta pruning
Backtracking
Branch and bound
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem
Fuqing Zhao
,
Yang Liu
,
Zhongshi Shao
,
Xin Jiang
,
Chuck Zhang
,
Junbiao Wang
International journal of computer integrated…
2016
Corpus ID: 9934536
The permutation flow-shop scheduling problem (PFSP) is a typical combinational and non-deterministic polynomial-hard problem…
Expand
2010
2010
Covering trees and lower-bounds on quadratic assignment
Julian Yarkony
,
Charless C. Fowlkes
,
A. Ihler
IEEE Computer Society Conference on Computer…
2010
Corpus ID: 8076080
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a…
Expand
2010
2010
Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem
Yun Cai
2010
Corpus ID: 62750690
An improved artificial fish swarm algorithm (AFSA) for solving a combinatorial optimization problem— a berth allocation problem…
Expand
2009
2009
Partial neighborhoods of elementary landscapes
L. D. Whitley
,
Andrew M. Sutton
Annual Conference on Genetic and Evolutionary…
2009
Corpus ID: 7940943
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are…
Expand
2004
2004
Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion
嘉 梁音勻
,
M. Tasgetiren
,
Mehmet Sevkli
,
Güneş Gençyılmaz
2004
Corpus ID: 18623427
This paper presents a differential evolution algorithm to solve the permutaion flowshop sequencing problem with makespan…
Expand
2004
2004
Investigating Ahuja-Orlin''s Large Neighbourhood Search for Examination Timetabling
S. Abdullah
,
S. Ahmadi
,
E. Burke
2004
Corpus ID: 7716719
: Since the 1960’s automated approaches to examination timetabling have been explored and a wide variety of approaches have been…
Expand
2004
2004
Ant Colony Optimisation for vehicle routing problems: from theory to applications.
Rizzoli Andrea Emilio
,
F. Oliverio
,
R. Montemanni
,
Gambardella Luca Maria
2004
Corpus ID: 2429945
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we show its successful…
Expand
1997
1997
Estimating Camera Position and Orientation from Geographical Map and Mountain Image
P. Naval
,
M. Mukunoki
,
M. Minoh
,
K. Ikeda
1997
Corpus ID: 15734395
We describe a method for recovering the camera position and orientation parameters from a single mountain image. It is based on…
Expand
1971
1971
Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
J. N. Gupta
Operational Research
1971
Corpus ID: 27371914
This paper examines the combinatorial approach to the solution of the n-job, M-machine flowshop scheduling problem under the…
Expand
1969
1969
On The Applications of a Recent Combinatorial Algorithm
T. Hansen
,
H. Scarf
1969
Corpus ID: 118826545