{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XT7U6AYFZOP2KDIF4UVPSKRLRU","short_pith_number":"pith:XT7U6AYF","schema_version":"1.0","canonical_sha256":"bcff4f0305cb9fa50d05e52af92a2b8d168af30473a7109bd92157e8df8597ef","source":{"kind":"arxiv","id":"1411.5768","version":2},"attestation_state":"computed","paper":{"title":"Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Neumann, Sergey Polyakovskiy","submitted_at":"2014-11-21T04:53:50Z","abstract_excerpt":"Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. In order to solve the problems, we provide a pre-processing scheme as well as exact and approximate mixed integer programming (MIP) solutions. Our experimental results show the effectiveness of the MIP solutions and in particular point out that the appr"},"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":"1411.5768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T04:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"43b07245f4a6b0b6b3c167580faa47b046144863ade6b65e3381507d6fc5a0dc","abstract_canon_sha256":"d927f1b6dac52db7c3044f56098bcd7b78118c8922f2d295afe4e6ddb110612d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:49.108841Z","signature_b64":"dk1oGWFVPUItQXUdXZyaecayIcxq4+jvYpsZeBrvpYi0g25plkLuv63wlgIfz4VfoXpPP/OvRQPh2qRztiEzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcff4f0305cb9fa50d05e52af92a2b8d168af30473a7109bd92157e8df8597ef","last_reissued_at":"2026-05-18T02:18:49.107952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:49.107952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Neumann, Sergey Polyakovskiy","submitted_at":"2014-11-21T04:53:50Z","abstract_excerpt":"Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. In order to solve the problems, we provide a pre-processing scheme as well as exact and approximate mixed integer programming (MIP) solutions. Our experimental results show the effectiveness of the MIP solutions and in particular point out that the appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5768","kind":"arxiv","version":2},"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":"1411.5768","created_at":"2026-05-18T02:18:49.108088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5768v2","created_at":"2026-05-18T02:18:49.108088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5768","created_at":"2026-05-18T02:18:49.108088+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT7U6AYFZOP2","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT7U6AYFZOP2KDIF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT7U6AYF","created_at":"2026-05-18T12:28:57.508820+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/XT7U6AYFZOP2KDIF4UVPSKRLRU","json":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU.json","graph_json":"https://pith.science/api/pith-number/XT7U6AYFZOP2KDIF4UVPSKRLRU/graph.json","events_json":"https://pith.science/api/pith-number/XT7U6AYFZOP2KDIF4UVPSKRLRU/events.json","paper":"https://pith.science/paper/XT7U6AYF"},"agent_actions":{"view_html":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU","download_json":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU.json","view_paper":"https://pith.science/paper/XT7U6AYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5768&json=true","fetch_graph":"https://pith.science/api/pith-number/XT7U6AYFZOP2KDIF4UVPSKRLRU/graph.json","fetch_events":"https://pith.science/api/pith-number/XT7U6AYFZOP2KDIF4UVPSKRLRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU/action/storage_attestation","attest_author":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU/action/author_attestation","sign_citation":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU/action/citation_signature","submit_replication":"https://pith.science/pith/XT7U6AYFZOP2KDIF4UVPSKRLRU/action/replication_record"}},"created_at":"2026-05-18T02:18:49.108088+00:00","updated_at":"2026-05-18T02:18:49.108088+00:00"}