scientific article
From MaRDI portal
Publication:3745273
zbMath0606.68036MaRDI QIDQ3745273
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polytopesocial choicedistance functionpaired comparisonsequivalence relationqualitative data analysis\({\mathcal N}{\mathcal P}\)-hardaggregation of binary relationslinear programming based cutting plane algorithm
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items (29)
Medians for weight metrics in the covering graphs of semilattices ⋮ The median procedure in the semilattice of orders ⋮ Consensus functions and patterns in molecular sequences ⋮ A three-phased local search approach for the clique partitioning problem ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Voting schemes for which it can be difficult to tell who won the election ⋮ A cutting plane algorithm for a clustering problem ⋮ Visual attractiveness in vehicle routing via bi-objective optimization ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Ensemble clustering by means of clustering embedding in vector spaces ⋮ On the computation of median linear orders, of median complete preorders and of median weak orders ⋮ New bounds and constraint propagation techniques for the clique partitioning problem ⋮ Voting Procedures, Complexity of ⋮ Optimal clustering of multipartite graphs ⋮ Conference scheduling: a clustering-based approach ⋮ Redundant constraints in the standard formulation for the clique partitioning problem ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Noising methods for a clique partitioning problem ⋮ NP-hardness results for the aggregation of linear orders into median orders ⋮ Computer science and decision theory ⋮ Median linear orders: Heuristics and a branch and bound algorithm ⋮ The biclique partitioning polytope ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ Facets of the clique partitioning polytope ⋮ Application of the “descent with mutations” metaheuristic to a clique partitioning problem ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem ⋮ A cutting-plane approach to the edge-weighted maximal clique problem ⋮ Complexity results for extensions of median orders to different types of remoteness ⋮ The noising method: A new method for combinatorial optimization
This page was built for publication:
