Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,262,946 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.
Highly Cited
2012
Highly Cited
2012
Memetic firefly algorithm for combinatorial optimization
Iztok Fister
,
Xin-She Yang
,
Iztok Fister
,
J. Brest
2012
Corpus ID: 52035067
Firefly algorithms belong to modern meta-heuristic algorithms inspired by nature that can be successfully applied to continuous…
Expand
Highly Cited
2011
Highly Cited
2011
Extended Formulations in Combinatorial Optimization
V. Kaibel
2011
Corpus ID: 3790504
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of…
Expand
Highly Cited
2011
Highly Cited
2011
Improving combinatorial optimization
Geoffrey Chu
2011
Corpus ID: 30156581
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In this…
Expand
Highly Cited
2007
Highly Cited
2007
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Nicole Megow
,
Adam D. Smith
,
+57 authors
Daniel Stefankovic
Lecture Notes in Computer Science
2007
Corpus ID: 3230767
Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im…
Expand
Review
2003
Review
2003
Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications
M. Ehrgott
,
X. Gandibleux
2003
Corpus ID: 59799940
This chapter provides an annotated bibliography of multiple objective combinatorial optimization, MOCO. We present a general…
Expand
Highly Cited
1999
Highly Cited
1999
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Xiaotie Deng
,
T. Ibaraki
,
H. Nagamochi
Mathematics of Operations Research
1999
Corpus ID: 38190103
We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one…
Expand
Highly Cited
1996
Highly Cited
1996
Softmax to Softassign: neural network algorithms for combinatorial optimization
Steven Gold
,
A. Rangarajan
1996
Corpus ID: 428114
A new technique termed softassign, is applied to three combinatorial optimization problems|weighted graph matching, the traveling…
Expand
Highly Cited
1994
Highly Cited
1994
Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
E. Anderson
,
M. Ferris
INFORMS journal on computing
1994
Corpus ID: 18867942
Genetic algorithms are one example of the use of a random element within an algorithm for combinatorial optimization. We consider…
Expand
Highly Cited
1989
Highly Cited
1989
Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization
H. Mühlenbein
Parallelism, Learning, Evolution
1989
Corpus ID: 5049333
In this paper we introduce our asynchronous parallel genetic algorithm ASPARAGOS. The two major extensions compared to genetic…
Expand
Highly Cited
1988
Highly Cited
1988
Branch-and-Cut Algorithms for Combinatorial Optimization Problems
J. Mitchell
1988
Corpus ID: 14530622
Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they can…
Expand
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)
ACCEPT & CONTINUE