{"entities":{"Q580163":{"pageid":581930,"ns":120,"title":"Item:Q580163","lastrevid":62985339,"modified":"2026-04-11T09:29:54Z","type":"item","id":"Q580163","labels":{"en":{"language":"en","value":"Algorithm for the minimax assignment problem with a sparse rectangular matrix"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4016579"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q580163$25815294-059D-450C-AE7C-83999C2619B0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c6855a655da5ee478110f2742c135c6ac5897eb6","datavalue":{"value":{"text":"Algorithm for the minimax assignment problem with a sparse rectangular matrix","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q580163$26E22D66-2535-45CC-BE5D-08A3FA94050A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4cb04e4b94f4fa3d0f2b67de562ade7ca10afa2a","datavalue":{"value":"0625.90041","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q580163$6EF51040-8713-4364-960E-FBB1FE4928EC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"998b66f280dc0e3a935f05610e0c31e1e8483185","datavalue":{"value":{"entity-type":"item","numeric-id":580162,"id":"Q580162"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q580163$C95996C6-D0B2-41C6-8D51-F4DA7238F668","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q580163$793C7810-B76D-4097-95A8-12CDB1FA422E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q580163$9F1DE3F5-F7C3-4C9F-A0A5-237EEA3EC3E5","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"761cc231ab612689bc3435ee1962d55c7ad7f80d","datavalue":{"value":"The considered problem may be stated as follows. Given is an \\(m\\times n\\) rectangular matrix A with elements a(i,j). Some of the elements are inadmissible and may remain undefined. A diagonal of this matrix is defined as any collection of m matrix elements such that not two are in the same column or in the same row. A diagonal of the matrix A is admissible if it contains no inadmissible elements. The goal is to find an admissible diagonal with the smallest maximal element. In the paper, a new algorithm for the minimax assignment problem is proposed. It behaves particularly well for sparse and rectangular matrices (i.e. those where there are many inadmissible elements and \\(m<n)\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q580163$963CDF89-94A0-4829-AF31-1C6E23029A11","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"208fd2cac25388eac9d979aba68dad257ddb3873","datavalue":{"value":{"entity-type":"item","numeric-id":224835,"id":"Q224835"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q580163$DF7B81EC-4ECA-46B2-A0C1-60639619E53C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q580163$46896A1D-645E-4179-9F8B-714F1CFA7C98","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q580163$8A7C7D98-1A78-4644-BCEA-D832A302313F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q580163$9BCBD61D-DFCB-481E-B600-789702D43EE8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a52b522c0278e562f701ec1bbe1a459025035ca2","datavalue":{"value":"4016579","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q580163$2D6DF379-CF1D-49CC-8E23-1710F063C391","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d470915ad5f8b20e8e1116c88f9a812167267df5","datavalue":{"value":"sparse matrices","type":"string"},"datatype":"string"},"type":"statement","id":"Q580163$06231C2C-845C-4E2E-94CC-0F69764B775A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fc544e482aa599702c82d69a25709014b297742d","datavalue":{"value":"polynomial algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q580163$D2BA040B-8A1C-4DBF-B047-81FB2716F3AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2f8fa9bf781f8deaf00184472451b8767fb7cbec","datavalue":{"value":"minimax assignment","type":"string"},"datatype":"string"},"type":"statement","id":"Q580163$D491435F-4907-4525-AE0F-874AB1E37695","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q580163$1B615AE2-2626-45FC-ACC3-D4FAE519B052","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c947c499fbad9315d56e8f667d59b4c2d012953b","datavalue":{"value":{"entity-type":"item","numeric-id":2991031,"id":"Q2991031"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"00e3cd3c0f1c8bf3e0c5f9a0f455c57505ace0f1","datavalue":{"value":{"amount":"+0.7807827591896057","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q580163$B2190ABC-1828-4F43-83CD-470C1F6E21F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c3f34d04122458d3ac2565ce2d3e0c9591764fce","datavalue":{"value":{"entity-type":"item","numeric-id":1374026,"id":"Q1374026"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"db86a4eb659628541bbbbec9443f1443580b1ee3","datavalue":{"value":{"amount":"+0.7790718078613281","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q580163$E6E4DFFF-E6D0-41FA-AEC5-0F3937E57E53","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f2e87463ecc108459ecd945e2f3f30b117ea994d","datavalue":{"value":{"entity-type":"item","numeric-id":3793631,"id":"Q3793631"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"db2c23f4f9c353095e7ef34fad7191d06e5ae13b","datavalue":{"value":{"amount":"+0.7681277990341187","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q580163$1D6F2A0F-987C-4EB1-9720-4B3C27A91A88","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dffa3637877e17220fcc20c205652f947c22cb6d","datavalue":{"value":{"entity-type":"item","numeric-id":4035633,"id":"Q4035633"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"72154c07c1558b8872ab1395e7bc82ccf8fa8cd8","datavalue":{"value":{"amount":"+0.7661623358726501","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q580163$E194CE3A-00C0-4599-979D-D33E4ADA4D4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ba9eeab51a0c847b238ade0a1e3f1af33aed6a2f","datavalue":{"value":{"entity-type":"item","numeric-id":3683420,"id":"Q3683420"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"af896dc404191f486ec79e925d6c5e1ee253585f","datavalue":{"value":{"amount":"+0.7656002044677734","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q580163$AEC3C2E8-153D-4AD7-9EA7-2E9142349D21","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithm for the minimax assignment problem with a sparse rectangular matrix","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Algorithm_for_the_minimax_assignment_problem_with_a_sparse_rectangular_matrix"}}}}}