scientific article; zbMATH DE number 1757965

zbMath1010.90042MaRDI QIDQ4537753

Alantha Newman, Santosh Vempala

Publication date: 20 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810333

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

A minimum violations ranking method ⋮ A semidefinite optimization approach to the target visitation problem ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation ⋮ The Rankability of Data