A linear ordering problem with weighted rank

DOI10.1007/s10878-024-01109-xMaRDI QIDQ6117320

Manuel V. C. Vieira

Publication date: 20 March 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

memetic algorithmlinear ordering problemaggregation of individual preferences

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• A computational study and survey of methods for the single-row facility layout problem
• Semidefinite relaxations of ordering problems
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The linear ordering problem with clusters: a new partial ranking
• A semidefinite optimization approach to the target visitation problem
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• The linear ordering problem: instances, search space analysis and algorithms
• Analysis of a generalized linear ordering problem via integer programming
• Fairness and the set of optimal rankings for the linear ordering problem
• A linear ordering problem of sets
• Facility layout. Mathematical optimization techniques and engineering
• Block-insertion-based algorithms for the linear ordering problem
• The linear ordering problem revisited
• A survey on the linear ordering problem for weighted or unweighted tournaments
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Facets of the linear ordering polytope
• A Gentle Introduction to Memetic Algorithms
• Accumulation Charts for Instant-Runoff Elections

This page was built for publication: A linear ordering problem with weighted rank