Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2012.06.005 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2012.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096919221 / 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: Perspectives of Monge properties in optimization / 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: The Wiener maximum quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising Waiting Time Variance in the Single Machine Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion time variance minimization on a single machine is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cone of Monge matrices: Extremal rays and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Time-in-System Variance for a Finite Jobset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2012.06.005 / rank
 
Normal rank

Latest revision as of 08:53, 11 December 2024

scientific article
Language Label Description Also known as
English
Another well-solvable case of the QAP: maximizing the job completion time variance
scientific article

    Statements

    Another well-solvable case of the QAP: maximizing the job completion time variance (English)
    0 references
    0 references
    0 references
    0 references
    8 November 2012
    0 references
    combinatorial optimization
    0 references
    quadratic assignment problem
    0 references
    machine scheduling
    0 references
    well-solvable special case
    0 references

    Identifiers