{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IVYJVV5PTPHFSQNRIB3UT3PYKO","short_pith_number":"pith:IVYJVV5P","schema_version":"1.0","canonical_sha256":"45709ad7af9bce5941b1407749edf8538b4381ff198384302e3af8340a141ae9","source":{"kind":"arxiv","id":"2406.05775","version":1},"attestation_state":"computed","paper":{"title":"An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shahin Gelareh, Wei-Kun Chen, Wei-Yang Zhang, Yan-Ru Wang, Yu-Hong Dai","submitted_at":"2024-06-09T13:16:00Z","abstract_excerpt":"In the paper, we consider the competitive facility location problem with limited choice rule (CFLPLCR), which attempts to open a subset of facilities to maximize the net profit of a newcomer company, requiring customers to patronize only a limited number of opening facilities and an outside option. We propose an efficient branch-and-cut (B&C) approach for the CFLPLCR based on newly proposed mixed integer linear programming (MILP) formulations. Specifically, by establishing the submodularity of the probability function, we develop an MILP formulation for the CFLPLCR using the submodular inequal"},"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":"2406.05775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-09T13:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"29d05a96fee5237ba9cfe14f86cb2129776f5558bf7e4e3e1871ac4863f3a8c4","abstract_canon_sha256":"b7fd4ffff4cd1bd27e7e4cb6feb8719dc30ad3736d7242d7a6a57639427f7252"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:33.513947Z","signature_b64":"11DOrgmytCsAGbP+JqU0qwuOWiYQ+WggKFJkj7gAzRMgQK/WN/+gtD/z+RrACIzBEtZ+/f1Emi0SO1x3LEomAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45709ad7af9bce5941b1407749edf8538b4381ff198384302e3af8340a141ae9","last_reissued_at":"2026-07-05T08:29:33.513546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:33.513546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shahin Gelareh, Wei-Kun Chen, Wei-Yang Zhang, Yan-Ru Wang, Yu-Hong Dai","submitted_at":"2024-06-09T13:16:00Z","abstract_excerpt":"In the paper, we consider the competitive facility location problem with limited choice rule (CFLPLCR), which attempts to open a subset of facilities to maximize the net profit of a newcomer company, requiring customers to patronize only a limited number of opening facilities and an outside option. We propose an efficient branch-and-cut (B&C) approach for the CFLPLCR based on newly proposed mixed integer linear programming (MILP) formulations. Specifically, by establishing the submodularity of the probability function, we develop an MILP formulation for the CFLPLCR using the submodular inequal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05775","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.05775/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.05775","created_at":"2026-07-05T08:29:33.513603+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05775v1","created_at":"2026-07-05T08:29:33.513603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05775","created_at":"2026-07-05T08:29:33.513603+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVYJVV5PTPHF","created_at":"2026-07-05T08:29:33.513603+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVYJVV5PTPHFSQNR","created_at":"2026-07-05T08:29:33.513603+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVYJVV5P","created_at":"2026-07-05T08:29:33.513603+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/IVYJVV5PTPHFSQNRIB3UT3PYKO","json":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO.json","graph_json":"https://pith.science/api/pith-number/IVYJVV5PTPHFSQNRIB3UT3PYKO/graph.json","events_json":"https://pith.science/api/pith-number/IVYJVV5PTPHFSQNRIB3UT3PYKO/events.json","paper":"https://pith.science/paper/IVYJVV5P"},"agent_actions":{"view_html":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO","download_json":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO.json","view_paper":"https://pith.science/paper/IVYJVV5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05775&json=true","fetch_graph":"https://pith.science/api/pith-number/IVYJVV5PTPHFSQNRIB3UT3PYKO/graph.json","fetch_events":"https://pith.science/api/pith-number/IVYJVV5PTPHFSQNRIB3UT3PYKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO/action/storage_attestation","attest_author":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO/action/author_attestation","sign_citation":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO/action/citation_signature","submit_replication":"https://pith.science/pith/IVYJVV5PTPHFSQNRIB3UT3PYKO/action/replication_record"}},"created_at":"2026-07-05T08:29:33.513603+00:00","updated_at":"2026-07-05T08:29:33.513603+00:00"}