{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5RPKAT2CGOV3B2C25TAHTPDBDW","short_pith_number":"pith:5RPKAT2C","schema_version":"1.0","canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","source":{"kind":"arxiv","id":"1908.05082","version":1},"attestation_state":"computed","paper":{"title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Christophe Duhamel, Iago A. Carvalho, Thiago F. Noronha","submitted_at":"2019-08-14T11:46:37Z","abstract_excerpt":"We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition Algorithm and two metaheuristics for min-max regret problems with interval data. Computational experiments developed on variations of MIPLIB instances show that the heuristics obtain good results in a reasonable computational time when compared to the Benders-like Decomposition algorithm."},"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":"1908.05082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T11:46:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9b6daa5a0e990915d9e0260e1a34fa384d0f632e65b2af92f33eb5dcc52e1a1a","abstract_canon_sha256":"c99fa00369b377fc8ef4fb6e80d8771957bf0aa583a677d3e5536fdb65b4e4d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:59.666911Z","signature_b64":"uMryCWPOdEQ//5N4/4jcE2KOIk7R+2rl4qtfok2UFnVlbUWQK7hksxCHP4LSzYwCP70R/rzfdMuzWy8DSbdNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","last_reissued_at":"2026-07-04T23:55:59.666542Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:59.666542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Christophe Duhamel, Iago A. Carvalho, Thiago F. Noronha","submitted_at":"2019-08-14T11:46:37Z","abstract_excerpt":"We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition Algorithm and two metaheuristics for min-max regret problems with interval data. Computational experiments developed on variations of MIPLIB instances show that the heuristics obtain good results in a reasonable computational time when compared to the Benders-like Decomposition algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05082","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05082/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.05082","created_at":"2026-07-04T23:55:59.666601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05082v1","created_at":"2026-07-04T23:55:59.666601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05082","created_at":"2026-07-04T23:55:59.666601+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RPKAT2CGOV3","created_at":"2026-07-04T23:55:59.666601+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RPKAT2CGOV3B2C2","created_at":"2026-07-04T23:55:59.666601+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RPKAT2C","created_at":"2026-07-04T23:55:59.666601+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/5RPKAT2CGOV3B2C25TAHTPDBDW","json":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW.json","graph_json":"https://pith.science/api/pith-number/5RPKAT2CGOV3B2C25TAHTPDBDW/graph.json","events_json":"https://pith.science/api/pith-number/5RPKAT2CGOV3B2C25TAHTPDBDW/events.json","paper":"https://pith.science/paper/5RPKAT2C"},"agent_actions":{"view_html":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW","download_json":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW.json","view_paper":"https://pith.science/paper/5RPKAT2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05082&json=true","fetch_graph":"https://pith.science/api/pith-number/5RPKAT2CGOV3B2C25TAHTPDBDW/graph.json","fetch_events":"https://pith.science/api/pith-number/5RPKAT2CGOV3B2C25TAHTPDBDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/action/storage_attestation","attest_author":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/action/author_attestation","sign_citation":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/action/citation_signature","submit_replication":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/action/replication_record"}},"created_at":"2026-07-04T23:55:59.666601+00:00","updated_at":"2026-07-04T23:55:59.666601+00:00"}