Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Comput Optim Appl

Search In Journal Title:

Abbravation: Computational Optimization and Applications

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s11270-006-9228-5

Search In DOI:

ISSN

1573-2894

Search In ISSN:
Search In Title Of Papers:

A benchmark library and a comparison of heuristic

Authors: Rafael Martí Gerhard Reinelt Abraham Duarte
Publish Date: 2011/01/05
Volume: 51, Issue: 3, Pages: 1297-1317
PDF Link

Abstract

The linear ordering problem consists of finding an acyclic tournament in a complete weighted digraph of maximum weight It is one of the classical NPhard combinatorial optimization problems This paper surveys a collection of heuristics and metaheuristic algorithms for finding nearoptimal solutions and reports about extensive computational experiments with them We also present the new benchmark library LOLIB which includes all instances previously used for this problem as well as new ones

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Compression and denoising using l 0 -norm
  2. AAR-based decomposition algorithm for non-linear convex optimisation
  3. Classification of companies using maximal margin ellipsoidal surfaces
  4. Multi-step nonlinear conjugate gradient methods for unconstrained minimization
  5. Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria
  6. Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual
  7. Numerical experiments with an inexact Jacobian trust-region algorithm
  8. An interior-point approach for primal block-angular problems
  9. Computing the metric dimension of graphs by genetic algorithms
  10. Some non-interior path-following methods based on a scaled central path for linear complementarity problems
  11. On the resolution of certain discrete univariate max–min problems
  12. A coordinate gradient descent method for ℓ 1 -regularized convex minimization
Search Result: