Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Integer optimization problems are concerned with the efficient allocation of limited resources to meet a desired objective when… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
  • R. Karp
  • 50 Years of Integer Programming
  • 2010
  • Corpus ID: 33509266
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Reading a book is also kind of better solution when you have no enough money or time to get your own adventure. This is one of… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Abstract The paper presents a new genetic local search (GLS) algorithm for multi-objective combinatorial optimization (MOCO). The… Expand
  • figure 1
  • figure 4
  • table 1
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all… Expand
  • table 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
  • E. Aarts, J. Korst
  • Wiley-Interscience series in discrete mathematics…
  • 1990
  • Corpus ID: 19877437
SIMULATED ANNEALING. Combinatorial Optimization. Simulated Annealing. Asymptotic Convergence. Finite-Time Approximation… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is… Expand
Is this relevant?