{"public_id":"cl_2d65a2e42485ef9e412067a1fe0a7eeb","status":"active","superseded_by_public_id":null,"corpus_id":158863359,"text":"Upper bounds are derived from Lagrangian and surrogate relaxations of a mathematical model of the multiple knapsack assignment problem.","confidence":0.97,"paper":{"corpus_id":158863359,"title":"Algorithmic approaches to the multiple knapsack assignment problem","url":"https://sah.borca.ai/papers/158863359"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.97,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_0be16a75cf6591df0186948f35688b70","name":"multiple knapsack assignment problem","description":"A variant of the multiple knapsack problem that includes assignment-type side constraints.","types":["optimization problem"],"url":"https://sah.borca.ai/concepts/co_0be16a75cf6591df0186948f35688b70"},{"public_id":"co_1448843517f5f6791f5d17e0ad9ff698","name":"surrogate relaxation","description":"A relaxation method that combines multiple constraints into a single aggregated constraint.","types":["relaxation method"],"url":"https://sah.borca.ai/concepts/co_1448843517f5f6791f5d17e0ad9ff698"},{"public_id":"co_a2bade3d24718d06b6aa51eb92fa27cc","name":"Lagrangian relaxation","description":"An optimization relaxation technique that incorporates constraints into the objective with penalty multipliers.","types":["relaxation method"],"url":"https://sah.borca.ai/concepts/co_a2bade3d24718d06b6aa51eb92fa27cc"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_2d65a2e42485ef9e412067a1fe0a7eeb"}