
VRP
 Referenced in 616 articles
[sw05207]
 most challenging combinatorial optimization task. Defined more than 40 years ago, this problem consists...

Knapsack
 Referenced in 359 articles
[sw04723]
 simplest NPhard problems in combinatorial optimization, as they maximize an objective function subject...

ABACUS
 Referenced in 105 articles
[sw02948]
 mixed integer optimization problems and for combinatorial optimization problems. It unifies cutting plane and column...

simannf90
 Referenced in 106 articles
[sw05059]
 algorithm From authors’ summary: A new global optimization algorithm for functions of continuous variables ... simulated annealing” algorithm recently introduced in combinatorial optimization. The algorithm is essentially an iterative random...

COMET
 Referenced in 53 articles
[sw03051]
 Based Local Search. The ubiquity of combinatorial optimization problems in our society is illustrated ... novel application areas for optimization technology, which range from supply chain management to sports tournament ... abstraction. Local search approaches to combinatorial optimization are able to isolate optimal or nearoptimal ... book introduces a method for solving combinatorial optimization problems that combines constraint programming and local...

SDPLIB
 Referenced in 51 articles
[sw00838]
 control systems engineering, and relaxations of combinatorial optimization problems. The current version of the library...

SALSA
 Referenced in 23 articles
[sw02661]
 efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction ... with other optimization paradigms such as local search, yielding hybrid algorithms with constraints. Such combinations ... examples from combinatorial optimization for which we specify complex optimization procedures with a few simple ... systems, yielding a powerful environment for combinatorial optimization...

TTTPLOTS
 Referenced in 36 articles
[sw07712]
 local search based heuristics for combinatorial optimization, such as simulated annealing, genetic algorithms, iterated local...

Tabu search
 Referenced in 888 articles
[sw08556]
 understand basic implementation principles for solving combinatorial or nonlinear problems. We also identify recent developments ... sophistication. We provide several examples of discrete optimization problems to illustrate the strategic concerns...

MAPCLUS
 Referenced in 26 articles
[sw20021]
 squares method combined with a mathematical programming optimization procedure based on a penalty function approach ... numerical techniques (notably a heuristically based combinatorial optimization procedure) to provide an efficient generalpurpose...

BeamACO
 Referenced in 20 articles
[sw11745]
 metaheuristic approach to tackle hard combinatorial optimization problems. The basic component...

MALLBA
 Referenced in 20 articles
[sw00542]
 MALLBA project tackles the resolution of combinatorial optimization problems using algorithmic skeletons implemented...

TimberWolf
 Referenced in 17 articles
[sw16460]
 routing optimization programs. The general combinatorial optimization technique known as simulated annealing is used...

GRAPH
 Referenced in 17 articles
[sw19079]
 properties with their complements. Miscellaneous results. Combinatorial optimization...

JCell
 Referenced in 15 articles
[sw13353]
 allows the user to work in combinatorial optimization, integer programming, continuous optimization, and multiobjective...

METSlib
 Referenced in 12 articles
[sw05867]
 quadratic assignment problem, a combinatorial optimization problem that arises in many applicative cases...

POPMUSIC
 Referenced in 10 articles
[sw20508]
 POPMUSIC  partial optimization metaheuristic under special intensification conditions. This article introduces POPMUSIC, a metaheuristic ... been successfully applied to various combinatorial optimization problems. This metaheuristic is especially useful for designing ... heuristic methods for large combinatorial problems that can be partially optimized. The basic idea...

MDjeep
 Referenced in 9 articles
[sw09842]
 reformulate this problem as a combinatorial optimization problem, and describe a branch and prune solution...

CABOB
 Referenced in 30 articles
[sw17813]
 CABOB: a fast optimal algorithm for winner determination in combinatorial auctions. Combinatorial auctions where bidders ... inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition...

SIMPL
 Referenced in 7 articles
[sw13333]
 SIMPL: A system for integrating optimization techniques. In recent years, the Constraint Programming ... techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling...