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
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
Review
2007
Review
2007
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with… Expand
  • table 1.1
  • table 1.2
  • figure 2.1
  • figure 2.2
  • figure 2.3
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
Review
2003
Review
2003
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
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
Highly Cited
1998
Highly Cited
1998
Preface - Data Correcting Algorithms in Combinatorial Optimization - The Steiner Ratio of Banach-Minkowski Space - Probabilistic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
1995
Review
1995
computational bounds for local search in combinatorial local search algorithms for combinatorial problems local search algorithms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1988
Highly Cited
1988
FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory… Expand
Highly Cited
1981
Highly Cited
1981
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also… Expand
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