{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:56L2B67CFAOZVYXY4OBPL63QYG","short_pith_number":"pith:56L2B67C","schema_version":"1.0","canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","source":{"kind":"arxiv","id":"1806.08871","version":1},"attestation_state":"computed","paper":{"title":"A Lagrange decomposition based Branch and Bound algorithm for the Optimal Mapping of Cloud Virtual Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adam Ouorou, Guanglei Wang, Walid Ben-Ameur","submitted_at":"2018-06-22T22:30:09Z","abstract_excerpt":"One of the challenges of cloud computing is to optimally and efficiently assign virtual ma- chines to physical machines. The aim of telecommunication operators is to minimize the map- ping cost while respecting constraints regarding location, assignment and capacity. In this paper we first propose an exact formulation leading to a 0-1 bilinear constrained problem. Then we introduce a variety of linear cuts by exploiting the problem structure and present a Lagrange decomposition based B&B algorithm to obtain optimal solutions efficiently. Numerically, we show that our valid inequalities close o"},"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":"1806.08871","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T22:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"a9525414f086a133833b8d70bfe8f0cd1448dae3d7366f0fe336e30d1839a7bf","abstract_canon_sha256":"eb2f89a9fd013b68ff2f7f1537326635ad21aae9e4929b03ed9675d18a098f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:31.039163Z","signature_b64":"2lYpcJgwdFdW+awOlkGQ0yKFO6nscfABDdlvisEF11jdES0ODPFq70xgTiOjI2vSDMO46w0kB++pJTsvvQhZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","last_reissued_at":"2026-05-18T00:12:31.038653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:31.038653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lagrange decomposition based Branch and Bound algorithm for the Optimal Mapping of Cloud Virtual Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adam Ouorou, Guanglei Wang, Walid Ben-Ameur","submitted_at":"2018-06-22T22:30:09Z","abstract_excerpt":"One of the challenges of cloud computing is to optimally and efficiently assign virtual ma- chines to physical machines. The aim of telecommunication operators is to minimize the map- ping cost while respecting constraints regarding location, assignment and capacity. In this paper we first propose an exact formulation leading to a 0-1 bilinear constrained problem. Then we introduce a variety of linear cuts by exploiting the problem structure and present a Lagrange decomposition based B&B algorithm to obtain optimal solutions efficiently. Numerically, we show that our valid inequalities close o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08871","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":"1806.08871","created_at":"2026-05-18T00:12:31.038730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08871v1","created_at":"2026-05-18T00:12:31.038730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08871","created_at":"2026-05-18T00:12:31.038730+00:00"},{"alias_kind":"pith_short_12","alias_value":"56L2B67CFAOZ","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"56L2B67CFAOZVYXY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"56L2B67C","created_at":"2026-05-18T12:32:08.215937+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/56L2B67CFAOZVYXY4OBPL63QYG","json":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG.json","graph_json":"https://pith.science/api/pith-number/56L2B67CFAOZVYXY4OBPL63QYG/graph.json","events_json":"https://pith.science/api/pith-number/56L2B67CFAOZVYXY4OBPL63QYG/events.json","paper":"https://pith.science/paper/56L2B67C"},"agent_actions":{"view_html":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG","download_json":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG.json","view_paper":"https://pith.science/paper/56L2B67C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08871&json=true","fetch_graph":"https://pith.science/api/pith-number/56L2B67CFAOZVYXY4OBPL63QYG/graph.json","fetch_events":"https://pith.science/api/pith-number/56L2B67CFAOZVYXY4OBPL63QYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/action/storage_attestation","attest_author":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/action/author_attestation","sign_citation":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/action/citation_signature","submit_replication":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/action/replication_record"}},"created_at":"2026-05-18T00:12:31.038730+00:00","updated_at":"2026-05-18T00:12:31.038730+00:00"}