A unified approach to simple special cases of extremal permutation problems

DOI10.1080/02331939808844404zbMATH Open0916.90225OpenAlexW2010547886MaRDI QIDQ4227985FDOQ4227985

Authors:

Publication date: 2 February 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844404

Recommendations

• scientific article; zbMATH DE number 26585
• A contribution to quadratic assignment problems
• The quadratic assignment problem. Theory and algorithms

zbMATH Keywords

combinatorial optimizationassignment problempartial orderfactorization of permutationsquadratic assignemnt problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Cites Work

• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Assignment Problems and the Location of Economic Activities
• Perspectives of Monge properties in optimization
• Title not available (Why is that?)

Cited In (5)

• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• Linear programming insights into solvable cases of the quadratic assignment problem
• Detecting and exploiting permutation structures in MIPs

This page was built for publication: A unified approach to simple special cases of extremal permutation problems

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