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)

Related topics

Related topics

49 relations
Alexander SchrijverAlpha–beta pruningBacktrackingBranch and bound

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Meta-heuristic algorithm for binary dynamic optimisation problems and its relevancy to timetabling
1 Data Mining and Optimisation Research Group, Centre for Artificial Intelligence Technology, Universiti Kebangsaan Malaysia… 
Highly Cited
2011
Highly Cited
2011
Water planning in a changing climate: Joint application of cost utility analysis and modern portfolio theory
Highly Cited
2007
Highly Cited
2007
A scatter search-based heuristic to locate capacitated transshipment points
Highly Cited
2005
Highly Cited
2005
Optimal design of parabolic canal section
Optimal design equations for a parabolic canal section are presented in this paper. The design equations for a minimum earthwork… 
2001
2001
Optimisation strategy for wireless communications system planning using linear programming
A simple but effective base station (BS) placement strategy for use in interference limited code division multiple access (CDMA… 
Review
2000
Review
2000
Forest management models and combinatorial algorithms: analysis of state of the art
Linear Programming and Mixed Integer Linear Programs have been used for forest planning since the 60's to support decision making… 
Highly Cited
2000
Highly Cited
2000
Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation
In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used… 
Highly Cited
1997
Highly Cited
1997
On modelling payments in projects
Projects are often evaluated on financial performance. The net present value (NPV) has long been established as a highly relevant… 
1995
1995
Topological design of local area networks using genetic algorithms
Continually growing number of users have to exchange increasing amounts of information. Local area networks (LANs) are commonly… 
Highly Cited
1982
Highly Cited
1982
Some facets of the simple plant location polytope
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)