Optimal Weighted Ancestry Relationships

DOI10.1287/MNSC.20.8.1190MaRDI QIDQ4058496zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(16)

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

This page was built for publication: Optimal Weighted Ancestry Relationships

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