{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:56TWESJYNOFFGQX32OSBFV3BQZ","short_pith_number":"pith:56TWESJY","schema_version":"1.0","canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","source":{"kind":"arxiv","id":"2402.14868","version":1},"attestation_state":"computed","paper":{"title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felix Tamke, Florian Lin{\\ss}, Leopold Kuttner, Udo Buscher","submitted_at":"2024-02-21T11:58:26Z","abstract_excerpt":"This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously infeasible route can become feasible by adding a new customer if support constraints are enabled in the loading subproblem and call this the incremental feasibility property. Consequently, different infeasible path definitions apply to different 3L-CVRP variants and we introduce several variant-depending lifting steps to strengthen infeasible path inequalities. T"},"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":"2402.14868","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T11:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"62e6f05dbcd875c4e650424f47ee0cd309d3b1d98f15d9f25ec0a39bfa8e1243","abstract_canon_sha256":"c52e6eb80009ca6cfd2be417ee39727088923d44069ac59020bf7927b377db8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:19.210168Z","signature_b64":"Il/dCuWpz/Qlj9DuCU5dxm3tfLbjzy9S5ccbY+ofV3EibpIggDFS8tIETkZrjEWHZYHidMhLFsDH3uNEV/ABAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","last_reissued_at":"2026-07-05T07:48:19.209700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:19.209700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felix Tamke, Florian Lin{\\ss}, Leopold Kuttner, Udo Buscher","submitted_at":"2024-02-21T11:58:26Z","abstract_excerpt":"This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously infeasible route can become feasible by adding a new customer if support constraints are enabled in the loading subproblem and call this the incremental feasibility property. Consequently, different infeasible path definitions apply to different 3L-CVRP variants and we introduce several variant-depending lifting steps to strengthen infeasible path inequalities. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14868","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/2402.14868/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":"2402.14868","created_at":"2026-07-05T07:48:19.209759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.14868v1","created_at":"2026-07-05T07:48:19.209759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14868","created_at":"2026-07-05T07:48:19.209759+00:00"},{"alias_kind":"pith_short_12","alias_value":"56TWESJYNOFF","created_at":"2026-07-05T07:48:19.209759+00:00"},{"alias_kind":"pith_short_16","alias_value":"56TWESJYNOFFGQX3","created_at":"2026-07-05T07:48:19.209759+00:00"},{"alias_kind":"pith_short_8","alias_value":"56TWESJY","created_at":"2026-07-05T07:48:19.209759+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25970","citing_title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ","json":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ.json","graph_json":"https://pith.science/api/pith-number/56TWESJYNOFFGQX32OSBFV3BQZ/graph.json","events_json":"https://pith.science/api/pith-number/56TWESJYNOFFGQX32OSBFV3BQZ/events.json","paper":"https://pith.science/paper/56TWESJY"},"agent_actions":{"view_html":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ","download_json":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ.json","view_paper":"https://pith.science/paper/56TWESJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.14868&json=true","fetch_graph":"https://pith.science/api/pith-number/56TWESJYNOFFGQX32OSBFV3BQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/56TWESJYNOFFGQX32OSBFV3BQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/action/storage_attestation","attest_author":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/action/author_attestation","sign_citation":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/action/citation_signature","submit_replication":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/action/replication_record"}},"created_at":"2026-07-05T07:48:19.209759+00:00","updated_at":"2026-07-05T07:48:19.209759+00:00"}