{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CHO35ZDIKXLBVOA4V3ZWWVGZQH","short_pith_number":"pith:CHO35ZDI","schema_version":"1.0","canonical_sha256":"11ddbee46855d61ab81caef36b54d981f6f15ebdabcb334df459158ec80d1cd3","source":{"kind":"arxiv","id":"1812.01228","version":1},"attestation_state":"computed","paper":{"title":"Solving multi-resource allocation and location problems in disaster management through linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behrooz Bodaghi, Nadezda Sukhorukova","submitted_at":"2018-12-04T05:40:15Z","abstract_excerpt":"In this paper we propose a new efficient linear programming based approach for multi-resource allocation and location problems in disaster management. Such problems require an integer solution and therefore, in most cases, the computations rely on integer and mixed-integer linear programming solvers. In general, these solvers can not handle large scaled problem. In this paper we demonstrate that there exists a large class of disaster management problems whose exact solutions can be obtained by applying the simplex method (linear programming). The results of numerical experiments are provided. "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.01228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-04T05:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"f6096f9156a0b54b795b340cb1032b7a29b4222e7877b7097b2a5975de1cf23e","abstract_canon_sha256":"012ae668784b31bfb7ee5753ea4a2a5d3168142ffe71e73f4814e1ec7facdf2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:13.044848Z","signature_b64":"LubBQSnP+nT8DPOhRMJdwmn+02MQr6I2oXKplLDcs50ABn2NX8QnPoucyu5iigK8I2GDTBnfpnwM4ttzfWN2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11ddbee46855d61ab81caef36b54d981f6f15ebdabcb334df459158ec80d1cd3","last_reissued_at":"2026-05-17T23:59:13.044306Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:13.044306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving multi-resource allocation and location problems in disaster management through linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behrooz Bodaghi, Nadezda Sukhorukova","submitted_at":"2018-12-04T05:40:15Z","abstract_excerpt":"In this paper we propose a new efficient linear programming based approach for multi-resource allocation and location problems in disaster management. Such problems require an integer solution and therefore, in most cases, the computations rely on integer and mixed-integer linear programming solvers. In general, these solvers can not handle large scaled problem. In this paper we demonstrate that there exists a large class of disaster management problems whose exact solutions can be obtained by applying the simplex method (linear programming). The results of numerical experiments are provided. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01228","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.01228","created_at":"2026-05-17T23:59:13.044396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01228v1","created_at":"2026-05-17T23:59:13.044396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01228","created_at":"2026-05-17T23:59:13.044396+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHO35ZDIKXLB","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHO35ZDIKXLBVOA4","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHO35ZDI","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH","json":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH.json","graph_json":"https://pith.science/api/pith-number/CHO35ZDIKXLBVOA4V3ZWWVGZQH/graph.json","events_json":"https://pith.science/api/pith-number/CHO35ZDIKXLBVOA4V3ZWWVGZQH/events.json","paper":"https://pith.science/paper/CHO35ZDI"},"agent_actions":{"view_html":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH","download_json":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH.json","view_paper":"https://pith.science/paper/CHO35ZDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01228&json=true","fetch_graph":"https://pith.science/api/pith-number/CHO35ZDIKXLBVOA4V3ZWWVGZQH/graph.json","fetch_events":"https://pith.science/api/pith-number/CHO35ZDIKXLBVOA4V3ZWWVGZQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH/action/storage_attestation","attest_author":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH/action/author_attestation","sign_citation":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH/action/citation_signature","submit_replication":"https://pith.science/pith/CHO35ZDIKXLBVOA4V3ZWWVGZQH/action/replication_record"}},"created_at":"2026-05-17T23:59:13.044396+00:00","updated_at":"2026-05-17T23:59:13.044396+00:00"}