t-linearization for the maximum diversity problem

DOI10.1007/S11590-021-01719-YMaRDI QIDQ2230803zbMATH OpenOpenAlexFDO

Authors Pablo Soares, Manoel Campêlo

Publication date 28 September 2021

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-021-01719-y

zbMATH Keywords

branch-and-cutlinearizationmaximum diversity problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• A branch and bound algorithm for the maximum diversity problem
• Optimal results and tight bounds for the Maximum Diversity Problem
• A hybrid metaheuristic method for the maximum diversity problem
• A simple and effective algorithm for the MaxMin diversity problem
• Tabu search versus GRASP for the maximum diversity problem

Cites work

• scientific article; zbMATH DE number 7561387 (Why is no real title available?)
• 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
• A branch and bound algorithm for the maximum diversity problem
• A linearization framework for unconstrained quadratic (0-1) problems
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem
• Comparison Of Four Models For dispersing Facilities
• Heuristic algorithms for the maximum diversity problem
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Max-sum diversity via convex programming
• Maximum diversity problem with squared Euclidean distance
• Tabu search and GRASP for the maximum diversity problem
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• The discrete p-dispersion problem
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• Theoretical and computational study of several linearisation techniques for binary quadratic problems
• Upper bounds and exact algorithms for \(p\)-dispersion problems

Cited in

(1)

• Optimal results and tight bounds for the Maximum Diversity Problem

Describes a project that uses

Uses Software

• MDPLIB

This page was built for publication: \(t\)-linearization for the maximum diversity problem

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