{"entities":{"Q1608246":{"pageid":1618986,"ns":120,"title":"Item:Q1608246","lastrevid":72323241,"modified":"2026-04-14T04:08:03Z","type":"item","id":"Q1608246","labels":{"en":{"language":"en","value":"Remark on the paper ``A polynomial algorithm for the multi-index choice problem''"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1779281"}},"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":"Q1608246$D120DAF9-7A70-48DD-94B9-22CBBE4C7152","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c6266900aff62508bb677348b7b86d2ec300dbe3","datavalue":{"value":{"text":"Remark on the paper ``A polynomial algorithm for the multi-index choice problem''","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1608246$53B9365C-A94B-4693-AF4A-2B32AA93FE5F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6b0036bd3aab8d88ea885193c999483359cd16dd","datavalue":{"value":"0998.68090","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$A5AA5723-3990-42CA-A547-97D751B36A97","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0593753f370ec7ddb4f4a56df6dfc51dce12142d","datavalue":{"value":{"entity-type":"item","numeric-id":179196,"id":"Q179196"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1608246$BB6AB560-6424-48D9-AD65-0C4C9E240C9C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d6af157c5918abfe299ec35ff3da324affcd6152","datavalue":{"value":{"entity-type":"item","numeric-id":179197,"id":"Q179197"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1608246$0FBB403B-9CC3-4B37-BE6E-67833DCB6D62","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a438af6643ae7f561353c4bef7c698e900a48bd3","datavalue":{"value":{"entity-type":"item","numeric-id":178986,"id":"Q178986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1608246$57377848-9926-4AD3-BF33-767E0DFA33C9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c281157af5837e5656cca8245bad4b6412f057fd","datavalue":{"value":{"time":"+2002-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1608246$8B494BE7-E505-4577-A046-C07EB05FC959","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b65cc301db8da45080cba395fb36749e94ce3367","datavalue":{"value":"In this paper the authors construct a counterexample showing that the method of minimum element builds a matrix which is not a plan in the \\(p\\)-index \\((p>2)\\) planar choice problem. Thus, the principal statement that the minimum element method almost always builds up an asymptotically optimal plan in the \\(p\\)-index planar choice problem is incorrect. Note that the authors have elaborated a new algorithm for obtaining an asymptotically optimal solution to the three-planar choice problem of order \\(n\\) in \\(O(n^4)\\) steps.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$B28627AE-A72A-4F67-806E-9AF620BD2788","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4a5372688a0d668805df5d9ffd1da58833a0f595","datavalue":{"value":"68R05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$864562EB-6C3D-47C4-8303-E66BB1B075ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6247f04fad65d359a20e559b3e9499d6219d492e","datavalue":{"value":"05A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$40BA146D-967A-41A6-AFDB-376CD956EB2E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$DE2509D9-198F-4E2D-BC7B-48A64EC1E796","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7ddaa80bf0a693a36c1113ff6b7ad576f729940","datavalue":{"value":"68W40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$1BEEE76C-9974-4C5E-BC78-35A4C2C6F2F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$37161F0C-BC8B-4803-B51D-A037A59136AA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a2b8c1fa129522b03e34aec760f8f52733252b8f","datavalue":{"value":"1779281","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1608246$1FC6B649-E93B-4553-8BF0-12EE814B54C3","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4515be19377c5f68564f34e316888d388854ff4c","datavalue":{"value":"planar choice problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$C3B5FA84-DE63-4037-9F2E-3D4DC93E928F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fc544e482aa599702c82d69a25709014b297742d","datavalue":{"value":"polynomial algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$3A945D41-88C0-49D3-AD20-0BA40C2B9F21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ee85c8cf756e8ef2869d7467e2683c2189201995","datavalue":{"value":"minimum element method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$6EDF4639-A00A-4E0A-9A98-43FE31CE1213","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"311c918aa73c0095f25f775f111e8abd535d104e","datavalue":{"value":"optimal solution","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$F1AAD4F0-DFA9-4570-8A47-E5DF22DACAA0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9ebc2425e6015d5e2a26c14a2922e6263c0cbbd1","datavalue":{"value":"counterexample","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$E25AF7E2-5684-429E-BB9D-88486C9DEBD6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"495cddb2e7d07ef24a051004a4fe42e200a85aa0","datavalue":{"value":"matrix","type":"string"},"datatype":"string"},"type":"statement","id":"Q1608246$4DDFBCD7-9F51-4F28-BF9C-3C03242C2C81","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"ed265ba6e1e2136763ce4118f4ac2a5bd10314bc","datavalue":{"value":{"entity-type":"item","numeric-id":378460,"id":"Q378460"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1608246$08DA09A9-52CE-406C-8511-6182DEE34009","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":"Q1608246$5E3942DC-7168-45E2-8A70-EE7F33C56EE3","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2dbbfe3bf8a3403ed40be1dea092427fc039bd1b","datavalue":{"value":{"entity-type":"item","numeric-id":1852514,"id":"Q1852514"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bc2577960fe754f100dbfe8a0805e59d5a4f9c99","datavalue":{"value":{"amount":"+0.8421196341514587","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":"Q1608246$EB9FB1B0-D5AB-4F64-B19D-483D7BA5096E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fca383c774fe6cd2875742e4c09f7205852951d2","datavalue":{"value":{"entity-type":"item","numeric-id":5932956,"id":"Q5932956"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"91a232da6a47928d4410f64973399f15ce5c8165","datavalue":{"value":{"amount":"+0.836715817451477","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":"Q1608246$B9416CCC-1D7B-468A-9399-C7D97995C0C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0f650a1bf589605e12c6d2129063eaeaeeb56a4c","datavalue":{"value":{"entity-type":"item","numeric-id":1780259,"id":"Q1780259"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c7ca9a4cb3e4a0c34d821093a5e6af0b0ccb1062","datavalue":{"value":{"amount":"+0.7894928455352783","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":"Q1608246$03CE3001-6942-480B-9778-624F4DD1A73E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"792a8ec2497f92efc28f585c87b37d6ba6eafcd8","datavalue":{"value":{"entity-type":"item","numeric-id":5438151,"id":"Q5438151"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7c1fe625971b910f9c85b0487c93b373942af32c","datavalue":{"value":{"amount":"+0.7546507120132446","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":"Q1608246$D2EB56BC-F508-40FC-AC1D-F30AF50916BB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"298686792f55c5ddb38b8e35b04c96639949f67d","datavalue":{"value":{"entity-type":"item","numeric-id":852261,"id":"Q852261"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"40b5c78e761b0115da30dfe079234eea24cf3c21","datavalue":{"value":{"amount":"+0.7501090168952942","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":"Q1608246$DC34AD96-05B4-41E1-9178-1ADF7901E3C9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Remark on the paper ``A polynomial algorithm for the multi-index choice problem''","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Remark_on_the_paper_%60%60A_polynomial_algorithm_for_the_multi-index_choice_problem%27%27"}}}}}