Permutatorial optimization via the permutahedron

DOI10.1016/J.ORL.2022.06.008MaRDI QIDQ2083997zbMATH OpenOpenAlexFDO

Authors J. Carlos Martínez Mori, Samitha Samaranayake

Publication date 17 October 2022

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.00735

zbMATH Keywords

combinatorial optimizationinfrastructure planningpermutatorial optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• scientific article; zbMATH DE number 4149894
• Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
• scientific article; zbMATH DE number 3939075
• Convex relaxations for permutation problems
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
• Optimization on the combinatorial set of permutations in inexact input data conditions
• Polyhedral Combinatorics in Combinatorial Optimization
• scientific article; zbMATH DE number 3865283

Cites work

• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• An analysis of approximations for maximizing submodular set functions—I
• An Inequality
• scientific article; zbMATH DE number 848091 (Why is no real title available?)
• Smallest compact formulation for the permutahedron
• Sorting in \(c \log n\) parallel steps

Cited in

(2)

• Penalty weights in QUBO formulations: permutation problems
• Permutatorial Optimization via the Permutahedron

This page was built for publication: Permutatorial optimization via the permutahedron

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