{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EEYFLWWTBRMQB5UWED2LM5VX5Z","short_pith_number":"pith:EEYFLWWT","schema_version":"1.0","canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","source":{"kind":"arxiv","id":"1708.04127","version":3},"attestation_state":"computed","paper":{"title":"A branch, price and remember algorithm for the U shaped assembly line balancing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abdolmajid Yolmeh, Najmeh Salehi","submitted_at":"2017-08-14T14:08:46Z","abstract_excerpt":"In this paper we propose a branch, price and remember algorithm to solve the U shaped assembly line balancing problem. Our proposed algorithm uses a column generation approach to obtain tight lower bounds for this problem. It also stores generated columns in memory to enhance the speed of column generation approach. We also develop a modification of Hoffman algorithm to obtain high quality upper bounds. Our computational results show that our proposed algorithm is able to optimally solve 255 of Scholl's well-known 269 benchmark problems. Previous best known exact algorithm, ULINO, is able to s"},"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":"1708.04127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-14T14:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"0806146b4c0ead0e8461cc731060172cfd6bc67b3da60554a578e54d0224aba7","abstract_canon_sha256":"6b16b934dcb4f9c099778f5b194f4bb46895a60f0f2ff888190358d85e4895eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:08.305384Z","signature_b64":"SLszNUCI4xuqnMAjdj6QsJtZLwA3/q5S6qqYU5ddOmefJ1fYracZcAK2dHiZbvpM/8wAihRrh+ENCDdInNTqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","last_reissued_at":"2026-05-18T00:36:08.304696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:08.304696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A branch, price and remember algorithm for the U shaped assembly line balancing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abdolmajid Yolmeh, Najmeh Salehi","submitted_at":"2017-08-14T14:08:46Z","abstract_excerpt":"In this paper we propose a branch, price and remember algorithm to solve the U shaped assembly line balancing problem. Our proposed algorithm uses a column generation approach to obtain tight lower bounds for this problem. It also stores generated columns in memory to enhance the speed of column generation approach. We also develop a modification of Hoffman algorithm to obtain high quality upper bounds. Our computational results show that our proposed algorithm is able to optimally solve 255 of Scholl's well-known 269 benchmark problems. Previous best known exact algorithm, ULINO, is able to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04127","kind":"arxiv","version":3},"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":"1708.04127","created_at":"2026-05-18T00:36:08.304797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04127v3","created_at":"2026-05-18T00:36:08.304797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04127","created_at":"2026-05-18T00:36:08.304797+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEYFLWWTBRMQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEYFLWWTBRMQB5UW","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEYFLWWT","created_at":"2026-05-18T12:31:12.930513+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/EEYFLWWTBRMQB5UWED2LM5VX5Z","json":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z.json","graph_json":"https://pith.science/api/pith-number/EEYFLWWTBRMQB5UWED2LM5VX5Z/graph.json","events_json":"https://pith.science/api/pith-number/EEYFLWWTBRMQB5UWED2LM5VX5Z/events.json","paper":"https://pith.science/paper/EEYFLWWT"},"agent_actions":{"view_html":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z","download_json":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z.json","view_paper":"https://pith.science/paper/EEYFLWWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04127&json=true","fetch_graph":"https://pith.science/api/pith-number/EEYFLWWTBRMQB5UWED2LM5VX5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EEYFLWWTBRMQB5UWED2LM5VX5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/action/storage_attestation","attest_author":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/action/author_attestation","sign_citation":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/action/citation_signature","submit_replication":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/action/replication_record"}},"created_at":"2026-05-18T00:36:08.304797+00:00","updated_at":"2026-05-18T00:36:08.304797+00:00"}