A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800): Difference between revisions

@@ Property / describes a project that uses @@
+PORTA
@@ Property / describes a project that uses: PORTA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LOLIB
@@ Property / describes a project that uses: LOLIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.04.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2022810394
@@ Property / OpenAlex ID: W2022810394 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339078
@@ Property / cites work: Q4339078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680598
@@ Property / cites work: Q3680598 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3352900
@@ Property / cites work: Q3352900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3956691
@@ Property / cites work: Q3956691 / rank @@
+Normal rank
@@ Property / cites work @@
+Median linear orders: Heuristics and a branch and bound algorithm
+Normal rank
@@ Property / cites work @@
+On the use of ordered sets in problems of comparison and consensus of classifications
+Normal rank
@@ Property / cites work @@
+The median procedure in cluster analysis and social choice theory
+Normal rank
@@ Property / cites work @@
+Q5650707
@@ Property / cites work: Q5650707 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320091
@@ Property / cites work: Q3320091 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch cuts in strongly connected graphs and permutation potentials
+Normal rank
@@ Property / cites work @@
+Maximum likelihood paired comparison ranking by linear programming
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for maximum likelihood paired comparison ranking
+Normal rank
@@ Property / cites work @@
+Q4880988
@@ Property / cites work: Q4880988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4395490
@@ Property / cites work: Q4395490 / rank @@
+Normal rank
@@ Property / cites work @@
+New results on the computation of median orders
@@ Property / cites work: New results on the computation of median orders / rank @@
+Normal rank
@@ Property / cites work @@
+The noising method: A new method for combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Lamarckian genetic algorithms applied to the aggregation of preferences
+Normal rank
@@ Property / cites work @@
+The noising methods: A generalization of some metaheuristics
+Normal rank
@@ Property / cites work @@
+Self-tuning of the noising methods
@@ Property / cites work: Self-tuning of the noising methods / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339963
@@ Property / cites work: Q4339963 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization and small polytopes
@@ Property / cites work: Combinatorial optimization and small polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4118980
@@ Property / cites work: Q4118980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382664
@@ Property / cites work: Q4382664 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch search algorithm for maximum likelihood paired comparison ranking
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Q3680606
@@ Property / cites work: Q3680606 / rank @@
+Normal rank
@@ Property / cites work @@
+Un algorithme pour pallier l'effet Condorcet
@@ Property / cites work: Un algorithme pour pallier l'effet Condorcet / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339964
@@ Property / cites work: Q4339964 / rank @@
+Normal rank
@@ Property / cites work @@
+SERIATION USING ASYMMETRIC PROXIMITY MEASURES
@@ Property / cites work: SERIATION USING ASYMMETRIC PROXIMITY MEASURES / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221421
@@ Property / cites work: Q3221421 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the acyclic subgraph problem
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
+Normal rank
@@ Property / cites work @@
+Metaheuristics: A bibliography
@@ Property / cites work: Metaheuristics: A bibliography / rank @@
+Normal rank
@@ Property / cites work @@
+Q4060764
@@ Property / cites work: Q4060764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3738922
@@ Property / cites work: Q3738922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585195
@@ Property / cites work: Q5585195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495496
@@ Property / cites work: Q4495496 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680289
@@ Property / cites work: Q3680289 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum-likelihood paired comparison rankings
@@ Property / cites work: Maximum-likelihood paired comparison rankings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3038367
@@ Property / cites work: Q3038367 / rank @@
+Normal rank