The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.04.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344946706 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57949068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monge property for the \(d\)-dimensional transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge properties, discrete convexity and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional axial assignment problems with decomposable cost coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of permuted Supnick and incomplete Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pyramidal tours with step-backs and the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coloring: further complexity and approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy job units under release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the max edge-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max-weight edge coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Class of Greedily Solvable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of decomposing matrices arising in satellite communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(d\)-dimensional Monge arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop-sequencing problem with synchronous transfers and makespan minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for flow shop problems with synchronous movement / rank
 
Normal rank

Latest revision as of 21:21, 12 July 2024

scientific article
Language Label Description Also known as
English
The assignment problem with nearly Monge arrays and incompatible partner indices
scientific article

    Statements

    The assignment problem with nearly Monge arrays and incompatible partner indices (English)
    0 references
    0 references
    0 references
    2 November 2016
    0 references
    assignment problem
    0 references
    Monge property
    0 references
    Monge array
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers