The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms with large domination ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quality of local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of linear admissible transformations for the m- travelling salesmen problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizable special cases of the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constant objective value property for multidimensional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of linearizable instances of the quadratic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrays of distinct representatives --- a very simple NP-complete problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear programming formulation of the 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search and the local structure of NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis for minimum multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of combinatorial optimization problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP tour domination and Hamilton cycle decompositions of regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: z-Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization of A convex quadratic function under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of greedy heuristics for the frequency assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for optimizing a class of low-rank functions over a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of some heuristics for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP heuristics: domination analysis and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the trajectories of the appointments problem and the travelling-salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance guarantees for above-average solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank

Latest revision as of 19:13, 14 July 2024

scientific article
Language Label Description Also known as
English
The bilinear assignment problem: complexity and polynomially solvable special cases
scientific article

    Statements

    The bilinear assignment problem: complexity and polynomially solvable special cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2017
    0 references
    bilinear assignment problem
    0 references
    quadratic assignment
    0 references
    bilinear programs
    0 references
    domination analysis
    0 references
    heuristics
    0 references
    polynomially solvable cases
    0 references
    linearization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references