{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/quadratic-unconstrained-binary-optimization","title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","arxiv_id":"1705.09844","date":"2017-05-27","proceeding":null,"authors":["Mark Lewis","Fred Glover"],"abstract":"The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a\nunifying model for representing a wide range of combinatorial optimization\nproblems, and for linking a variety of disciplines that face these problems. A\nnew class of quantum annealing computer that maps QUBO onto a physical qubit\nnetwork structure with specific size and edge density restrictions is\ngenerating a growing interest in ways to transform the underlying QUBO\nstructure into an equivalent graph having fewer nodes and edges. In this paper\nwe present rules for reducing the size of the QUBO matrix by identifying\nvariables whose value at optimality can be predetermined. We verify that the\nreductions improve both solution quality and time to solution and, in the case\nof metaheuristic methods where optimal solutions cannot be guaranteed, the\nquality of solutions obtained within reasonable time limits.\n  We discuss the general QUBO structural characteristics that can take\nadvantage of these reduction techniques and perform careful experimental design\nand analysis to identify and quantify the specific characteristics most\naffecting reduction. The rules make it possible to dramatically improve\nsolution times on a new set of problems using both the exact Cplex solver and a\ntabu search metaheuristic.","url_abs":"http://arxiv.org/abs/1705.09844v1","url_pdf":"http://arxiv.org/pdf/1705.09844v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"quadratic-unconstrained-binary-optimization","repo_url":"https://github.com/Brendan-Reid1991/CFD-Algorithms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"experimental-design","task_name":"Experimental Design"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Brendan-Reid1991/CFD-Algorithms","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1d9f4cd2aadf59bbfdf1333d68ff44c9c0855eed72478882d6a3a46889d65250","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}