{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4V7RVKHJNAD4VC754WJKBZKA67","short_pith_number":"pith:4V7RVKHJ","schema_version":"1.0","canonical_sha256":"e57f1aa8e96807ca8bfde592a0e540f7cd389e3c401a662dc28661c7b28c33a3","source":{"kind":"arxiv","id":"1802.03191","version":1},"attestation_state":"computed","paper":{"title":"An extended version of a Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Diego Ponce, Justo Puerto, Martine Labb\\'e, Samuel Deleplanque","submitted_at":"2018-02-09T10:25:47Z","abstract_excerpt":"The Discrete Ordered Median Problem (DOMP) is formulated as a set partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then, we apply a branch-price-and-cut algorithm to solve to optimality small to moderate size of DOMP in competitive computational time."},"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":"1802.03191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-09T10:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"fb7740071cc8ecaf27a4a3ecb1f2e0ad323745eda3cf5b9b1de46925a1e0e6b1","abstract_canon_sha256":"9399bb5b0358576a64a0ca58bbedf19c85f091307d789540610acd76cc0a9fc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.345959Z","signature_b64":"E6Ec91Gz7towNYon9FagwB2ohWt8pIirQZa7rYdgDf5C7Tvq9O/Egdzc4lDOVBBpfaRjsIkk7+/lDOYeTjiUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57f1aa8e96807ca8bfde592a0e540f7cd389e3c401a662dc28661c7b28c33a3","last_reissued_at":"2026-05-18T00:23:58.345422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.345422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An extended version of a Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Diego Ponce, Justo Puerto, Martine Labb\\'e, Samuel Deleplanque","submitted_at":"2018-02-09T10:25:47Z","abstract_excerpt":"The Discrete Ordered Median Problem (DOMP) is formulated as a set partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then, we apply a branch-price-and-cut algorithm to solve to optimality small to moderate size of DOMP in competitive computational time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03191","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":"1802.03191","created_at":"2026-05-18T00:23:58.345516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03191v1","created_at":"2026-05-18T00:23:58.345516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03191","created_at":"2026-05-18T00:23:58.345516+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V7RVKHJNAD4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V7RVKHJNAD4VC75","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V7RVKHJ","created_at":"2026-05-18T12:32:05.422762+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/4V7RVKHJNAD4VC754WJKBZKA67","json":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67.json","graph_json":"https://pith.science/api/pith-number/4V7RVKHJNAD4VC754WJKBZKA67/graph.json","events_json":"https://pith.science/api/pith-number/4V7RVKHJNAD4VC754WJKBZKA67/events.json","paper":"https://pith.science/paper/4V7RVKHJ"},"agent_actions":{"view_html":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67","download_json":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67.json","view_paper":"https://pith.science/paper/4V7RVKHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03191&json=true","fetch_graph":"https://pith.science/api/pith-number/4V7RVKHJNAD4VC754WJKBZKA67/graph.json","fetch_events":"https://pith.science/api/pith-number/4V7RVKHJNAD4VC754WJKBZKA67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67/action/storage_attestation","attest_author":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67/action/author_attestation","sign_citation":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67/action/citation_signature","submit_replication":"https://pith.science/pith/4V7RVKHJNAD4VC754WJKBZKA67/action/replication_record"}},"created_at":"2026-05-18T00:23:58.345516+00:00","updated_at":"2026-05-18T00:23:58.345516+00:00"}