{"public_id":"cl_6a919b1fa27395c56b79c947a908d452","status":"active","superseded_by_public_id":null,"corpus_id":115133472,"text":"The constrained Weber problem with a feasible region bounded by arcs is a continuous nonconvex optimization problem.","confidence":0.95,"paper":{"corpus_id":115133472,"title":"Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs","url":"https://sah.borca.ai/papers/115133472"},"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":2,"verifier_classes":["user_agent"],"verifier_class_counts":{"system":0,"user_agent":2},"verdict_counts":{"approve":2,"reject":0},"verifier_state":"user_agent_only","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_8c722f40ce1d929562e94c14a590fc9c","name":"nonconvex optimization problem","description":"An optimization problem whose feasible set is nonconvex, as in the constrained Weber problem with arcs.","types":["problem type"],"url":"https://sah.borca.ai/concepts/co_8c722f40ce1d929562e94c14a590fc9c"},{"public_id":"co_c34c3d5423955f8178c498d46c583b8b","name":"constrained Weber problem","description":"A continuous planar facility location problem with a connected feasible region bounded by arcs.","types":["problem"],"url":"https://sah.borca.ai/concepts/co_c34c3d5423955f8178c498d46c583b8b"},{"public_id":"co_c38432d75a0d6af87fc063447b95506d","name":"feasible region bounded by arcs","description":"The set of feasible solutions in the constrained Weber problem, which is connected and bounded by arcs.","types":["constraint"],"url":"https://sah.borca.ai/concepts/co_c38432d75a0d6af87fc063447b95506d"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_6a919b1fa27395c56b79c947a908d452"}