{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2K3AE4E6HBWJHHEOF44WF7QRKR","short_pith_number":"pith:2K3AE4E6","schema_version":"1.0","canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","source":{"kind":"arxiv","id":"1512.07449","version":1},"attestation_state":"computed","paper":{"title":"The lateral transhipment problem with a-priori routes, and a lot sizing application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Romauch, Richard F. Hartl, Thibaut Vidal","submitted_at":"2015-12-23T12:28:10Z","abstract_excerpt":"We propose exact solution approaches for a lateral transhipment problem which, given a pre-specified sequence of customers, seeks an optimal inventory redistribution plan considering travel costs and profits dependent on inventory levels. Trip-duration and vehicle-capacity constraints are also imposed. The same problem arises in some lot sizing applications, in the presence of setup costs and equipment re-qualifications.\n  We introduce a pure dynamic programming approach and a branch-and-bound framework that combines dynamic programming with Lagrangian relaxation. Computational experiments are"},"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":"1512.07449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T12:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"53a9141c25be64f7b528751fb86e96c73ec60475e906a69b094a3f703c32b43d","abstract_canon_sha256":"6c6920c0215d1738c1306b9a08ecf4026f56768b794c7c5118f1b31b8e3ade70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.645474Z","signature_b64":"vbpO++3j8cylyPtCsucZTI6jOoPmCUF2hTRtCLXbesDfKX/2jD4YqNuSKLhprpAZu4LELJrplM6g/M9N7GV1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","last_reissued_at":"2026-05-18T01:23:49.644826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.644826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The lateral transhipment problem with a-priori routes, and a lot sizing application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Romauch, Richard F. Hartl, Thibaut Vidal","submitted_at":"2015-12-23T12:28:10Z","abstract_excerpt":"We propose exact solution approaches for a lateral transhipment problem which, given a pre-specified sequence of customers, seeks an optimal inventory redistribution plan considering travel costs and profits dependent on inventory levels. Trip-duration and vehicle-capacity constraints are also imposed. The same problem arises in some lot sizing applications, in the presence of setup costs and equipment re-qualifications.\n  We introduce a pure dynamic programming approach and a branch-and-bound framework that combines dynamic programming with Lagrangian relaxation. Computational experiments are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07449","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":"1512.07449","created_at":"2026-05-18T01:23:49.644900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07449v1","created_at":"2026-05-18T01:23:49.644900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07449","created_at":"2026-05-18T01:23:49.644900+00:00"},{"alias_kind":"pith_short_12","alias_value":"2K3AE4E6HBWJ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2K3AE4E6HBWJHHEO","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2K3AE4E6","created_at":"2026-05-18T12:28:59.999130+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/2K3AE4E6HBWJHHEOF44WF7QRKR","json":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR.json","graph_json":"https://pith.science/api/pith-number/2K3AE4E6HBWJHHEOF44WF7QRKR/graph.json","events_json":"https://pith.science/api/pith-number/2K3AE4E6HBWJHHEOF44WF7QRKR/events.json","paper":"https://pith.science/paper/2K3AE4E6"},"agent_actions":{"view_html":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR","download_json":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR.json","view_paper":"https://pith.science/paper/2K3AE4E6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07449&json=true","fetch_graph":"https://pith.science/api/pith-number/2K3AE4E6HBWJHHEOF44WF7QRKR/graph.json","fetch_events":"https://pith.science/api/pith-number/2K3AE4E6HBWJHHEOF44WF7QRKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/action/storage_attestation","attest_author":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/action/author_attestation","sign_citation":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/action/citation_signature","submit_replication":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/action/replication_record"}},"created_at":"2026-05-18T01:23:49.644900+00:00","updated_at":"2026-05-18T01:23:49.644900+00:00"}