{"paper":{"title":"The constant objective value property for combinatorial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Ante \\'Custi\\'c, Bettina Klinz","submitted_at":"2014-05-19T20:36:50Z","abstract_excerpt":"Given a combinatorial optimization problem, we aim at characterizing the set of all instances for which every feasible solution has the same objective value.\n  Our central result deals with multi-dimensional assignment problems. We show that for the axial and for the planar $d$-dimensional assignment problem instances with constant objective value property are characterized by sum-decomposable arrays. We provide a counterexample to show that the result does not carry over to general $d$-dimensional assignment problems.\n  Our result for the axial $d$-dimensional assignment problem can be shown "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6096","kind":"arxiv","version":2},"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"}