{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LRXGEUOWN65ZEGZD5VIQ6DLD2Q","short_pith_number":"pith:LRXGEUOW","schema_version":"1.0","canonical_sha256":"5c6e6251d66fbb921b23ed510f0d63d4031a98233428178af77f332a9d0e06a5","source":{"kind":"arxiv","id":"1512.02369","version":1},"attestation_state":"computed","paper":{"title":"A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christoph Buchheim, Francesco Rinaldi, Long Trieu, Marianna De Santis, Stefano Lucidi","submitted_at":"2015-12-08T08:54:16Z","abstract_excerpt":"We propose a feasible active set method for convex quadratic programming problems with non-negativity constraints. This method is specifically designed to be embedded into a branch-and-bound algorithm for convex quadratic mixed integer programming problems. The branch-and-bound algorithm generalizes the approach for unconstrained convex quadratic integer programming proposed by Buchheim, Caprara and Lodi to the presence of linear constraints. The main feature of the latter approach consists in a sophisticated preprocessing phase, leading to a fast enumeration of the branch-and-bound nodes. Mor"},"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.02369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-08T08:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"5ce1fd3a1f04255e270c53d30950da15c11014251f39b96283fb2383b8fa5a52","abstract_canon_sha256":"fd0598e91444a4ffe808290171697926dff7dad240c54753fdee780e004afc52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.812263Z","signature_b64":"eEsKVHZw+2gHRfu6wUUIM78TQGgFuco11K7iRreOhIjbPxdrFQx4jmskWL7GZUBBIhEBzY6nImyUx3MOUOyPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c6e6251d66fbb921b23ed510f0d63d4031a98233428178af77f332a9d0e06a5","last_reissued_at":"2026-05-18T01:24:44.811661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.811661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christoph Buchheim, Francesco Rinaldi, Long Trieu, Marianna De Santis, Stefano Lucidi","submitted_at":"2015-12-08T08:54:16Z","abstract_excerpt":"We propose a feasible active set method for convex quadratic programming problems with non-negativity constraints. This method is specifically designed to be embedded into a branch-and-bound algorithm for convex quadratic mixed integer programming problems. The branch-and-bound algorithm generalizes the approach for unconstrained convex quadratic integer programming proposed by Buchheim, Caprara and Lodi to the presence of linear constraints. The main feature of the latter approach consists in a sophisticated preprocessing phase, leading to a fast enumeration of the branch-and-bound nodes. Mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02369","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.02369","created_at":"2026-05-18T01:24:44.811737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02369v1","created_at":"2026-05-18T01:24:44.811737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02369","created_at":"2026-05-18T01:24:44.811737+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRXGEUOWN65Z","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRXGEUOWN65ZEGZD","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRXGEUOW","created_at":"2026-05-18T12:29:29.992203+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/LRXGEUOWN65ZEGZD5VIQ6DLD2Q","json":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q.json","graph_json":"https://pith.science/api/pith-number/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/graph.json","events_json":"https://pith.science/api/pith-number/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/events.json","paper":"https://pith.science/paper/LRXGEUOW"},"agent_actions":{"view_html":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q","download_json":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q.json","view_paper":"https://pith.science/paper/LRXGEUOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02369&json=true","fetch_graph":"https://pith.science/api/pith-number/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/action/storage_attestation","attest_author":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/action/author_attestation","sign_citation":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/action/citation_signature","submit_replication":"https://pith.science/pith/LRXGEUOWN65ZEGZD5VIQ6DLD2Q/action/replication_record"}},"created_at":"2026-05-18T01:24:44.811737+00:00","updated_at":"2026-05-18T01:24:44.811737+00:00"}