{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EHKVEOUU4SCCOQ7IBQQU5UUCXH","short_pith_number":"pith:EHKVEOUU","schema_version":"1.0","canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","source":{"kind":"arxiv","id":"1701.06317","version":1},"attestation_state":"computed","paper":{"title":"Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Raith, Anita Sch\\\"obel, Lisa Thom, Marie Schmidt","submitted_at":"2017-01-23T10:17:52Z","abstract_excerpt":"In this paper we develop two approaches to find minmax robust efficient solutions for multi-objective combinatorial optimization problems with cardinality-constrained uncertainty. First, we extend an algorithm of Bertsimas and Sim (2003) for the single-objective problem to multi-objective optimization. We propose also an enhancement to accelerate the algorithm, even for the single-objective case, and we develop a faster version for special multi-objective instances. Second, we introduce a deterministic multi-objective problem with sum and bottleneck functions, which provides a superset of the "},"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":"1701.06317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-23T10:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"134d5ccb92c82e75f6c7e677988f79ef01e9432f5d0f98163cdf0e924685dde8","abstract_canon_sha256":"9232c7eaa5f7330d0b85361b3e4361995ade14de53e5ee0b0d6592adda98b10d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.684656Z","signature_b64":"DepiD7sTOAJU6VdWcSH9zb7s6SGzIFI6TIDRTcIFBT3S9j/Z7gkIOIJjVzgbGQaIgd0SbqA9JoYnGMgDQ8S7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","last_reissued_at":"2026-05-18T00:52:18.684185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.684185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Raith, Anita Sch\\\"obel, Lisa Thom, Marie Schmidt","submitted_at":"2017-01-23T10:17:52Z","abstract_excerpt":"In this paper we develop two approaches to find minmax robust efficient solutions for multi-objective combinatorial optimization problems with cardinality-constrained uncertainty. First, we extend an algorithm of Bertsimas and Sim (2003) for the single-objective problem to multi-objective optimization. We propose also an enhancement to accelerate the algorithm, even for the single-objective case, and we develop a faster version for special multi-objective instances. Second, we introduce a deterministic multi-objective problem with sum and bottleneck functions, which provides a superset of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06317","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":"1701.06317","created_at":"2026-05-18T00:52:18.684248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06317v1","created_at":"2026-05-18T00:52:18.684248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06317","created_at":"2026-05-18T00:52:18.684248+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHKVEOUU4SCC","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHKVEOUU4SCCOQ7I","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHKVEOUU","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/EHKVEOUU4SCCOQ7IBQQU5UUCXH","json":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH.json","graph_json":"https://pith.science/api/pith-number/EHKVEOUU4SCCOQ7IBQQU5UUCXH/graph.json","events_json":"https://pith.science/api/pith-number/EHKVEOUU4SCCOQ7IBQQU5UUCXH/events.json","paper":"https://pith.science/paper/EHKVEOUU"},"agent_actions":{"view_html":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH","download_json":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH.json","view_paper":"https://pith.science/paper/EHKVEOUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06317&json=true","fetch_graph":"https://pith.science/api/pith-number/EHKVEOUU4SCCOQ7IBQQU5UUCXH/graph.json","fetch_events":"https://pith.science/api/pith-number/EHKVEOUU4SCCOQ7IBQQU5UUCXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/action/storage_attestation","attest_author":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/action/author_attestation","sign_citation":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/action/citation_signature","submit_replication":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/action/replication_record"}},"created_at":"2026-05-18T00:52:18.684248+00:00","updated_at":"2026-05-18T00:52:18.684248+00:00"}