A priority based assignment problem (Q2293428): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apm.2016.03.038 / rank
Normal rank
 
Property / author
 
Property / author: Anuj Kumar Sharma / rank
Normal rank
 
Property / author
 
Property / author: Anuj Kumar Sharma / 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.apm.2016.03.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2316955812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual approach for solving the combined distribution and assignment problem with link capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A goal programming approach for a multi-objective multi-choice assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2853657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized assignment problem with minimum quantities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐price approach for the stochastic generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of project scheduling to minimize exposed time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bottleneck assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for the solution of the bottleneck assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternate strategies for solving bottleneck assignment problems - analysis and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bottleneck generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min max problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods and computational investigations for the linear bottleneck assignment problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APM.2016.03.038 / rank
 
Normal rank

Latest revision as of 20:53, 17 December 2024

scientific article
Language Label Description Also known as
English
A priority based assignment problem
scientific article

    Statements

    A priority based assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2020
    0 references
    optimization
    0 references
    non-linear programming
    0 references
    combinatorial analysis
    0 references
    allocation
    0 references
    assignment problem
    0 references

    Identifiers