Optimal Weighted Ancestry Relationships

DOI10.1287/mnsc.20.8.1190zbMath0303.90055OpenAlexW1992401944MaRDI QIDQ4058496

Fred Glover, Theodore D. Klastorin, Darwin D. Klingman

Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.20.8.1190

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (16)

More facets from fences for linear ordering and acyclic subgraph polytopes ⋮ The linear ordering problem with clusters: a new partial ranking ⋮ The linear ordering problem revisited ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Semidefinite relaxations of ordering problems ⋮ A linear ordering problem of sets ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ A semidefinite optimization approach to the target visitation problem ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ The median procedure in cluster analysis and social choice theory ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Analysis of a generalized linear ordering problem via integer programming ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ A new heuristic algorithm solving the linear ordering problem ⋮ On the linear ordering problem and the rankability of data

This page was built for publication: Optimal Weighted Ancestry Relationships