scientific article; zbMATH DE number 1757965

MaRDI QIDQ4537753zbMATH OpenFDO

Authors Alantha Newman, Santosh S. Vempala

Publication date 20 June 2002

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

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• The linear ordering problem revisited
• The linear ordering problem: instances, search space analysis and algorithms
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 3902051
• On approximability of linear ordering and related NP-optimization problems on graphs (extended abstract)
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Lagrangian relaxation and pegging test for linear ordering problems
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• Semidefinite relaxations of ordering problems

Cited in

(11)

• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• A minimum violations ranking method
• Revised GRASP with path-relinking for the linear ordering problem
• The rankability of data
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
• The class of non-integer vertices for the initial relaxation polytope of the linear ordering problem
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
• A semidefinite optimization approach to the target visitation problem
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537753)