Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 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 Hybrid Algorithm Based on Gravitational Search and Particle Swarm Optimization Algorithm to Solve Function Optimization Problems
Jie-sheng Wang
,
Jiang-Di Song
2016
Corpus ID: 42250232
Abstract—Gravitational search algorithm (GSA) is a swarm intelligence heuristic optimization algorithm based on the law of…
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
2005
2005
GPU-Cuts : Combinatorial Optimisation , Graphic Processing Units and Adaptive Object Extraction GPU-Cuts : Segmentation d ’ Objects par Optimisation Combinatoire sur Processeur Graphique
Nandan Dixit
,
Renaud Keriven
,
N. Paragios
2005
Corpus ID: 15672120
Object extraction is a core component of computer vision with application to segmentation, tracking, etc. In this paper we…
Expand
2004
2004
Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion
M. F. Tasgetirena
,
Yun-Chia Liangb
,
Mehmet Sevklic
,
Gunes Gencyilmazd
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
2001
2001
Unit commitment by Lagrangian relaxation and genetic algorithms [discussion and closure]
N. Jiménez-Redondo
,
Chuan-Ping Cheng
,
Chih-Wen Liu
,
Chun-Cheng Liu
2001
Corpus ID: 15133019
N Jimenez-Redondo comments on the paper by C.P. Cheng et al. (see ibid, vol.15, no.2, p.707-14, 2000). The original authors reply…
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
Highly Cited
1990
Highly Cited
1990
Combinatorial optimization applied to variable scale 2D model matching
J. Beveridge
,
R. Weiss
,
E. Riseman
[] Proceedings. 10th International Conference on…
1990
Corpus ID: 123064159
A local search optimization procedure, subset-convergent local search, is developed for identifying known 2D models in broken and…
Expand
1971
1971
Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
J. 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