Approximate Local Search in Combinatorial Optimization
Year of publication: |
2003-08-15
|
---|---|
Authors: | Orlin, James B. ; Punnen, Abraham P. ; Schulz, Andreas S. |
Institutions: | Sloan School of Management, Massachusetts Institute of Technology (MIT) |
Subject: | Local Search | Neighborhood Search | Approximation Algorithms | Computational Complexity | Combinatorial Optimization | 0/1-Integer Programming |
-
The generalized assignment problem with minimum quantities
Krumke, Sven O., (2013)
-
The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey
de Klerk, Etienne, (2006)
-
Complexity and approximation of the connected set-cover problem
Zhang, Wei, (2012)
- More ...
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2004)
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2007)
-
Solving Project Scheduling Problems by Minimum Cut
Moehring, Rolf, (2002)
- More ...