{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XQC74C4BWWDACDZ3PK54XNDQAF","short_pith_number":"pith:XQC74C4B","schema_version":"1.0","canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","source":{"kind":"arxiv","id":"1705.09040","version":2},"attestation_state":"computed","paper":{"title":"A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Alper Sen, Philip Kaminsky","submitted_at":"2017-05-25T04:26:30Z","abstract_excerpt":"We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic quadratic mixed-integer formulation. This new formulation, together with McCormick inequalities exploiting the capacity constraints, enables the solution of large instances using commercial optimization sof"},"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":"1705.09040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T04:26:30Z","cross_cats_sorted":[],"title_canon_sha256":"2c50b27c269635be92d0e7a99c3e7cf0f523c2699ab527b6f76726f1c421057e","abstract_canon_sha256":"e6a1dffd2a636dcb3151b9f69b6b01c9467913588f6e5c361999d8316a86358f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:08.543721Z","signature_b64":"+BmaUQ/WXCayPAHE3gqaZdm2OnGnJEGYhfRakpqChhjLoWVUBFtjOWxCwxIwsYy5yxGSD5plZl/JRlCXNA+kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","last_reissued_at":"2026-05-18T00:38:08.543235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:08.543235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Alper Sen, Philip Kaminsky","submitted_at":"2017-05-25T04:26:30Z","abstract_excerpt":"We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic quadratic mixed-integer formulation. This new formulation, together with McCormick inequalities exploiting the capacity constraints, enables the solution of large instances using commercial optimization sof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09040","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":"1705.09040","created_at":"2026-05-18T00:38:08.543302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09040v2","created_at":"2026-05-18T00:38:08.543302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09040","created_at":"2026-05-18T00:38:08.543302+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQC74C4BWWDA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQC74C4BWWDACDZ3","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQC74C4B","created_at":"2026-05-18T12:31:56.362134+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/XQC74C4BWWDACDZ3PK54XNDQAF","json":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF.json","graph_json":"https://pith.science/api/pith-number/XQC74C4BWWDACDZ3PK54XNDQAF/graph.json","events_json":"https://pith.science/api/pith-number/XQC74C4BWWDACDZ3PK54XNDQAF/events.json","paper":"https://pith.science/paper/XQC74C4B"},"agent_actions":{"view_html":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF","download_json":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF.json","view_paper":"https://pith.science/paper/XQC74C4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09040&json=true","fetch_graph":"https://pith.science/api/pith-number/XQC74C4BWWDACDZ3PK54XNDQAF/graph.json","fetch_events":"https://pith.science/api/pith-number/XQC74C4BWWDACDZ3PK54XNDQAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/action/storage_attestation","attest_author":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/action/author_attestation","sign_citation":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/action/citation_signature","submit_replication":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/action/replication_record"}},"created_at":"2026-05-18T00:38:08.543302+00:00","updated_at":"2026-05-18T00:38:08.543302+00:00"}