{ "counts": { "instances": 989, "leaderboard_entries": 588, "problems": 10, "results": 589, "submission_sets": 26 }, "generated_at": "2026-06-09T18:40:57Z", "images": [ { "asset_path": "assets/images/mip_density_optsolvedIn_plot_aug25.png", "source_path": "paper/images/mip_density_optsolvedIn_plot_aug25.png" }, { "asset_path": "assets/images/qubo_density_optsolvedIn_plot_aug25.png", "source_path": "paper/images/qubo_density_optsolvedIn_plot_aug25.png" } ], "instances": [ { "best_date": "8. Mar. 2026", "best_numeric": -201117.0, "best_submission": "20260308_Arvak_Hinderink", "best_submitter": "Daniel Hinderink (hiq-lab)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/ms_03_050_002_summary.csv", "best_value": "-201117", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_050_002", "instance": "ms_03_050_002", "paper_context": "MIP, 23 vars, density 0.899, optimal yes; QUBO, 116 vars, density 0.543, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.898550725", "feasible": "", "file": "ms_03_050_002.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.542587681", "feasible": "yes", "file": "ms_03_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_03_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/ms_03_050_005_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_050_005", "instance": "ms_03_050_005", "paper_context": "MIP, 23 vars, density 0.899, optimal yes; QUBO, 116 vars, density 0.543, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.898550725", "feasible": "", "file": "ms_03_050_005.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.542587681", "feasible": "yes", "file": "ms_03_050_005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_050_005.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_050_005.opt.sol", "source_path": "01-marketsplit/instances/ms_03_050_005.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_050_005.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/ms_03_050_007_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_050_007", "instance": "ms_03_050_007", "paper_context": "MIP, 23 vars, density 0.855, optimal yes; QUBO, 116 vars, density 0.528, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.855072464", "feasible": "", "file": "ms_03_050_007.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.528293546", "feasible": "yes", "file": "ms_03_050_007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_050_007.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_050_007.opt.sol", "source_path": "01-marketsplit/instances/ms_03_050_007.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_050_007.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/ms_03_050_009_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_050_009", "instance": "ms_03_050_009", "paper_context": "MIP, 23 vars, density 0.87, optimal yes; QUBO, 116 vars, density 0.533, optimal yes", "paper_metrics": [ { "coeff_range": "49", "density": "0.869565217", "feasible": "", "file": "ms_03_050_009.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.533156499", "feasible": "yes", "file": "ms_03_050_009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_050_009.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_050_009.opt.sol", "source_path": "01-marketsplit/instances/ms_03_050_009.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_050_009.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/ms_03_100_001_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_100_001", "instance": "ms_03_100_001", "paper_context": "MIP, 23 vars, density 0.884, optimal yes; QUBO, 116 vars, density 0.538, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.884057971", "feasible": "", "file": "ms_03_100_001.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.53787209", "feasible": "yes", "file": "ms_03_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_100_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_100_001.opt.sol", "source_path": "01-marketsplit/instances/ms_03_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_100_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/ms_03_100_012_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_100_012", "instance": "ms_03_100_012", "paper_context": "MIP, 23 vars, density 0.899, optimal yes; QUBO, 116 vars, density 0.543, optimal yes", "paper_metrics": [ { "coeff_range": "99", "density": "0.898550725", "feasible": "", "file": "ms_03_100_012.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.542587681", "feasible": "yes", "file": "ms_03_100_012.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_100_012.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_100_012.opt.sol", "source_path": "01-marketsplit/instances/ms_03_100_012.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_100_012.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/ms_03_100_019_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_100_019", "instance": "ms_03_100_019", "paper_context": "MIP, 23 vars, density 0.913, optimal yes; QUBO, 116 vars, density 0.547, optimal yes", "paper_metrics": [ { "coeff_range": "97", "density": "0.913043478", "feasible": "", "file": "ms_03_100_019.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.547303271", "feasible": "yes", "file": "ms_03_100_019.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_100_019.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_100_019.opt.sol", "source_path": "01-marketsplit/instances/ms_03_100_019.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_100_019.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:32:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/ms_03_100_022_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_100_022", "instance": "ms_03_100_022", "paper_context": "MIP, 23 vars, density 0.913, optimal yes; QUBO, 116 vars, density 0.547, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.913043478", "feasible": "", "file": "ms_03_100_022.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.547303271", "feasible": "yes", "file": "ms_03_100_022.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_100_022.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_100_022.opt.sol", "source_path": "01-marketsplit/instances/ms_03_100_022.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_100_022.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/ms_03_200_050_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_200_050", "instance": "ms_03_200_050", "paper_context": "MIP, 23 vars, density 0.913, optimal yes; QUBO, 116 vars, density 0.547, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.913043478", "feasible": "", "file": "ms_03_200_050.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.547303271", "feasible": "yes", "file": "ms_03_200_050.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_200_050.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_200_050.opt.sol", "source_path": "01-marketsplit/instances/ms_03_200_050.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_200_050.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/ms_03_200_068_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_200_068", "instance": "ms_03_200_068", "paper_context": "MIP, 23 vars, density 0.913, optimal yes; QUBO, 116 vars, density 0.547, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.913043478", "feasible": "", "file": "ms_03_200_068.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.547303271", "feasible": "yes", "file": "ms_03_200_068.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_200_068.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_200_068.opt.sol", "source_path": "01-marketsplit/instances/ms_03_200_068.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_200_068.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/ms_03_200_161_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_200_161", "instance": "ms_03_200_161", "paper_context": "MIP, 23 vars, density 0.899, optimal yes; QUBO, 116 vars, density 0.543, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.898550725", "feasible": "", "file": "ms_03_200_161.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.542587681", "feasible": "yes", "file": "ms_03_200_161.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_200_161.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_200_161.opt.sol", "source_path": "01-marketsplit/instances/ms_03_200_161.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_200_161.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/ms_03_200_177_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_03_200_177", "instance": "ms_03_200_177", "paper_context": "MIP, 23 vars, density 0.899, optimal yes; QUBO, 116 vars, density 0.543, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.898550725", "feasible": "", "file": "ms_03_200_177.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "23", "obj_value": "0", "optimal": "yes", "problem_size": "8.306623863" }, { "coeff_range": "4.61E+18", "density": "0.542587681", "feasible": "yes", "file": "ms_03_200_177.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "116", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_03_200_177.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_03_200_177.opt.sol", "source_path": "01-marketsplit/instances/ms_03_200_177.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_03_200_177.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/ms_04_050_001_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_050_001", "instance": "ms_04_050_001", "paper_context": "MIP, 34 vars, density 0.89, optimal yes; QUBO, 158 vars, density 0.503, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.889705882", "feasible": "", "file": "ms_04_050_001.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.503224266", "feasible": "yes", "file": "ms_04_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_04_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/ms_04_050_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_050_003", "instance": "ms_04_050_003", "paper_context": "MIP, 34 vars, density 0.904, optimal yes; QUBO, 158 vars, density 0.508, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.904411765", "feasible": "", "file": "ms_04_050_003.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.508319401", "feasible": "yes", "file": "ms_04_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_04_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/ms_04_050_004_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_050_004", "instance": "ms_04_050_004", "paper_context": "MIP, 34 vars, density 0.89, optimal yes; QUBO, 158 vars, density 0.503, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.889705882", "feasible": "", "file": "ms_04_050_004.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.503224266", "feasible": "yes", "file": "ms_04_050_004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_050_004.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_050_004.opt.sol", "source_path": "01-marketsplit/instances/ms_04_050_004.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_050_004.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:33:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/ms_04_050_005_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_050_005", "instance": "ms_04_050_005", "paper_context": "MIP, 34 vars, density 0.897, optimal yes; QUBO, 158 vars, density 0.506, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.897058824", "feasible": "", "file": "ms_04_050_005.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.505771833", "feasible": "yes", "file": "ms_04_050_005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_050_005.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_050_005.opt.sol", "source_path": "01-marketsplit/instances/ms_04_050_005.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_050_005.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/ms_04_100_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_100_003", "instance": "ms_04_100_003", "paper_context": "MIP, 34 vars, density 0.912, optimal yes; QUBO, 158 vars, density 0.511, optimal yes", "paper_metrics": [ { "coeff_range": "99", "density": "0.911764706", "feasible": "", "file": "ms_04_100_003.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.510866969", "feasible": "yes", "file": "ms_04_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_04_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/ms_04_100_009_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_100_009", "instance": "ms_04_100_009", "paper_context": "MIP, 34 vars, density 0.904, optimal yes; QUBO, 158 vars, density 0.508, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.904411765", "feasible": "", "file": "ms_04_100_009.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.508319401", "feasible": "yes", "file": "ms_04_100_009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_100_009.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_100_009.opt.sol", "source_path": "01-marketsplit/instances/ms_04_100_009.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_100_009.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/ms_04_100_013_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_100_013", "instance": "ms_04_100_013", "paper_context": "MIP, 34 vars, density 0.904, optimal yes; QUBO, 158 vars, density 0.508, optimal yes", "paper_metrics": [ { "coeff_range": "99", "density": "0.904411765", "feasible": "", "file": "ms_04_100_013.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.508319401", "feasible": "yes", "file": "ms_04_100_013.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_100_013.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_100_013.opt.sol", "source_path": "01-marketsplit/instances/ms_04_100_013.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_100_013.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/ms_04_100_015_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_100_015", "instance": "ms_04_100_015", "paper_context": "MIP, 34 vars, density 0.912, optimal yes; QUBO, 158 vars, density 0.511, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.911764706", "feasible": "", "file": "ms_04_100_015.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.510866969", "feasible": "yes", "file": "ms_04_100_015.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_100_015.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_100_015.opt.sol", "source_path": "01-marketsplit/instances/ms_04_100_015.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_100_015.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/ms_04_200_030_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_200_030", "instance": "ms_04_200_030", "paper_context": "MIP, 34 vars, density 0.904, optimal yes; QUBO, 158 vars, density 0.508, optimal yes", "paper_metrics": [ { "coeff_range": "196", "density": "0.904411765", "feasible": "", "file": "ms_04_200_030.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.508319401", "feasible": "yes", "file": "ms_04_200_030.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_200_030.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_200_030.opt.sol", "source_path": "01-marketsplit/instances/ms_04_200_030.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_200_030.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/ms_04_200_150_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_200_150", "instance": "ms_04_200_150", "paper_context": "MIP, 34 vars, density 0.904, optimal yes; QUBO, 158 vars, density 0.508, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.904411765", "feasible": "", "file": "ms_04_200_150.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.508319401", "feasible": "yes", "file": "ms_04_200_150.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_200_150.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_200_150.opt.sol", "source_path": "01-marketsplit/instances/ms_04_200_150.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_200_150.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/ms_04_200_174_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_200_174", "instance": "ms_04_200_174", "paper_context": "MIP, 34 vars, density 0.912, optimal yes; QUBO, 158 vars, density 0.511, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.911764706", "feasible": "", "file": "ms_04_200_174.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.510866969", "feasible": "yes", "file": "ms_04_200_174.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_200_174.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_200_174.opt.sol", "source_path": "01-marketsplit/instances/ms_04_200_174.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_200_174.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:34:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/ms_04_200_176_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_04_200_176", "instance": "ms_04_200_176", "paper_context": "MIP, 34 vars, density 0.912, optimal yes; QUBO, 158 vars, density 0.511, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.911764706", "feasible": "", "file": "ms_04_200_176.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "34", "obj_value": "0", "optimal": "yes", "problem_size": "11.66190379" }, { "coeff_range": "4.61E+18", "density": "0.510866969", "feasible": "yes", "file": "ms_04_200_176.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_04_200_176.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_04_200_176.opt.sol", "source_path": "01-marketsplit/instances/ms_04_200_176.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_04_200_176.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/ms_05_050_001_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_050_001", "instance": "ms_05_050_001", "paper_context": "MIP, 45 vars, density 0.893, optimal yes; QUBO, 200 vars, density 0.484, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.893333333", "feasible": "", "file": "ms_05_050_001.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.484179104", "feasible": "yes", "file": "ms_05_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_05_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/ms_05_050_002_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_050_002", "instance": "ms_05_050_002", "paper_context": "MIP, 45 vars, density 0.893, optimal yes; QUBO, 200 vars, density 0.484, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.893333333", "feasible": "", "file": "ms_05_050_002.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.484179104", "feasible": "yes", "file": "ms_05_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_05_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/ms_05_050_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_050_003", "instance": "ms_05_050_003", "paper_context": "MIP, 45 vars, density 0.898, optimal yes; QUBO, 200 vars, density 0.486, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.897777778", "feasible": "", "file": "ms_05_050_003.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.485771144", "feasible": "yes", "file": "ms_05_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_05_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/ms_05_050_004_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_050_004", "instance": "ms_05_050_004", "paper_context": "MIP, 45 vars, density 0.88, optimal yes; QUBO, 200 vars, density 0.479, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.88", "feasible": "", "file": "ms_05_050_004.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.479402985", "feasible": "yes", "file": "ms_05_050_004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_050_004.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_050_004.opt.sol", "source_path": "01-marketsplit/instances/ms_05_050_004.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_050_004.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/ms_05_100_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_100_003", "instance": "ms_05_100_003", "paper_context": "MIP, 45 vars, density 0.911, optimal yes; QUBO, 200 vars, density 0.491, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.911111111", "feasible": "", "file": "ms_05_100_003.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.490547264", "feasible": "yes", "file": "ms_05_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_05_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/ms_05_100_006_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_100_006", "instance": "ms_05_100_006", "paper_context": "MIP, 45 vars, density 0.907, optimal yes; QUBO, 200 vars, density 0.489, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.906666667", "feasible": "", "file": "ms_05_100_006.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.488955224", "feasible": "yes", "file": "ms_05_100_006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_100_006.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_100_006.opt.sol", "source_path": "01-marketsplit/instances/ms_05_100_006.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_100_006.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/ms_05_100_013_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_100_013", "instance": "ms_05_100_013", "paper_context": "MIP, 45 vars, density 0.907, optimal yes; QUBO, 200 vars, density 0.489, optimal yes", "paper_metrics": [ { "coeff_range": "99", "density": "0.906666667", "feasible": "", "file": "ms_05_100_013.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.488955224", "feasible": "yes", "file": "ms_05_100_013.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_100_013.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_100_013.opt.sol", "source_path": "01-marketsplit/instances/ms_05_100_013.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_100_013.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:35:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/ms_05_100_015_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_100_015", "instance": "ms_05_100_015", "paper_context": "MIP, 45 vars, density 0.911, optimal yes; QUBO, 200 vars, density 0.491, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.911111111", "feasible": "", "file": "ms_05_100_015.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.490547264", "feasible": "yes", "file": "ms_05_100_015.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_100_015.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_100_015.opt.sol", "source_path": "01-marketsplit/instances/ms_05_100_015.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_100_015.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/ms_05_200_070_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_200_070", "instance": "ms_05_200_070", "paper_context": "MIP, 45 vars, density 0.911, optimal yes; QUBO, 200 vars, density 0.491, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.911111111", "feasible": "", "file": "ms_05_200_070.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.490547264", "feasible": "yes", "file": "ms_05_200_070.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_200_070.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_200_070.opt.sol", "source_path": "01-marketsplit/instances/ms_05_200_070.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_200_070.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/ms_05_200_095_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_200_095", "instance": "ms_05_200_095", "paper_context": "MIP, 45 vars, density 0.911, optimal yes; QUBO, 200 vars, density 0.491, optimal yes", "paper_metrics": [ { "coeff_range": "199", "density": "0.911111111", "feasible": "", "file": "ms_05_200_095.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.490547264", "feasible": "yes", "file": "ms_05_200_095.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_200_095.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_200_095.opt.sol", "source_path": "01-marketsplit/instances/ms_05_200_095.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_200_095.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/ms_05_200_180_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_200_180", "instance": "ms_05_200_180", "paper_context": "MIP, 45 vars, density 0.911, optimal yes; QUBO, 200 vars, density 0.491, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.911111111", "feasible": "", "file": "ms_05_200_180.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.490547264", "feasible": "yes", "file": "ms_05_200_180.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_200_180.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_200_180.opt.sol", "source_path": "01-marketsplit/instances/ms_05_200_180.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_200_180.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/ms_05_200_199_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_05_200_199", "instance": "ms_05_200_199", "paper_context": "MIP, 45 vars, density 0.907, optimal yes; QUBO, 200 vars, density 0.489, optimal yes", "paper_metrics": [ { "coeff_range": "197", "density": "0.906666667", "feasible": "", "file": "ms_05_200_199.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "45", "obj_value": "0", "optimal": "yes", "problem_size": "15" }, { "coeff_range": "4.61E+18", "density": "0.488955224", "feasible": "yes", "file": "ms_05_200_199.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_05_200_199.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_05_200_199.opt.sol", "source_path": "01-marketsplit/instances/ms_05_200_199.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_05_200_199.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/ms_06_050_001_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_050_001", "instance": "ms_06_050_001", "paper_context": "MIP, 56 vars, density 0.884, optimal yes; QUBO, 242 vars, density 0.468, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.883928571", "feasible": "", "file": "ms_06_050_001.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.467809407", "feasible": "yes", "file": "ms_06_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_06_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/ms_06_050_002_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_050_002", "instance": "ms_06_050_002", "paper_context": "MIP, 56 vars, density 0.899, optimal yes; QUBO, 242 vars, density 0.473, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.898809524", "feasible": "", "file": "ms_06_050_002.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.473251029", "feasible": "yes", "file": "ms_06_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_06_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/ms_06_050_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_050_003", "instance": "ms_06_050_003", "paper_context": "MIP, 56 vars, density 0.899, optimal yes; QUBO, 242 vars, density 0.473, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.898809524", "feasible": "", "file": "ms_06_050_003.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.473251029", "feasible": "yes", "file": "ms_06_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_06_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:36:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/ms_06_050_004_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_050_004", "instance": "ms_06_050_004", "paper_context": "MIP, 56 vars, density 0.89, optimal yes; QUBO, 242 vars, density 0.47, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.889880952", "feasible": "", "file": "ms_06_050_004.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.469986056", "feasible": "yes", "file": "ms_06_050_004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_050_004.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_050_004.opt.sol", "source_path": "01-marketsplit/instances/ms_06_050_004.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_050_004.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:37:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/ms_06_100_002_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_100_002", "instance": "ms_06_100_002", "paper_context": "MIP, 56 vars, density 0.902, optimal yes; QUBO, 242 vars, density 0.474, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.901785714", "feasible": "", "file": "ms_06_100_002.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.474339353", "feasible": "yes", "file": "ms_06_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_06_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:37:38", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/ms_06_100_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_100_003", "instance": "ms_06_100_003", "paper_context": "MIP, 56 vars, density 0.911, optimal yes; QUBO, 242 vars, density 0.478, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.910714286", "feasible": "", "file": "ms_06_100_003.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.477604326", "feasible": "yes", "file": "ms_06_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_06_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:38:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/ms_06_100_005_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_100_005", "instance": "ms_06_100_005", "paper_context": "MIP, 56 vars, density 0.893, optimal yes; QUBO, 242 vars, density 0.471, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.892857143", "feasible": "", "file": "ms_06_100_005.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.47107438", "feasible": "yes", "file": "ms_06_100_005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_100_005.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_100_005.opt.sol", "source_path": "01-marketsplit/instances/ms_06_100_005.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_100_005.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:39:08", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/ms_06_100_010_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_100_010", "instance": "ms_06_100_010", "paper_context": "MIP, 56 vars, density 0.905, optimal yes; QUBO, 242 vars, density 0.475, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.904761905", "feasible": "", "file": "ms_06_100_010.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.475427677", "feasible": "yes", "file": "ms_06_100_010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_100_010.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_100_010.opt.sol", "source_path": "01-marketsplit/instances/ms_06_100_010.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_100_010.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:41:39", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/ms_06_200_077_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_200_077", "instance": "ms_06_200_077", "paper_context": "MIP, 56 vars, density 0.902, optimal yes; QUBO, 242 vars, density 0.474, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.901785714", "feasible": "", "file": "ms_06_200_077.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.474339353", "feasible": "yes", "file": "ms_06_200_077.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_200_077.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_200_077.opt.sol", "source_path": "01-marketsplit/instances/ms_06_200_077.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_200_077.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:43:09", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/ms_06_200_104_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_200_104", "instance": "ms_06_200_104", "paper_context": "MIP, 56 vars, density 0.911, optimal yes; QUBO, 242 vars, density 0.478, optimal yes", "paper_metrics": [ { "coeff_range": "199", "density": "0.910714286", "feasible": "", "file": "ms_06_200_104.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.477604326", "feasible": "yes", "file": "ms_06_200_104.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_200_104.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_200_104.opt.sol", "source_path": "01-marketsplit/instances/ms_06_200_104.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_200_104.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:43:09", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/ms_06_200_240_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_200_240", "instance": "ms_06_200_240", "paper_context": "MIP, 56 vars, density 0.908, optimal yes; QUBO, 242 vars, density 0.477, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.907738095", "feasible": "", "file": "ms_06_200_240.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.476516002", "feasible": "yes", "file": "ms_06_200_240.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_200_240.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_200_240.opt.sol", "source_path": "01-marketsplit/instances/ms_06_200_240.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_200_240.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:44:09", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/ms_06_200_289_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_06_200_289", "instance": "ms_06_200_289", "paper_context": "MIP, 56 vars, density 0.908, optimal yes; QUBO, 242 vars, density 0.477, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.907738095", "feasible": "", "file": "ms_06_200_289.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "56", "obj_value": "0", "optimal": "yes", "problem_size": "18.33030278" }, { "coeff_range": "4.61E+18", "density": "0.476516002", "feasible": "yes", "file": "ms_06_200_289.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "242", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_06_200_289.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_06_200_289.opt.sol", "source_path": "01-marketsplit/instances/ms_06_200_289.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_06_200_289.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:45:39", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/ms_07_050_001_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_050_001", "instance": "ms_07_050_001", "paper_context": "MIP, 67 vars, density 0.881, optimal yes; QUBO, 284 vars, density 0.458, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.880597015", "feasible": "", "file": "ms_07_050_001.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.457573511", "feasible": "yes", "file": "ms_07_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_07_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:45:39", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/ms_07_050_002_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_050_002", "instance": "ms_07_050_002", "paper_context": "MIP, 67 vars, density 0.902, optimal yes; QUBO, 284 vars, density 0.465, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.901918977", "feasible": "", "file": "ms_07_050_002.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.465480603", "feasible": "yes", "file": "ms_07_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_07_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:46:09", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/ms_07_050_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_050_003", "instance": "ms_07_050_003", "paper_context": "MIP, 67 vars, density 0.9, optimal yes; QUBO, 284 vars, density 0.465, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.89978678", "feasible": "", "file": "ms_07_050_003.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.464689894", "feasible": "yes", "file": "ms_07_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_07_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:48:40", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/ms_07_050_004_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_050_004", "instance": "ms_07_050_004", "paper_context": "MIP, 67 vars, density 0.893, optimal yes; QUBO, 284 vars, density 0.462, optimal yes", "paper_metrics": [ { "coeff_range": "50", "density": "0.893390192", "feasible": "", "file": "ms_07_050_004.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.462317766", "feasible": "yes", "file": "ms_07_050_004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_050_004.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_050_004.opt.sol", "source_path": "01-marketsplit/instances/ms_07_050_004.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_050_004.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:59:41", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/ms_07_100_002_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_100_002", "instance": "ms_07_100_002", "paper_context": "MIP, 67 vars, density 0.904, optimal yes; QUBO, 284 vars, density 0.466, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.904051173", "feasible": "", "file": "ms_07_100_002.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.466271312", "feasible": "yes", "file": "ms_07_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_07_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 09:59:41", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/ms_07_100_003_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_100_003", "instance": "ms_07_100_003", "paper_context": "MIP, 67 vars, density 0.91, optimal yes; QUBO, 284 vars, density 0.469, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.910447761", "feasible": "", "file": "ms_07_100_003.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.46864344", "feasible": "yes", "file": "ms_07_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_07_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 10:03:11", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/ms_07_100_005_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_100_005", "instance": "ms_07_100_005", "paper_context": "MIP, 67 vars, density 0.891, optimal yes; QUBO, 284 vars, density 0.462, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.891257996", "feasible": "", "file": "ms_07_100_005.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.461527057", "feasible": "yes", "file": "ms_07_100_005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_100_005.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_100_005.opt.sol", "source_path": "01-marketsplit/instances/ms_07_100_005.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_100_005.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 10:09:41", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/ms_07_100_006_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_100_006", "instance": "ms_07_100_006", "paper_context": "MIP, 67 vars, density 0.902, optimal yes; QUBO, 284 vars, density 0.465, optimal yes", "paper_metrics": [ { "coeff_range": "100", "density": "0.901918977", "feasible": "", "file": "ms_07_100_006.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.465480603", "feasible": "yes", "file": "ms_07_100_006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_100_006.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_100_006.opt.sol", "source_path": "01-marketsplit/instances/ms_07_100_006.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_100_006.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 11:17:47", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/ms_07_200_248_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_200_248", "instance": "ms_07_200_248", "paper_context": "MIP, 67 vars, density 0.906, optimal yes; QUBO, 284 vars, density 0.467, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.906183369", "feasible": "", "file": "ms_07_200_248.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.467062021", "feasible": "yes", "file": "ms_07_200_248.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_200_248.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_200_248.opt.sol", "source_path": "01-marketsplit/instances/ms_07_200_248.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_200_248.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 11:24:47", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/ms_07_200_370_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_200_370", "instance": "ms_07_200_370", "paper_context": "MIP, 67 vars, density 0.904, optimal yes; QUBO, 284 vars, density 0.466, optimal yes", "paper_metrics": [ { "coeff_range": "199", "density": "0.904051173", "feasible": "", "file": "ms_07_200_370.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.466271312", "feasible": "yes", "file": "ms_07_200_370.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_200_370.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_200_370.opt.sol", "source_path": "01-marketsplit/instances/ms_07_200_370.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_200_370.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 11:35:18", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/ms_07_200_398_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_200_398", "instance": "ms_07_200_398", "paper_context": "MIP, 67 vars, density 0.908, optimal yes; QUBO, 284 vars, density 0.468, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.908315565", "feasible": "", "file": "ms_07_200_398.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.46785273", "feasible": "yes", "file": "ms_07_200_398.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_200_398.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_200_398.opt.sol", "source_path": "01-marketsplit/instances/ms_07_200_398.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_200_398.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "2024-12-23 12:02:21", "best_numeric": 0.0, "best_submission": "20241224_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/ms_07_200_500_summary.csv", "best_value": "0.0", "family": "", "format": ".dat", "id": "01-marketsplit:ms_07_200_500", "instance": "ms_07_200_500", "paper_context": "MIP, 67 vars, density 0.904, optimal yes; QUBO, 284 vars, density 0.466, optimal yes", "paper_metrics": [ { "coeff_range": "200", "density": "0.904051173", "feasible": "", "file": "ms_07_200_500.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "67", "obj_value": "0", "optimal": "yes", "problem_size": "21.65640783" }, { "coeff_range": "4.61E+18", "density": "0.466271312", "feasible": "yes", "file": "ms_07_200_500.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "284", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_07_200_500.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_07_200_500.opt.sol", "source_path": "01-marketsplit/instances/ms_07_200_500.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_07_200_500.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_050_000", "instance": "ms_08_050_000", "paper_context": "MIP, 78 vars, density 0.891, optimal yes; QUBO, 326 vars, density 0.455, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.891025641", "feasible": "", "file": "ms_08_050_000.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.454869515", "feasible": "yes", "file": "ms_08_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_050_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_050_000.opt.sol", "source_path": "01-marketsplit/instances/ms_08_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_050_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_050_001", "instance": "ms_08_050_001", "paper_context": "MIP, 78 vars, density 0.889, optimal yes; QUBO, 326 vars, density 0.454, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.889423077", "feasible": "", "file": "ms_08_050_001.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.454269151", "feasible": "yes", "file": "ms_08_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_08_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_050_002", "instance": "ms_08_050_002", "paper_context": "MIP, 78 vars, density 0.891, optimal yes; QUBO, 326 vars, density 0.455, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.891025641", "feasible": "", "file": "ms_08_050_002.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.454869515", "feasible": "yes", "file": "ms_08_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_08_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_050_003", "instance": "ms_08_050_003", "paper_context": "MIP, 78 vars, density 0.896, optimal yes; QUBO, 326 vars, density 0.457, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.895833333", "feasible": "", "file": "ms_08_050_003.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.456670607", "feasible": "yes", "file": "ms_08_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_08_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_100_000", "instance": "ms_08_100_000", "paper_context": "MIP, 78 vars, density 0.904, optimal yes; QUBO, 326 vars, density 0.46, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.903846154", "feasible": "", "file": "ms_08_100_000.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.459672426", "feasible": "yes", "file": "ms_08_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_100_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_100_000.opt.sol", "source_path": "01-marketsplit/instances/ms_08_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_100_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_100_001", "instance": "ms_08_100_001", "paper_context": "MIP, 78 vars, density 0.897, optimal yes; QUBO, 326 vars, density 0.457, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.897435897", "feasible": "", "file": "ms_08_100_001.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.457270971", "feasible": "yes", "file": "ms_08_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_100_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_100_001.opt.sol", "source_path": "01-marketsplit/instances/ms_08_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_100_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_100_002", "instance": "ms_08_100_002", "paper_context": "MIP, 78 vars, density 0.904, optimal yes; QUBO, 326 vars, density 0.46, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.903846154", "feasible": "", "file": "ms_08_100_002.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.459672426", "feasible": "yes", "file": "ms_08_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_08_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_100_003", "instance": "ms_08_100_003", "paper_context": "MIP, 78 vars, density 0.902, optimal yes; QUBO, 326 vars, density 0.459, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.90224359", "feasible": "", "file": "ms_08_100_003.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.459072062", "feasible": "yes", "file": "ms_08_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_08_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_200_000", "instance": "ms_08_200_000", "paper_context": "MIP, 78 vars, density 0.907, optimal yes; QUBO, 326 vars, density 0.461, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.907051282", "feasible": "", "file": "ms_08_200_000.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.460873154", "feasible": "yes", "file": "ms_08_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_200_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_200_000.opt.sol", "source_path": "01-marketsplit/instances/ms_08_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_200_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_200_001", "instance": "ms_08_200_001", "paper_context": "MIP, 78 vars, density 0.907, optimal yes; QUBO, 326 vars, density 0.461, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.907051282", "feasible": "", "file": "ms_08_200_001.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.460873154", "feasible": "yes", "file": "ms_08_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_200_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_200_001.opt.sol", "source_path": "01-marketsplit/instances/ms_08_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_200_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_200_002", "instance": "ms_08_200_002", "paper_context": "MIP, 78 vars, density 0.907, optimal yes; QUBO, 326 vars, density 0.461, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.907051282", "feasible": "", "file": "ms_08_200_002.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.460873154", "feasible": "yes", "file": "ms_08_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_200_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_200_002.opt.sol", "source_path": "01-marketsplit/instances/ms_08_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_200_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_08_200_003", "instance": "ms_08_200_003", "paper_context": "MIP, 78 vars, density 0.902, optimal yes; QUBO, 326 vars, density 0.459, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.90224359", "feasible": "", "file": "ms_08_200_003.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "78", "obj_value": "0", "optimal": "yes", "problem_size": "24.97999199" }, { "coeff_range": "4.61E+18", "density": "0.459072062", "feasible": "yes", "file": "ms_08_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "326", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_08_200_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_08_200_003.opt.sol", "source_path": "01-marketsplit/instances/ms_08_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_08_200_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_050_000", "instance": "ms_09_050_000", "paper_context": "MIP, 89 vars, density 0.891, optimal yes; QUBO, 368 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.891385768", "feasible": "", "file": "ms_09_050_000.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.449982326", "feasible": "yes", "file": "ms_09_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_050_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_050_000.opt.sol", "source_path": "01-marketsplit/instances/ms_09_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_050_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_050_001", "instance": "ms_09_050_001", "paper_context": "MIP, 89 vars, density 0.89, optimal yes; QUBO, 368 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.890137328", "feasible": "", "file": "ms_09_050_001.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.449511017", "feasible": "yes", "file": "ms_09_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_09_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_050_002", "instance": "ms_09_050_002", "paper_context": "MIP, 89 vars, density 0.89, optimal yes; QUBO, 368 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.890137328", "feasible": "", "file": "ms_09_050_002.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.449511017", "feasible": "yes", "file": "ms_09_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_09_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_050_003", "instance": "ms_09_050_003", "paper_context": "MIP, 89 vars, density 0.891, optimal yes; QUBO, 368 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.891385768", "feasible": "", "file": "ms_09_050_003.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.449982326", "feasible": "yes", "file": "ms_09_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_09_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_100_000", "instance": "ms_09_100_000", "paper_context": "MIP, 89 vars, density 0.903, optimal yes; QUBO, 368 vars, density 0.454, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.902621723", "feasible": "", "file": "ms_09_100_000.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.454224107", "feasible": "yes", "file": "ms_09_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_100_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_100_000.opt.sol", "source_path": "01-marketsplit/instances/ms_09_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_100_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_100_001", "instance": "ms_09_100_001", "paper_context": "MIP, 89 vars, density 0.898, optimal yes; QUBO, 368 vars, density 0.452, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.897627965", "feasible": "", "file": "ms_09_100_001.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.452338871", "feasible": "yes", "file": "ms_09_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_100_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_100_001.opt.sol", "source_path": "01-marketsplit/instances/ms_09_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_100_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_100_002", "instance": "ms_09_100_002", "paper_context": "MIP, 89 vars, density 0.904, optimal yes; QUBO, 368 vars, density 0.455, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.903870162", "feasible": "", "file": "ms_09_100_002.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.454695417", "feasible": "yes", "file": "ms_09_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_09_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_100_003", "instance": "ms_09_100_003", "paper_context": "MIP, 89 vars, density 0.898, optimal yes; QUBO, 368 vars, density 0.452, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.897627965", "feasible": "", "file": "ms_09_100_003.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.452338871", "feasible": "yes", "file": "ms_09_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_09_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_200_000", "instance": "ms_09_200_000", "paper_context": "MIP, 89 vars, density 0.908, optimal yes; QUBO, 368 vars, density 0.456, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.907615481", "feasible": "", "file": "ms_09_200_000.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.456109344", "feasible": "yes", "file": "ms_09_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_200_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_200_000.opt.sol", "source_path": "01-marketsplit/instances/ms_09_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_200_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_200_001", "instance": "ms_09_200_001", "paper_context": "MIP, 89 vars, density 0.908, optimal yes; QUBO, 368 vars, density 0.456, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.907615481", "feasible": "", "file": "ms_09_200_001.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.456109344", "feasible": "yes", "file": "ms_09_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_200_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_200_001.opt.sol", "source_path": "01-marketsplit/instances/ms_09_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_200_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_200_002", "instance": "ms_09_200_002", "paper_context": "MIP, 89 vars, density 0.908, optimal yes; QUBO, 368 vars, density 0.456, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.907615481", "feasible": "", "file": "ms_09_200_002.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.456109344", "feasible": "yes", "file": "ms_09_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_200_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_200_002.opt.sol", "source_path": "01-marketsplit/instances/ms_09_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_200_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_09_200_003", "instance": "ms_09_200_003", "paper_context": "MIP, 89 vars, density 0.901, optimal yes; QUBO, 368 vars, density 0.454, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.901373283", "feasible": "", "file": "ms_09_200_003.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "89", "obj_value": "0", "optimal": "yes", "problem_size": "28.3019434" }, { "coeff_range": "4.61E+18", "density": "0.453752798", "feasible": "yes", "file": "ms_09_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "368", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_09_200_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_09_200_003.opt.sol", "source_path": "01-marketsplit/instances/ms_09_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_09_200_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_050_000", "instance": "ms_10_050_000", "paper_context": "MIP, 100 vars, density 0.892, optimal yes; QUBO, 410 vars, density 0.446, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.892", "feasible": "", "file": "ms_10_050_000.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.446252448", "feasible": "yes", "file": "ms_10_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_050_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_050_000.opt.sol", "source_path": "01-marketsplit/instances/ms_10_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_050_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_050_001", "instance": "ms_10_050_001", "paper_context": "MIP, 100 vars, density 0.888, optimal yes; QUBO, 410 vars, density 0.445, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.888", "feasible": "", "file": "ms_10_050_001.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.44473325", "feasible": "yes", "file": "ms_10_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_10_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_050_002", "instance": "ms_10_050_002", "paper_context": "MIP, 100 vars, density 0.892, optimal yes; QUBO, 410 vars, density 0.446, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.892", "feasible": "", "file": "ms_10_050_002.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.446252448", "feasible": "yes", "file": "ms_10_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_10_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_050_003", "instance": "ms_10_050_003", "paper_context": "MIP, 100 vars, density 0.89, optimal yes; QUBO, 410 vars, density 0.445, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.89", "feasible": "", "file": "ms_10_050_003.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.445492849", "feasible": "yes", "file": "ms_10_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_10_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_100_000", "instance": "ms_10_100_000", "paper_context": "MIP, 100 vars, density 0.902, optimal yes; QUBO, 410 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.902", "feasible": "", "file": "ms_10_100_000.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.450050442", "feasible": "yes", "file": "ms_10_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_100_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_100_000.opt.sol", "source_path": "01-marketsplit/instances/ms_10_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_100_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_100_001", "instance": "ms_10_100_001", "paper_context": "MIP, 100 vars, density 0.896, optimal yes; QUBO, 410 vars, density 0.448, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.896", "feasible": "", "file": "ms_10_100_001.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.447771646", "feasible": "yes", "file": "ms_10_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_100_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_100_001.opt.sol", "source_path": "01-marketsplit/instances/ms_10_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_100_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_100_002", "instance": "ms_10_100_002", "paper_context": "MIP, 100 vars, density 0.903, optimal yes; QUBO, 410 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.903", "feasible": "", "file": "ms_10_100_002.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.450430242", "feasible": "yes", "file": "ms_10_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_10_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_100_003", "instance": "ms_10_100_003", "paper_context": "MIP, 100 vars, density 0.898, optimal yes; QUBO, 410 vars, density 0.449, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.898", "feasible": "", "file": "ms_10_100_003.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.448531244", "feasible": "yes", "file": "ms_10_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_10_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_200_000", "instance": "ms_10_200_000", "paper_context": "MIP, 100 vars, density 0.908, optimal yes; QUBO, 410 vars, density 0.452, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.908", "feasible": "", "file": "ms_10_200_000.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.452329239", "feasible": "yes", "file": "ms_10_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_200_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_200_000.opt.sol", "source_path": "01-marketsplit/instances/ms_10_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_200_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_200_001", "instance": "ms_10_200_001", "paper_context": "MIP, 100 vars, density 0.906, optimal yes; QUBO, 410 vars, density 0.452, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.906", "feasible": "", "file": "ms_10_200_001.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.45156964", "feasible": "yes", "file": "ms_10_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_200_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_200_001.opt.sol", "source_path": "01-marketsplit/instances/ms_10_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_200_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_200_002", "instance": "ms_10_200_002", "paper_context": "MIP, 100 vars, density 0.908, optimal yes; QUBO, 410 vars, density 0.452, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.908", "feasible": "", "file": "ms_10_200_002.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.452329239", "feasible": "yes", "file": "ms_10_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_200_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_200_002.opt.sol", "source_path": "01-marketsplit/instances/ms_10_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_200_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_10_200_003", "instance": "ms_10_200_003", "paper_context": "MIP, 100 vars, density 0.902, optimal yes; QUBO, 410 vars, density 0.45, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.902", "feasible": "", "file": "ms_10_200_003.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "100", "obj_value": "0", "optimal": "yes", "problem_size": "31.6227766" }, { "coeff_range": "4.61E+18", "density": "0.450050442", "feasible": "yes", "file": "ms_10_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "410", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_10_200_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_10_200_003.opt.sol", "source_path": "01-marketsplit/instances/ms_10_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_10_200_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_050_000", "instance": "ms_11_050_000", "paper_context": "MIP, 111 vars, density 0.894, optimal yes; QUBO, 452 vars, density 0.444, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.894348894", "feasible": "", "file": "ms_11_050_000.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.443943035", "feasible": "yes", "file": "ms_11_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_050_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_050_000.opt.sol", "source_path": "01-marketsplit/instances/ms_11_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_050_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_050_001", "instance": "ms_11_050_001", "paper_context": "MIP, 111 vars, density 0.89, optimal yes; QUBO, 452 vars, density 0.442, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.89025389", "feasible": "", "file": "ms_11_050_001.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.442380199", "feasible": "yes", "file": "ms_11_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_11_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_050_002", "instance": "ms_11_050_002", "paper_context": "MIP, 111 vars, density 0.895, optimal yes; QUBO, 452 vars, density 0.444, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.895167895", "feasible": "", "file": "ms_11_050_002.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.444255602", "feasible": "yes", "file": "ms_11_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_11_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_050_003", "instance": "ms_11_050_003", "paper_context": "MIP, 111 vars, density 0.888, optimal yes; QUBO, 452 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.887796888", "feasible": "", "file": "ms_11_050_003.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.441442497", "feasible": "yes", "file": "ms_11_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_11_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_100_000", "instance": "ms_11_100_000", "paper_context": "MIP, 111 vars, density 0.901, optimal yes; QUBO, 452 vars, density 0.446, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.900900901", "feasible": "", "file": "ms_11_100_000.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.446443572", "feasible": "yes", "file": "ms_11_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_100_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_100_000.opt.sol", "source_path": "01-marketsplit/instances/ms_11_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_100_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_100_001", "instance": "ms_11_100_001", "paper_context": "MIP, 111 vars, density 0.897, optimal yes; QUBO, 452 vars, density 0.445, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.896805897", "feasible": "", "file": "ms_11_100_001.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.444880736", "feasible": "yes", "file": "ms_11_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_100_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_100_001.opt.sol", "source_path": "01-marketsplit/instances/ms_11_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_100_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_100_002", "instance": "ms_11_100_002", "paper_context": "MIP, 111 vars, density 0.904, optimal yes; QUBO, 452 vars, density 0.448, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.904176904", "feasible": "", "file": "ms_11_100_002.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.44769384", "feasible": "yes", "file": "ms_11_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_11_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_100_003", "instance": "ms_11_100_003", "paper_context": "MIP, 111 vars, density 0.897, optimal yes; QUBO, 452 vars, density 0.445, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.896805897", "feasible": "", "file": "ms_11_100_003.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.444880736", "feasible": "yes", "file": "ms_11_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_100_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_100_003.opt.sol", "source_path": "01-marketsplit/instances/ms_11_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_100_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_200_000", "instance": "ms_11_200_000", "paper_context": "MIP, 111 vars, density 0.906, optimal yes; QUBO, 452 vars, density 0.448, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905814906", "feasible": "", "file": "ms_11_200_000.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.448318975", "feasible": "yes", "file": "ms_11_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_200_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_200_000.opt.sol", "source_path": "01-marketsplit/instances/ms_11_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_200_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_200_001", "instance": "ms_11_200_001", "paper_context": "MIP, 111 vars, density 0.906, optimal yes; QUBO, 452 vars, density 0.448, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905814906", "feasible": "", "file": "ms_11_200_001.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.448318975", "feasible": "yes", "file": "ms_11_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_200_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_200_001.opt.sol", "source_path": "01-marketsplit/instances/ms_11_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_200_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_200_002", "instance": "ms_11_200_002", "paper_context": "MIP, 111 vars, density 0.908, optimal yes; QUBO, 452 vars, density 0.449, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.908271908", "feasible": "", "file": "ms_11_200_002.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.449256676", "feasible": "yes", "file": "ms_11_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_200_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_200_002.opt.sol", "source_path": "01-marketsplit/instances/ms_11_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_200_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_11_200_003", "instance": "ms_11_200_003", "paper_context": "MIP, 111 vars, density 0.902, optimal yes; QUBO, 452 vars, density 0.447, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.901719902", "feasible": "", "file": "ms_11_200_003.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "111", "obj_value": "0", "optimal": "yes", "problem_size": "34.94281042" }, { "coeff_range": "4.61E+18", "density": "0.446756139", "feasible": "yes", "file": "ms_11_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "452", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_11_200_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_11_200_003.opt.sol", "source_path": "01-marketsplit/instances/ms_11_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_11_200_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_050_000", "instance": "ms_12_050_000", "paper_context": "MIP, 122 vars, density 0.893, optimal yes; QUBO, 494 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.892759563", "feasible": "", "file": "ms_12_050_000.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.440690304", "feasible": "yes", "file": "ms_12_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_050_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_050_000.opt.sol", "source_path": "01-marketsplit/instances/ms_12_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_050_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_050_001", "instance": "ms_12_050_001", "paper_context": "MIP, 122 vars, density 0.889, optimal yes; QUBO, 494 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.889344262", "feasible": "", "file": "ms_12_050_001.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.439381671", "feasible": "yes", "file": "ms_12_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_050_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_050_001.opt.sol", "source_path": "01-marketsplit/instances/ms_12_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_050_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_050_002", "instance": "ms_12_050_002", "paper_context": "MIP, 122 vars, density 0.893, optimal yes; QUBO, 494 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.893442623", "feasible": "", "file": "ms_12_050_002.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.44095203", "feasible": "yes", "file": "ms_12_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_050_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_050_002.opt.sol", "source_path": "01-marketsplit/instances/ms_12_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_050_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_050_003", "instance": "ms_12_050_003", "paper_context": "MIP, 122 vars, density 0.887, optimal yes; QUBO, 494 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.887295082", "feasible": "", "file": "ms_12_050_003.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.438596491", "feasible": "yes", "file": "ms_12_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_050_003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_050_003.opt.sol", "source_path": "01-marketsplit/instances/ms_12_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_050_003.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_100_000", "instance": "ms_12_100_000", "paper_context": "MIP, 122 vars, density 0.901, optimal yes; QUBO, 494 vars, density 0.444, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.900956284", "feasible": "", "file": "ms_12_100_000.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.443831023", "feasible": "yes", "file": "ms_12_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_100_000.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_100_000.opt.sol", "source_path": "01-marketsplit/instances/ms_12_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_100_000.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_100_001", "instance": "ms_12_100_001", "paper_context": "MIP, 122 vars, density 0.896, optimal yes; QUBO, 494 vars, density 0.442, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.896174863", "feasible": "", "file": "ms_12_100_001.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.441998937", "feasible": "yes", "file": "ms_12_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_100_001.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_100_001.opt.sol", "source_path": "01-marketsplit/instances/ms_12_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_100_001.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_100_002", "instance": "ms_12_100_002", "paper_context": "MIP, 122 vars, density 0.903, optimal yes; QUBO, 494 vars, density 0.445, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.903005464", "feasible": "", "file": "ms_12_100_002.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.444616203", "feasible": "yes", "file": "ms_12_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "01-marketsplit/solutions/ms_12_100_002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions/ms_12_100_002.opt.sol", "source_path": "01-marketsplit/instances/ms_12_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_100_002.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_100_003", "instance": "ms_12_100_003", "paper_context": "MIP, 122 vars, density 0.897, optimal yes; QUBO, 494 vars, density 0.442, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.896857923", "feasible": "", "file": "ms_12_100_003.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.442260663", "feasible": "yes", "file": "ms_12_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_12_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_100_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_200_000", "instance": "ms_12_200_000", "paper_context": "MIP, 122 vars, density 0.906, optimal yes; QUBO, 494 vars, density 0.446, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.906420765", "feasible": "", "file": "ms_12_200_000.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.445924835", "feasible": "yes", "file": "ms_12_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_12_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_200_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_200_001", "instance": "ms_12_200_001", "paper_context": "MIP, 122 vars, density 0.905, optimal yes; QUBO, 494 vars, density 0.445, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905054645", "feasible": "", "file": "ms_12_200_001.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.445401382", "feasible": "yes", "file": "ms_12_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_12_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_200_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_200_002", "instance": "ms_12_200_002", "paper_context": "MIP, 122 vars, density 0.906, optimal yes; QUBO, 494 vars, density 0.446, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.906420765", "feasible": "", "file": "ms_12_200_002.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.445924835", "feasible": "yes", "file": "ms_12_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_12_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_200_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_12_200_003", "instance": "ms_12_200_003", "paper_context": "MIP, 122 vars, density 0.902, optimal yes; QUBO, 494 vars, density 0.444, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.901639344", "feasible": "", "file": "ms_12_200_003.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "122", "obj_value": "0", "optimal": "yes", "problem_size": "38.26225294" }, { "coeff_range": "4.61E+18", "density": "0.444092749", "feasible": "yes", "file": "ms_12_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "494", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_12_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_12_200_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_050_000", "instance": "ms_13_050_000", "paper_context": "MIP, 133 vars, density 0.893, optimal yes; QUBO, 536 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.893001735", "feasible": "", "file": "ms_13_050_000.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.438561383", "feasible": "yes", "file": "ms_13_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_050_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_050_001", "instance": "ms_13_050_001", "paper_context": "MIP, 133 vars, density 0.89, optimal yes; QUBO, 536 vars, density 0.437, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.89010989", "feasible": "", "file": "ms_13_050_001.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.437449623", "feasible": "yes", "file": "ms_13_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_050_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_050_002", "instance": "ms_13_050_002", "paper_context": "MIP, 133 vars, density 0.891, optimal yes; QUBO, 536 vars, density 0.438, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.891266628", "feasible": "", "file": "ms_13_050_002.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.437894327", "feasible": "yes", "file": "ms_13_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_050_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_050_003", "instance": "ms_13_050_003", "paper_context": "MIP, 133 vars, density 0.889, optimal yes; QUBO, 536 vars, density 0.437, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.888953152", "feasible": "", "file": "ms_13_050_003.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.43700492", "feasible": "yes", "file": "ms_13_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_050_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_100_000", "instance": "ms_13_100_000", "paper_context": "MIP, 133 vars, density 0.901, optimal yes; QUBO, 536 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.900520532", "feasible": "", "file": "ms_13_100_000.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.441451958", "feasible": "yes", "file": "ms_13_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_100_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_100_001", "instance": "ms_13_100_001", "paper_context": "MIP, 133 vars, density 0.898, optimal yes; QUBO, 536 vars, density 0.44, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.897628687", "feasible": "", "file": "ms_13_100_001.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.440340198", "feasible": "yes", "file": "ms_13_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_100_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_100_002", "instance": "ms_13_100_002", "paper_context": "MIP, 133 vars, density 0.902, optimal yes; QUBO, 536 vars, density 0.442, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.902255639", "feasible": "", "file": "ms_13_100_002.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.442119014", "feasible": "yes", "file": "ms_13_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_100_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_100_003", "instance": "ms_13_100_003", "paper_context": "MIP, 133 vars, density 0.898, optimal yes; QUBO, 536 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.898207056", "feasible": "", "file": "ms_13_100_003.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.44056255", "feasible": "yes", "file": "ms_13_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_100_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_200_000", "instance": "ms_13_200_000", "paper_context": "MIP, 133 vars, density 0.906, optimal yes; QUBO, 536 vars, density 0.443, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905725853", "feasible": "", "file": "ms_13_200_000.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.443453125", "feasible": "yes", "file": "ms_13_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_200_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_200_001", "instance": "ms_13_200_001", "paper_context": "MIP, 133 vars, density 0.906, optimal yes; QUBO, 536 vars, density 0.443, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905725853", "feasible": "", "file": "ms_13_200_001.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.443453125", "feasible": "yes", "file": "ms_13_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_200_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_200_002", "instance": "ms_13_200_002", "paper_context": "MIP, 133 vars, density 0.906, optimal yes; QUBO, 536 vars, density 0.443, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905725853", "feasible": "", "file": "ms_13_200_002.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.443453125", "feasible": "yes", "file": "ms_13_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_200_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_13_200_003", "instance": "ms_13_200_003", "paper_context": "MIP, 133 vars, density 0.902, optimal yes; QUBO, 536 vars, density 0.442, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.902255639", "feasible": "", "file": "ms_13_200_003.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "133", "obj_value": "0", "optimal": "yes", "problem_size": "41.58124577" }, { "coeff_range": "4.61E+18", "density": "0.442119014", "feasible": "yes", "file": "ms_13_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "536", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_13_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_13_200_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_050_000", "instance": "ms_14_050_000", "paper_context": "MIP, 144 vars, density 0.892, optimal yes; QUBO, 578 vars, density 0.436, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.892361111", "feasible": "", "file": "ms_14_050_000.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.43642242", "feasible": "yes", "file": "ms_14_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_050_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_050_001", "instance": "ms_14_050_001", "paper_context": "MIP, 144 vars, density 0.89, optimal yes; QUBO, 578 vars, density 0.435, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.889880952", "feasible": "", "file": "ms_14_050_001.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.435466232", "feasible": "yes", "file": "ms_14_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_050_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_050_002", "instance": "ms_14_050_002", "paper_context": "MIP, 144 vars, density 0.89, optimal yes; QUBO, 578 vars, density 0.435, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.889880952", "feasible": "", "file": "ms_14_050_002.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.435466232", "feasible": "yes", "file": "ms_14_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_050_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_050_003", "instance": "ms_14_050_003", "paper_context": "MIP, 144 vars, density 0.89, optimal yes; QUBO, 578 vars, density 0.436, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.890376984", "feasible": "", "file": "ms_14_050_003.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.435657469", "feasible": "yes", "file": "ms_14_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_050_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_100_000", "instance": "ms_14_100_000", "paper_context": "MIP, 144 vars, density 0.9, optimal yes; QUBO, 578 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.900297619", "feasible": "", "file": "ms_14_100_000.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.439482224", "feasible": "yes", "file": "ms_14_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_100_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_100_001", "instance": "ms_14_100_001", "paper_context": "MIP, 144 vars, density 0.899, optimal yes; QUBO, 578 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.898809524", "feasible": "", "file": "ms_14_100_001.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.438908511", "feasible": "yes", "file": "ms_14_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_100_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_100_002", "instance": "ms_14_100_002", "paper_context": "MIP, 144 vars, density 0.901, optimal yes; QUBO, 578 vars, density 0.44, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.900793651", "feasible": "", "file": "ms_14_100_002.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.439673462", "feasible": "yes", "file": "ms_14_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_100_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_100_003", "instance": "ms_14_100_003", "paper_context": "MIP, 144 vars, density 0.899, optimal yes; QUBO, 578 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.898809524", "feasible": "", "file": "ms_14_100_003.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.438908511", "feasible": "yes", "file": "ms_14_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_100_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_200_000", "instance": "ms_14_200_000", "paper_context": "MIP, 144 vars, density 0.905, optimal yes; QUBO, 578 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.904761905", "feasible": "", "file": "ms_14_200_000.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.441203363", "feasible": "yes", "file": "ms_14_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_200_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_200_001", "instance": "ms_14_200_001", "paper_context": "MIP, 144 vars, density 0.906, optimal yes; QUBO, 578 vars, density 0.442, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905753968", "feasible": "", "file": "ms_14_200_001.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.441585839", "feasible": "yes", "file": "ms_14_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_200_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_200_002", "instance": "ms_14_200_002", "paper_context": "MIP, 144 vars, density 0.904, optimal yes; QUBO, 578 vars, density 0.441, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.904265873", "feasible": "", "file": "ms_14_200_002.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.441012126", "feasible": "yes", "file": "ms_14_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_200_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_14_200_003", "instance": "ms_14_200_003", "paper_context": "MIP, 144 vars, density 0.903, optimal yes; QUBO, 578 vars, density 0.44, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.902777778", "feasible": "", "file": "ms_14_200_003.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "144", "obj_value": "0", "optimal": "yes", "problem_size": "44.89988864" }, { "coeff_range": "4.61E+18", "density": "0.440438412", "feasible": "yes", "file": "ms_14_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "578", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_14_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_14_200_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_050_000", "instance": "ms_15_050_000", "paper_context": "MIP, 155 vars, density 0.893, optimal yes; QUBO, 620 vars, density 0.435, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.892903226", "feasible": "", "file": "ms_15_050_000.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.435000779", "feasible": "yes", "file": "ms_15_050_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_050_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_050_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_050_001", "instance": "ms_15_050_001", "paper_context": "MIP, 155 vars, density 0.891, optimal yes; QUBO, 620 vars, density 0.434, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.891182796", "feasible": "", "file": "ms_15_050_001.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.434335879", "feasible": "yes", "file": "ms_15_050_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_050_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_050_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_050_002", "instance": "ms_15_050_002", "paper_context": "MIP, 155 vars, density 0.889, optimal yes; QUBO, 620 vars, density 0.434, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.889462366", "feasible": "", "file": "ms_15_050_002.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.433670978", "feasible": "yes", "file": "ms_15_050_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_050_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_050_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_050_003", "instance": "ms_15_050_003", "paper_context": "MIP, 155 vars, density 0.889, optimal yes; QUBO, 620 vars, density 0.434, optimal yes", "paper_metrics": [ { "coeff_range": "48", "density": "0.889462366", "feasible": "", "file": "ms_15_050_003.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.433670978", "feasible": "yes", "file": "ms_15_050_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_050_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_050_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_100_000", "instance": "ms_15_100_000", "paper_context": "MIP, 155 vars, density 0.901, optimal yes; QUBO, 620 vars, density 0.438, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.901075269", "feasible": "", "file": "ms_15_100_000.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.438159057", "feasible": "yes", "file": "ms_15_100_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_100_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_100_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_100_001", "instance": "ms_15_100_001", "paper_context": "MIP, 155 vars, density 0.9, optimal yes; QUBO, 620 vars, density 0.438, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.899784946", "feasible": "", "file": "ms_15_100_001.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.437660381", "feasible": "yes", "file": "ms_15_100_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_100_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_100_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_100_002", "instance": "ms_15_100_002", "paper_context": "MIP, 155 vars, density 0.899, optimal yes; QUBO, 620 vars, density 0.437, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.899354839", "feasible": "", "file": "ms_15_100_002.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.437494156", "feasible": "yes", "file": "ms_15_100_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_100_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_100_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_100_003", "instance": "ms_15_100_003", "paper_context": "MIP, 155 vars, density 0.898, optimal yes; QUBO, 620 vars, density 0.437, optimal yes", "paper_metrics": [ { "coeff_range": "98", "density": "0.897634409", "feasible": "", "file": "ms_15_100_003.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.436829256", "feasible": "yes", "file": "ms_15_100_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_100_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_100_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_200_000", "instance": "ms_15_200_000", "paper_context": "MIP, 155 vars, density 0.905, optimal yes; QUBO, 620 vars, density 0.44, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.904946237", "feasible": "", "file": "ms_15_200_000.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.439655083", "feasible": "yes", "file": "ms_15_200_000.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_200_000.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_200_000.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_200_001", "instance": "ms_15_200_001", "paper_context": "MIP, 155 vars, density 0.906, optimal yes; QUBO, 620 vars, density 0.44, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.905806452", "feasible": "", "file": "ms_15_200_001.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.439987533", "feasible": "yes", "file": "ms_15_200_001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_200_001.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_200_001.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_200_002", "instance": "ms_15_200_002", "paper_context": "MIP, 155 vars, density 0.903, optimal yes; QUBO, 620 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.902795699", "feasible": "", "file": "ms_15_200_002.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.438823957", "feasible": "yes", "file": "ms_15_200_002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_200_002.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_200_002.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "01-marketsplit:ms_15_200_003", "instance": "ms_15_200_003", "paper_context": "MIP, 155 vars, density 0.903, optimal yes; QUBO, 620 vars, density 0.439, optimal yes", "paper_metrics": [ { "coeff_range": "198", "density": "0.902795699", "feasible": "", "file": "ms_15_200_003.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "155", "obj_value": "0", "optimal": "yes", "problem_size": "48.2182538" }, { "coeff_range": "4.61E+18", "density": "0.438823957", "feasible": "yes", "file": "ms_15_200_003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "620", "obj_value": "0", "optimal": "yes", "problem_size": "" } ], "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "problem_why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "01-marketsplit/instances/ms_15_200_003.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances/ms_15_200_003.dat", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints." }, { "best_date": "Nov. 17, 2025", "best_numeric": 13.0, "best_submission": "20260209_QAOA_AQT", "best_submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010/labs010_summary.csv", "best_value": "13", "family": "", "format": "", "id": "02-labs:LABS (N = 10)", "instance": "LABS (N = 10)", "paper_context": "", "paper_metrics": [], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "Nov. 17, 2025", "best_numeric": 10.0, "best_submission": "20260209_QAOA_AQT", "best_submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012/labs012_summary.csv", "best_value": "10", "family": "", "format": "", "id": "02-labs:LABS (N = 12)", "instance": "LABS (N = 12)", "paper_context": "", "paper_metrics": [], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "Nov. 17, 2025", "best_numeric": 7.0, "best_submission": "20260209_QAOA_AQT", "best_submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006/labs006_summary.csv", "best_value": "7", "family": "", "format": "", "id": "02-labs:LABS (N = 6)", "instance": "LABS (N = 6)", "paper_context": "", "paper_metrics": [], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "Nov. 17, 2025", "best_numeric": 8.0, "best_submission": "20260209_QAOA_AQT", "best_submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008/labs008_summary.csv", "best_value": "8", "family": "", "format": "", "id": "02-labs:LABS (N = 8)", "instance": "LABS (N = 8)", "paper_context": "", "paper_metrics": [], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 1.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs002/labs002_summary.csv", "best_value": "1", "family": "", "format": "", "id": "02-labs:labs002", "instance": "labs002", "paper_context": "MIP, 4 vars, density 0.214, optimal yes; QUBO, 3 vars, density 0.667, optimal yes", "paper_metrics": [ { "coeff_range": "6", "density": "0.214285714", "feasible": "", "file": "labs002.lp", "formulation": "MIP", "num_constraints": "2", "num_vars": "4", "obj_value": "198", "optimal": "yes", "problem_size": "2.828427125" }, { "coeff_range": "40032", "density": "0.666666667", "feasible": "yes", "file": "labs002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3", "obj_value": "198", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs002.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs002.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "8. Mar. 2026", "best_numeric": 1.0, "best_submission": "20260308_Arvak_Hinderink", "best_submitter": "Daniel Hinderink (hiq-lab)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260308_Arvak_Hinderink/labs003/labs003_summary.csv", "best_value": "1", "family": "", "format": "", "id": "02-labs:labs003", "instance": "labs003", "paper_context": "MIP, 6 vars, density 0.16, optimal yes; QUBO, 6 vars, density 0.81, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.160493827", "feasible": "", "file": "labs003.lp", "formulation": "MIP", "num_constraints": "3", "num_vars": "6", "obj_value": "1", "optimal": "yes", "problem_size": "4.242640687" }, { "coeff_range": "40048", "density": "0.80952381", "feasible": "yes", "file": "labs003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "6", "obj_value": "1", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs003.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs003.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 2.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs004/labs004_summary.csv", "best_value": "2", "family": "", "format": "", "id": "02-labs:labs004", "instance": "labs004", "paper_context": "MIP, 8 vars, density 0.131, optimal yes; QUBO, 10 vars, density 0.764, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.130681818", "feasible": "", "file": "labs004.lp", "formulation": "MIP", "num_constraints": "4", "num_vars": "8", "obj_value": "2", "optimal": "yes", "problem_size": "5.656854249" }, { "coeff_range": "40056", "density": "0.763636364", "feasible": "yes", "file": "labs004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "10", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs004.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs004.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 2.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs005/labs005_summary.csv", "best_value": "2", "family": "", "format": "", "id": "02-labs:labs005", "instance": "labs005", "paper_context": "MIP, 10 vars, density 0.108, optimal yes; QUBO, 15 vars, density 0.667, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.107692308", "feasible": "", "file": "labs005.lp", "formulation": "MIP", "num_constraints": "5", "num_vars": "10", "obj_value": "2", "optimal": "yes", "problem_size": "7.071067812" }, { "coeff_range": "40064", "density": "0.666666667", "feasible": "yes", "file": "labs005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs005.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs005.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 7.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs006/labs006_summary.csv", "best_value": "7", "family": "", "format": "", "id": "02-labs:labs006", "instance": "labs006", "paper_context": "MIP, 12 vars, density 0.0926, optimal yes; QUBO, 21 vars, density 0.597, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.092592593", "feasible": "", "file": "labs006.lp", "formulation": "MIP", "num_constraints": "6", "num_vars": "12", "obj_value": "7", "optimal": "yes", "problem_size": "8.485281374" }, { "coeff_range": "40072", "density": "0.597402597", "feasible": "yes", "file": "labs006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "21", "obj_value": "7", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs006.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs006.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 3.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs007/labs007_summary.csv", "best_value": "3", "family": "", "format": "", "id": "02-labs:labs007", "instance": "labs007", "paper_context": "MIP, 14 vars, density 0.0804, optimal yes; QUBO, 28 vars, density 0.534, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.080432173", "feasible": "", "file": "labs007.lp", "formulation": "MIP", "num_constraints": "7", "num_vars": "14", "obj_value": "3", "optimal": "yes", "problem_size": "9.899494937" }, { "coeff_range": "40080", "density": "0.534482759", "feasible": "yes", "file": "labs007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "28", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs007.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs007.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 8.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs008/labs008_summary.csv", "best_value": "8", "family": "", "format": "", "id": "02-labs:labs008", "instance": "labs008", "paper_context": "MIP, 16 vars, density 0.0715, optimal yes; QUBO, 36 vars, density 0.486, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.071546053", "feasible": "", "file": "labs008.lp", "formulation": "MIP", "num_constraints": "8", "num_vars": "16", "obj_value": "8", "optimal": "yes", "problem_size": "11.3137085" }, { "coeff_range": "40088", "density": "0.486486486", "feasible": "yes", "file": "labs008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "36", "obj_value": "8", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs008.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs008.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 12.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs009/labs009_summary.csv", "best_value": "12", "family": "", "format": "", "id": "02-labs:labs009", "instance": "labs009", "paper_context": "MIP, 18 vars, density 0.0641, optimal yes; QUBO, 45 vars, density 0.443, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.064079953", "feasible": "", "file": "labs009.lp", "formulation": "MIP", "num_constraints": "9", "num_vars": "18", "obj_value": "12", "optimal": "yes", "problem_size": "12.72792206" }, { "coeff_range": "40096", "density": "0.443478261", "feasible": "yes", "file": "labs009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "45", "obj_value": "12", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs009.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs009.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 13.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs010/labs010_summary.csv", "best_value": "13", "family": "", "format": "", "id": "02-labs:labs010", "instance": "labs010", "paper_context": "MIP, 20 vars, density 0.0583, optimal yes; QUBO, 55 vars, density 0.409, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.05826087", "feasible": "", "file": "labs010.lp", "formulation": "MIP", "num_constraints": "10", "num_vars": "20", "obj_value": "13", "optimal": "yes", "problem_size": "14.14213562" }, { "coeff_range": "40104", "density": "0.409090909", "feasible": "yes", "file": "labs010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "55", "obj_value": "13", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs010.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs010.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 5.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs011/labs011_summary.csv", "best_value": "5", "family": "", "format": "", "id": "02-labs:labs011", "instance": "labs011", "paper_context": "MIP, 22 vars, density 0.0532, optimal yes; QUBO, 66 vars, density 0.378, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.05322314", "feasible": "", "file": "labs011.lp", "formulation": "MIP", "num_constraints": "11", "num_vars": "22", "obj_value": "5", "optimal": "yes", "problem_size": "15.55634919" }, { "coeff_range": "40112", "density": "0.378109453", "feasible": "yes", "file": "labs011.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "66", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs011.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs011.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 10.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs012/labs012_summary.csv", "best_value": "10", "family": "", "format": "", "id": "02-labs:labs012", "instance": "labs012", "paper_context": "MIP, 24 vars, density 0.0491, optimal yes; QUBO, 78 vars, density 0.352, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.049125514", "feasible": "", "file": "labs012.lp", "formulation": "MIP", "num_constraints": "12", "num_vars": "24", "obj_value": "10", "optimal": "yes", "problem_size": "16.97056275" }, { "coeff_range": "40120", "density": "0.35248296", "feasible": "yes", "file": "labs012.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "78", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs012.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs012.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 6.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs013/labs013_summary.csv", "best_value": "6", "family": "", "format": "", "id": "02-labs:labs013", "instance": "labs013", "paper_context": "MIP, 26 vars, density 0.0455, optimal yes; QUBO, 91 vars, density 0.329, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.045500918", "feasible": "", "file": "labs013.lp", "formulation": "MIP", "num_constraints": "13", "num_vars": "26", "obj_value": "6", "optimal": "yes", "problem_size": "18.38477631" }, { "coeff_range": "40128", "density": "0.329192547", "feasible": "yes", "file": "labs013.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "91", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs013.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs013.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 19.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs014/labs014_summary.csv", "best_value": "19", "family": "", "format": "", "id": "02-labs:labs014", "instance": "labs014", "paper_context": "MIP, 28 vars, density 0.0425, optimal yes; QUBO, 105 vars, density 0.309, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.042462146", "feasible": "", "file": "labs014.lp", "formulation": "MIP", "num_constraints": "14", "num_vars": "28", "obj_value": "19", "optimal": "yes", "problem_size": "19.79898987" }, { "coeff_range": "40136", "density": "0.309433962", "feasible": "yes", "file": "labs014.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "105", "obj_value": "19", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs014.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs014.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 15.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs015/labs015_summary.csv", "best_value": "15", "family": "", "format": "", "id": "02-labs:labs015", "instance": "labs015", "paper_context": "MIP, 30 vars, density 0.0397, optimal yes; QUBO, 120 vars, density 0.291, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.03973064", "feasible": "", "file": "labs015.lp", "formulation": "MIP", "num_constraints": "15", "num_vars": "30", "obj_value": "15", "optimal": "yes", "problem_size": "21.21320344" }, { "coeff_range": "40144", "density": "0.291322314", "feasible": "yes", "file": "labs015.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "120", "obj_value": "15", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs015.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs015.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 24.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs016/labs016_summary.csv", "best_value": "24", "family": "", "format": "", "id": "02-labs:labs016", "instance": "labs016", "paper_context": "MIP, 32 vars, density 0.0374, optimal yes; QUBO, 136 vars, density 0.276, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.037388393", "feasible": "", "file": "labs016.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "32", "obj_value": "24", "optimal": "yes", "problem_size": "22.627417" }, { "coeff_range": "40152", "density": "0.275654787", "feasible": "yes", "file": "labs016.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "136", "obj_value": "24", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs016.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs016.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 32.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs017/labs017_summary.csv", "best_value": "32", "family": "", "format": "", "id": "02-labs:labs017", "instance": "labs017", "paper_context": "MIP, 34 vars, density 0.0353, optimal yes; QUBO, 153 vars, density 0.261, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.03525671", "feasible": "", "file": "labs017.lp", "formulation": "MIP", "num_constraints": "17", "num_vars": "34", "obj_value": "32", "optimal": "yes", "problem_size": "24.04163056" }, { "coeff_range": "40160", "density": "0.261183261", "feasible": "yes", "file": "labs017.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "153", "obj_value": "32", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs017.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs017.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 25.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs018/labs018_summary.csv", "best_value": "25", "family": "", "format": "", "id": "02-labs:labs018", "instance": "labs018", "paper_context": "MIP, 36 vars, density 0.0334, optimal yes; QUBO, 171 vars, density 0.248, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.033396645", "feasible": "", "file": "labs018.lp", "formulation": "MIP", "num_constraints": "18", "num_vars": "36", "obj_value": "25", "optimal": "yes", "problem_size": "25.45584412" }, { "coeff_range": "40168", "density": "0.248470012", "feasible": "yes", "file": "labs018.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "171", "obj_value": "25", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs018.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs018.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 29.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs019/labs019_summary.csv", "best_value": "29", "family": "", "format": "", "id": "02-labs:labs019", "instance": "labs019", "paper_context": "MIP, 38 vars, density 0.0317, optimal yes; QUBO, 190 vars, density 0.237, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.031687048", "feasible": "", "file": "labs019.lp", "formulation": "MIP", "num_constraints": "19", "num_vars": "38", "obj_value": "29", "optimal": "yes", "problem_size": "26.87005769" }, { "coeff_range": "40176", "density": "0.236649215", "feasible": "yes", "file": "labs019.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "190", "obj_value": "29", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs019.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs019.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 26.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs020/labs020_summary.csv", "best_value": "26", "family": "", "format": "", "id": "02-labs:labs020", "instance": "labs020", "paper_context": "MIP, 40 vars, density 0.0302, optimal yes; QUBO, 210 vars, density 0.226, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.030174419", "feasible": "", "file": "labs020.lp", "formulation": "MIP", "num_constraints": "20", "num_vars": "40", "obj_value": "26", "optimal": "yes", "problem_size": "28.28427125" }, { "coeff_range": "40184", "density": "0.226134056", "feasible": "yes", "file": "labs020.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "210", "obj_value": "26", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs020.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs020.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 26.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs021/labs021_summary.csv", "best_value": "26", "family": "", "format": "", "id": "02-labs:labs021", "instance": "labs021", "paper_context": "MIP, 42 vars, density 0.0288, optimal yes; QUBO, 231 vars, density 0.216, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.028772991", "feasible": "", "file": "labs021.lp", "formulation": "MIP", "num_constraints": "21", "num_vars": "42", "obj_value": "26", "optimal": "yes", "problem_size": "29.69848481" }, { "coeff_range": "40192", "density": "0.21630094", "feasible": "yes", "file": "labs021.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "231", "obj_value": "26", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs021.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs021.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 39.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs022/labs022_summary.csv", "best_value": "39", "family": "", "format": "", "id": "02-labs:labs022", "instance": "labs022", "paper_context": "MIP, 44 vars, density 0.0275, optimal yes; QUBO, 253 vars, density 0.207, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.027518903", "feasible": "", "file": "labs022.lp", "formulation": "MIP", "num_constraints": "22", "num_vars": "44", "obj_value": "39", "optimal": "yes", "problem_size": "31.11269837" }, { "coeff_range": "40200", "density": "0.207463198", "feasible": "yes", "file": "labs022.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "253", "obj_value": "39", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs022.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs022.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 47.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs023/labs023_summary.csv", "best_value": "47", "family": "", "format": "", "id": "02-labs:labs023", "instance": "labs023", "paper_context": "MIP, 46 vars, density 0.0263, optimal yes; QUBO, 276 vars, density 0.199, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.026349292", "feasible": "", "file": "labs023.lp", "formulation": "MIP", "num_constraints": "23", "num_vars": "46", "obj_value": "47", "optimal": "yes", "problem_size": "32.52691193" }, { "coeff_range": "40208", "density": "0.199157641", "feasible": "yes", "file": "labs023.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "276", "obj_value": "47", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs023.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs023.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 36.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs024/labs024_summary.csv", "best_value": "36", "family": "", "format": "", "id": "02-labs:labs024", "instance": "labs024", "paper_context": "MIP, 48 vars, density 0.0253, optimal yes; QUBO, 300 vars, density 0.192, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.025292756", "feasible": "", "file": "labs024.lp", "formulation": "MIP", "num_constraints": "24", "num_vars": "48", "obj_value": "36", "optimal": "yes", "problem_size": "33.9411255" }, { "coeff_range": "40216", "density": "0.191627907", "feasible": "yes", "file": "labs024.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "300", "obj_value": "36", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs024.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs024.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 36.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs025/labs025_summary.csv", "best_value": "36", "family": "", "format": "", "id": "02-labs:labs025", "instance": "labs025", "paper_context": "MIP, 50 vars, density 0.0243, optimal yes; QUBO, 325 vars, density 0.185, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.024301887", "feasible": "", "file": "labs025.lp", "formulation": "MIP", "num_constraints": "25", "num_vars": "50", "obj_value": "36", "optimal": "yes", "problem_size": "35.35533906" }, { "coeff_range": "40224", "density": "0.184521", "feasible": "yes", "file": "labs025.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "325", "obj_value": "36", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs025.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs025.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 45.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs026/labs026_summary.csv", "best_value": "45", "family": "", "format": "", "id": "02-labs:labs026", "instance": "labs026", "paper_context": "MIP, 52 vars, density 0.0234, optimal yes; QUBO, 351 vars, density 0.178, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.023399677", "feasible": "", "file": "labs026.lp", "formulation": "MIP", "num_constraints": "26", "num_vars": "52", "obj_value": "45", "optimal": "yes", "problem_size": "36.76955262" }, { "coeff_range": "40232", "density": "0.178030303", "feasible": "yes", "file": "labs026.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "351", "obj_value": "45", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs026.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs026.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:57:53", "best_numeric": 37.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs027/labs027_summary.csv", "best_value": "37.0", "family": "", "format": "", "id": "02-labs:labs027", "instance": "labs027", "paper_context": "MIP, 54 vars, density 0.0225, optimal yes; QUBO, 378 vars, density 0.172, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.022549515", "feasible": "", "file": "labs027.lp", "formulation": "MIP", "num_constraints": "27", "num_vars": "54", "obj_value": "37", "optimal": "yes", "problem_size": "38.18376618" }, { "coeff_range": "40240", "density": "0.17188089", "feasible": "yes", "file": "labs027.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "378", "obj_value": "37", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs027.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs027.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:58:11", "best_numeric": 50.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs028/labs028_summary.csv", "best_value": "50.0", "family": "", "format": "", "id": "02-labs:labs028", "instance": "labs028", "paper_context": "MIP, 56 vars, density 0.0218, optimal yes; QUBO, 406 vars, density 0.166, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.021770149", "feasible": "", "file": "labs028.lp", "formulation": "MIP", "num_constraints": "28", "num_vars": "56", "obj_value": "50", "optimal": "yes", "problem_size": "39.59797975" }, { "coeff_range": "40248", "density": "0.166228925", "feasible": "yes", "file": "labs028.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "406", "obj_value": "50", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs028.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs028.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:58:41", "best_numeric": 62.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs029/labs029_summary.csv", "best_value": "62.0", "family": "", "format": "", "id": "02-labs:labs029", "instance": "labs029", "paper_context": "MIP, 58 vars, density 0.021, optimal yes; QUBO, 435 vars, density 0.161, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.021032728", "feasible": "", "file": "labs029.lp", "formulation": "MIP", "num_constraints": "29", "num_vars": "58", "obj_value": "62", "optimal": "yes", "problem_size": "41.01219331" }, { "coeff_range": "40256", "density": "0.160856269", "feasible": "yes", "file": "labs029.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "435", "obj_value": "62", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs029.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs029.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 59.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs030/labs030_summary.csv", "best_value": "59", "family": "", "format": "", "id": "02-labs:labs030", "instance": "labs030", "paper_context": "MIP, 60 vars, density 0.0204, optimal yes; QUBO, 465 vars, density 0.156, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.020352734", "feasible": "", "file": "labs030.lp", "formulation": "MIP", "num_constraints": "30", "num_vars": "60", "obj_value": "59", "optimal": "yes", "problem_size": "42.42640687" }, { "coeff_range": "40264", "density": "0.155890904", "feasible": "yes", "file": "labs030.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "465", "obj_value": "59", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs030.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs030.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:59:11", "best_numeric": 67.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs031/labs031_summary.csv", "best_value": "67.0", "family": "", "format": "", "id": "02-labs:labs031", "instance": "labs031", "paper_context": "MIP, 62 vars, density 0.0197, optimal yes; QUBO, 496 vars, density 0.151, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.019707036", "feasible": "", "file": "labs031.lp", "formulation": "MIP", "num_constraints": "31", "num_vars": "62", "obj_value": "67", "optimal": "yes", "problem_size": "43.84062043" }, { "coeff_range": "40272", "density": "0.151156942", "feasible": "yes", "file": "labs031.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "496", "obj_value": "67", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs031.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs031.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:59:11", "best_numeric": 64.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs032/labs032_summary.csv", "best_value": "64.0", "family": "", "format": "", "id": "02-labs:labs032", "instance": "labs032", "paper_context": "MIP, 64 vars, density 0.0191, optimal yes; QUBO, 528 vars, density 0.147, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.019108559", "feasible": "", "file": "labs032.lp", "formulation": "MIP", "num_constraints": "32", "num_vars": "64", "obj_value": "64", "optimal": "yes", "problem_size": "45.254834" }, { "coeff_range": "40280", "density": "0.146760612", "feasible": "yes", "file": "labs032.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "528", "obj_value": "64", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs032.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs032.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:59:11", "best_numeric": 64.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs033/labs033_summary.csv", "best_value": "64.0", "family": "", "format": "", "id": "02-labs:labs033", "instance": "labs033", "paper_context": "MIP, 66 vars, density 0.0185, optimal yes; QUBO, 561 vars, density 0.143, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.018538481", "feasible": "", "file": "labs033.lp", "formulation": "MIP", "num_constraints": "33", "num_vars": "66", "obj_value": "64", "optimal": "yes", "problem_size": "46.66904756" }, { "coeff_range": "40288", "density": "0.142558091", "feasible": "yes", "file": "labs033.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "561", "obj_value": "64", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs033.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs033.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:59:11", "best_numeric": 65.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs034/labs034_summary.csv", "best_value": "65.0", "family": "", "format": "", "id": "02-labs:labs034", "instance": "labs034", "paper_context": "MIP, 68 vars, density 0.018, optimal yes; QUBO, 595 vars, density 0.139, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.0180077", "feasible": "", "file": "labs034.lp", "formulation": "MIP", "num_constraints": "34", "num_vars": "68", "obj_value": "65", "optimal": "yes", "problem_size": "48.08326112" }, { "coeff_range": "40296", "density": "0.138638543", "feasible": "yes", "file": "labs034.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "595", "obj_value": "65", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs034.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs034.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 17:59:11", "best_numeric": 73.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs035/labs035_summary.csv", "best_value": "73.0", "family": "", "format": "", "id": "02-labs:labs035", "instance": "labs035", "paper_context": "MIP, 70 vars, density 0.0175, optimal yes; QUBO, 630 vars, density 0.135, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.017500699", "feasible": "", "file": "labs035.lp", "formulation": "MIP", "num_constraints": "35", "num_vars": "70", "obj_value": "73", "optimal": "yes", "problem_size": "49.49747468" }, { "coeff_range": "40304", "density": "0.134882902", "feasible": "yes", "file": "labs035.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "630", "obj_value": "73", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs035.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs035.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:00:07", "best_numeric": 82.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs036/labs036_summary.csv", "best_value": "82.0", "family": "", "format": "", "id": "02-labs:labs036", "instance": "labs036", "paper_context": "MIP, 72 vars, density 0.017, optimal yes; QUBO, 666 vars, density 0.131, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.017026749", "feasible": "", "file": "labs036.lp", "formulation": "MIP", "num_constraints": "36", "num_vars": "72", "obj_value": "82", "optimal": "yes", "problem_size": "50.91168825" }, { "coeff_range": "40312", "density": "0.131366749", "feasible": "yes", "file": "labs036.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "666", "obj_value": "82", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs036.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs036.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:00:52", "best_numeric": 86.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs037/labs037_summary.csv", "best_value": "86.0", "family": "", "format": "", "id": "02-labs:labs037", "instance": "labs037", "paper_context": "MIP, 74 vars, density 0.0166, optimal yes; QUBO, 703 vars, density 0.128, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.016572908", "feasible": "", "file": "labs037.lp", "formulation": "MIP", "num_constraints": "37", "num_vars": "74", "obj_value": "86", "optimal": "yes", "problem_size": "52.32590181" }, { "coeff_range": "40320", "density": "0.127990431", "feasible": "yes", "file": "labs037.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "703", "obj_value": "86", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs037.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs037.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:05:12", "best_numeric": 87.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs038/labs038_summary.csv", "best_value": "87.0", "family": "", "format": "", "id": "02-labs:labs038", "instance": "labs038", "paper_context": "MIP, 76 vars, density 0.0161, optimal yes; QUBO, 741 vars, density 0.125, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.01614713", "feasible": "", "file": "labs038.lp", "formulation": "MIP", "num_constraints": "38", "num_vars": "76", "obj_value": "87", "optimal": "yes", "problem_size": "53.74011537" }, { "coeff_range": "40328", "density": "0.124818578", "feasible": "yes", "file": "labs038.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "741", "obj_value": "87", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs038.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs038.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:06:52", "best_numeric": 99.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs039/labs039_summary.csv", "best_value": "99.0", "family": "", "format": "", "id": "02-labs:labs039", "instance": "labs039", "paper_context": "MIP, 78 vars, density 0.0157, optimal yes; QUBO, 780 vars, density 0.122, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.015738509", "feasible": "", "file": "labs039.lp", "formulation": "MIP", "num_constraints": "39", "num_vars": "78", "obj_value": "99", "optimal": "yes", "problem_size": "55.15432893" }, { "coeff_range": "40336", "density": "0.121766965", "feasible": "yes", "file": "labs039.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "780", "obj_value": "99", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs039.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs039.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:09:43", "best_numeric": 116.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs040/labs040_summary.csv", "best_value": "116.0", "family": "", "format": "", "id": "02-labs:labs040", "instance": "labs040", "paper_context": "MIP, 80 vars, density 0.0154, optimal yes; QUBO, 820 vars, density 0.119, optimal yes", "paper_metrics": [ { "coeff_range": "8", "density": "0.015353916", "feasible": "", "file": "labs040.lp", "formulation": "MIP", "num_constraints": "40", "num_vars": "80", "obj_value": "108", "optimal": "yes", "problem_size": "56.56854249" }, { "coeff_range": "40344", "density": "0.118891299", "feasible": "yes", "file": "labs040.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "820", "obj_value": "108", "optimal": "yes", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs040.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs040.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:13:43", "best_numeric": 112.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs041/labs041_summary.csv", "best_value": "112.0", "family": "", "format": "", "id": "02-labs:labs041", "instance": "labs041", "paper_context": "MIP, 82 vars, density 0.015, optimal no; QUBO, 861 vars, density 0.116, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.014984078", "feasible": "", "file": "labs041.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "82", "obj_value": "132", "optimal": "no", "problem_size": "57.98275606" }, { "coeff_range": "40352", "density": "0.116119766", "feasible": "yes", "file": "labs041.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "861", "obj_value": "132", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs041.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs041.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:14:13", "best_numeric": 117.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs042/labs042_summary.csv", "best_value": "117.0", "family": "", "format": "", "id": "02-labs:labs042", "instance": "labs042", "paper_context": "MIP, 84 vars, density 0.0146, optimal no; QUBO, 903 vars, density 0.114, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.014634973", "feasible": "", "file": "labs042.lp", "formulation": "MIP", "num_constraints": "42", "num_vars": "84", "obj_value": "149", "optimal": "no", "problem_size": "59.39696962" }, { "coeff_range": "40360", "density": "0.11350072", "feasible": "yes", "file": "labs042.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "903", "obj_value": "149", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs042.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs042.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:35:17", "best_numeric": 137.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs043/labs043_summary.csv", "best_value": "137.0", "family": "", "format": "", "id": "02-labs:labs043", "instance": "labs043", "paper_context": "MIP, 86 vars, density 0.0143, optimal no; QUBO, 946 vars, density 0.111, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.014298649", "feasible": "", "file": "labs043.lp", "formulation": "MIP", "num_constraints": "43", "num_vars": "86", "obj_value": "165", "optimal": "no", "problem_size": "60.81118318" }, { "coeff_range": "40368", "density": "0.110972449", "feasible": "yes", "file": "labs043.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "946", "obj_value": "165", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs043.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs043.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 18:54:20", "best_numeric": 146.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs044/labs044_summary.csv", "best_value": "146.0", "family": "", "format": "", "id": "02-labs:labs044", "instance": "labs044", "paper_context": "MIP, 88 vars, density 0.014, optimal no; QUBO, 990 vars, density 0.109, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.013980338", "feasible": "", "file": "labs044.lp", "formulation": "MIP", "num_constraints": "44", "num_vars": "88", "obj_value": "166", "optimal": "no", "problem_size": "62.22539674" }, { "coeff_range": "40376", "density": "0.108577195", "feasible": "yes", "file": "labs044.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "990", "obj_value": "166", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs044.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs044.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 19:33:55", "best_numeric": 154.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs045/labs045_summary.csv", "best_value": "154.0", "family": "", "format": "", "id": "02-labs:labs045", "instance": "labs045", "paper_context": "MIP, 90 vars, density 0.0137, optimal no; QUBO, 1035 vars, density 0.106, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.013673171", "feasible": "", "file": "labs045.lp", "formulation": "MIP", "num_constraints": "45", "num_vars": "90", "obj_value": "182", "optimal": "no", "problem_size": "63.63961031" }, { "coeff_range": "40384", "density": "0.106261541", "feasible": "yes", "file": "labs045.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1035", "obj_value": "182", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs045.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs045.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 20:01:33", "best_numeric": 179.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs046/labs046_summary.csv", "best_value": "179.0", "family": "", "format": "", "id": "02-labs:labs046", "instance": "labs046", "paper_context": "MIP, 92 vars, density 0.0134, optimal no; QUBO, 1081 vars, density 0.104, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.013381753", "feasible": "", "file": "labs046.lp", "formulation": "MIP", "num_constraints": "46", "num_vars": "92", "obj_value": "203", "optimal": "no", "problem_size": "65.05382387" }, { "coeff_range": "40392", "density": "0.104062611", "feasible": "yes", "file": "labs046.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1081", "obj_value": "203", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs046.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs046.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 20:05:54", "best_numeric": 175.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs047/labs047_summary.csv", "best_value": "175.0", "family": "", "format": "", "id": "02-labs:labs047", "instance": "labs047", "paper_context": "MIP, 94 vars, density 0.0131, optimal no; QUBO, 1128 vars, density 0.102, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.013100111", "feasible": "", "file": "labs047.lp", "formulation": "MIP", "num_constraints": "47", "num_vars": "94", "obj_value": "183", "optimal": "no", "problem_size": "66.46803743" }, { "coeff_range": "40400", "density": "0.101933865", "feasible": "yes", "file": "labs047.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1128", "obj_value": "183", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs047.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs047.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 196.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs048/labs048_summary.csv", "best_value": "196", "family": "", "format": "", "id": "02-labs:labs048", "instance": "labs048", "paper_context": "MIP, 96 vars, density 0.0128, optimal no; QUBO, 1176 vars, density 0.0999, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.012832316", "feasible": "", "file": "labs048.lp", "formulation": "MIP", "num_constraints": "48", "num_vars": "96", "obj_value": "196", "optimal": "no", "problem_size": "67.88225099" }, { "coeff_range": "40408", "density": "0.099908103", "feasible": "yes", "file": "labs048.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1176", "obj_value": "196", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs048.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs048.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 216.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs049/labs049_summary.csv", "best_value": "216", "family": "", "format": "", "id": "02-labs:labs049", "instance": "labs049", "paper_context": "MIP, 98 vars, density 0.0126, optimal no; QUBO, 1225 vars, density 0.0979, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.012573144", "feasible": "", "file": "labs049.lp", "formulation": "MIP", "num_constraints": "49", "num_vars": "98", "obj_value": "216", "optimal": "no", "problem_size": "69.29646456" }, { "coeff_range": "40416", "density": "0.097944535", "feasible": "yes", "file": "labs049.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1225", "obj_value": "216", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs049.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs049.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 20:14:05", "best_numeric": 225.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs050/labs050_summary.csv", "best_value": "225.0", "family": "", "format": "", "id": "02-labs:labs050", "instance": "labs050", "paper_context": "MIP, 100 vars, density 0.0123, optimal no; QUBO, 1275 vars, density 0.0961, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.012326214", "feasible": "", "file": "labs050.lp", "formulation": "MIP", "num_constraints": "50", "num_vars": "100", "obj_value": "257", "optimal": "no", "problem_size": "70.71067812" }, { "coeff_range": "40424", "density": "0.096072285", "feasible": "yes", "file": "labs050.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1275", "obj_value": "257", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs050.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs050.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 20:14:35", "best_numeric": 245.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs051/labs051_summary.csv", "best_value": "245.0", "family": "", "format": "", "id": "02-labs:labs051", "instance": "labs051", "paper_context": "MIP, 102 vars, density 0.0121, optimal no; QUBO, 1326 vars, density 0.0943, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.012086926", "feasible": "", "file": "labs051.lp", "formulation": "MIP", "num_constraints": "51", "num_vars": "102", "obj_value": "249", "optimal": "no", "problem_size": "72.12489168" }, { "coeff_range": "40432", "density": "0.094255405", "feasible": "yes", "file": "labs051.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1326", "obj_value": "249", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs051.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs051.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 20:35:37", "best_numeric": 214.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs052/labs052_summary.csv", "best_value": "214.0", "family": "", "format": "", "id": "02-labs:labs052", "instance": "labs052", "paper_context": "MIP, 104 vars, density 0.0119, optimal no; QUBO, 1378 vars, density 0.0925, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.011858514", "feasible": "", "file": "labs052.lp", "formulation": "MIP", "num_constraints": "52", "num_vars": "104", "obj_value": "254", "optimal": "no", "problem_size": "73.53910524" }, { "coeff_range": "40440", "density": "0.092519874", "feasible": "yes", "file": "labs052.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1378", "obj_value": "254", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs052.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs052.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 270.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs053/labs053_summary.csv", "best_value": "270", "family": "", "format": "", "id": "02-labs:labs053", "instance": "labs053", "paper_context": "MIP, 106 vars, density 0.0116, optimal no; QUBO, 1431 vars, density 0.0908, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.011636908", "feasible": "", "file": "labs053.lp", "formulation": "MIP", "num_constraints": "53", "num_vars": "106", "obj_value": "270", "optimal": "no", "problem_size": "74.95331881" }, { "coeff_range": "40448", "density": "0.090833851", "feasible": "yes", "file": "labs053.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1431", "obj_value": "270", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs053.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs053.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 255.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs054/labs054_summary.csv", "best_value": "255", "family": "", "format": "", "id": "02-labs:labs054", "instance": "labs054", "paper_context": "MIP, 108 vars, density 0.0114, optimal no; QUBO, 1485 vars, density 0.0892, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.011425005", "feasible": "", "file": "labs054.lp", "formulation": "MIP", "num_constraints": "54", "num_vars": "108", "obj_value": "255", "optimal": "no", "problem_size": "76.36753237" }, { "coeff_range": "40456", "density": "0.089220604", "feasible": "yes", "file": "labs054.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1485", "obj_value": "255", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs054.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs054.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 22:01:56", "best_numeric": 271.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs055/labs055_summary.csv", "best_value": "271.0", "family": "", "format": "", "id": "02-labs:labs055", "instance": "labs055", "paper_context": "MIP, 110 vars, density 0.0112, optimal no; QUBO, 1540 vars, density 0.0877, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.011219191", "feasible": "", "file": "labs055.lp", "formulation": "MIP", "num_constraints": "55", "num_vars": "110", "obj_value": "283", "optimal": "no", "problem_size": "77.78174593" }, { "coeff_range": "40464", "density": "0.087651803", "feasible": "yes", "file": "labs055.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1540", "obj_value": "283", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs055.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs055.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 22:06:03", "best_numeric": 252.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs056/labs056_summary.csv", "best_value": "252.0", "family": "", "format": "", "id": "02-labs:labs056", "instance": "labs056", "paper_context": "MIP, 112 vars, density 0.011, optimal no; QUBO, 1596 vars, density 0.0861, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.011022072", "feasible": "", "file": "labs056.lp", "formulation": "MIP", "num_constraints": "56", "num_vars": "112", "obj_value": "276", "optimal": "no", "problem_size": "79.19595949" }, { "coeff_range": "40472", "density": "0.08614837", "feasible": "yes", "file": "labs056.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1596", "obj_value": "276", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs056.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs056.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 320.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs057/labs057_summary.csv", "best_value": "320", "family": "", "format": "", "id": "02-labs:labs057", "instance": "labs057", "paper_context": "MIP, 114 vars, density 0.0108, optimal no; QUBO, 1653 vars, density 0.0847, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.01083042", "feasible": "", "file": "labs057.lp", "formulation": "MIP", "num_constraints": "57", "num_vars": "114", "obj_value": "320", "optimal": "no", "problem_size": "80.61017306" }, { "coeff_range": "40480", "density": "0.084684985", "feasible": "yes", "file": "labs057.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1653", "obj_value": "320", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs057.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs057.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 317.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs058/labs058_summary.csv", "best_value": "317", "family": "", "format": "", "id": "02-labs:labs058", "instance": "labs058", "paper_context": "MIP, 116 vars, density 0.0106, optimal no; QUBO, 1711 vars, density 0.0833, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.010646589", "feasible": "", "file": "labs058.lp", "formulation": "MIP", "num_constraints": "58", "num_vars": "116", "obj_value": "317", "optimal": "no", "problem_size": "82.02438662" }, { "coeff_range": "40488", "density": "0.083280532", "feasible": "yes", "file": "labs058.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1711", "obj_value": "317", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs058.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs058.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 333.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs059/labs059_summary.csv", "best_value": "333", "family": "", "format": "", "id": "02-labs:labs059", "instance": "labs059", "paper_context": "MIP, 118 vars, density 0.0105, optimal no; QUBO, 1770 vars, density 0.0819, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.010467686", "feasible": "", "file": "labs059.lp", "formulation": "MIP", "num_constraints": "59", "num_vars": "118", "obj_value": "333", "optimal": "no", "problem_size": "83.43860018" }, { "coeff_range": "40496", "density": "0.081912291", "feasible": "yes", "file": "labs059.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1770", "obj_value": "333", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs059.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs059.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-28 22:14:56", "best_numeric": 326.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs060/labs060_summary.csv", "best_value": "326.0", "family": "", "format": "", "id": "02-labs:labs060", "instance": "labs060", "paper_context": "MIP, 120 vars, density 0.0103, optimal no; QUBO, 1830 vars, density 0.0806, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.010295845", "feasible": "", "file": "labs060.lp", "formulation": "MIP", "num_constraints": "60", "num_vars": "120", "obj_value": "366", "optimal": "no", "problem_size": "84.85281374" }, { "coeff_range": "40580", "density": "0.080597362", "feasible": "yes", "file": "labs060.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1830", "obj_value": "366", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs060.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs060.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 346.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs061/labs061_summary.csv", "best_value": "346", "family": "", "format": "", "id": "02-labs:labs061", "instance": "labs061", "paper_context": "MIP, 122 vars, density 0.0101, optimal no; QUBO, 1891 vars, density 0.0793, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.01012846", "feasible": "", "file": "labs061.lp", "formulation": "MIP", "num_constraints": "61", "num_vars": "122", "obj_value": "346", "optimal": "no", "problem_size": "86.2670273" }, { "coeff_range": "40940", "density": "0.079315283", "feasible": "yes", "file": "labs061.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1891", "obj_value": "346", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs061.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs061.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 379.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs062/labs062_summary.csv", "best_value": "379", "family": "", "format": "", "id": "02-labs:labs062", "instance": "labs062", "paper_context": "MIP, 124 vars, density 0.00997, optimal no; QUBO, 1953 vars, density 0.0781, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009967472", "feasible": "", "file": "labs062.lp", "formulation": "MIP", "num_constraints": "62", "num_vars": "124", "obj_value": "379", "optimal": "no", "problem_size": "87.68124087" }, { "coeff_range": "41304", "density": "0.078081591", "feasible": "yes", "file": "labs062.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1953", "obj_value": "379", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs062.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs062.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 387.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs063/labs063_summary.csv", "best_value": "387", "family": "", "format": "", "id": "02-labs:labs063", "instance": "labs063", "paper_context": "MIP, 126 vars, density 0.00981, optimal no; QUBO, 2016 vars, density 0.0769, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009810528", "feasible": "", "file": "labs063.lp", "formulation": "MIP", "num_constraints": "63", "num_vars": "126", "obj_value": "387", "optimal": "no", "problem_size": "89.09545443" }, { "coeff_range": "41676", "density": "0.076877789", "feasible": "yes", "file": "labs063.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2016", "obj_value": "387", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs063.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs063.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 412.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs064/labs064_summary.csv", "best_value": "412", "family": "", "format": "", "id": "02-labs:labs064", "instance": "labs064", "paper_context": "MIP, 128 vars, density 0.00966, optimal no; QUBO, 2080 vars, density 0.0757, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009659396", "feasible": "", "file": "labs064.lp", "formulation": "MIP", "num_constraints": "64", "num_vars": "128", "obj_value": "412", "optimal": "no", "problem_size": "90.50966799" }, { "coeff_range": "42052", "density": "0.075718035", "feasible": "yes", "file": "labs064.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2080", "obj_value": "412", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs064.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs064.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-29 00:06:31", "best_numeric": 368.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs065/labs065_summary.csv", "best_value": "368.0", "family": "", "format": "", "id": "02-labs:labs065", "instance": "labs065", "paper_context": "MIP, 130 vars, density 0.00951, optimal no; QUBO, 2145 vars, density 0.0746, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009511946", "feasible": "", "file": "labs065.lp", "formulation": "MIP", "num_constraints": "65", "num_vars": "130", "obj_value": "460", "optimal": "no", "problem_size": "91.92388155" }, { "coeff_range": "42436", "density": "0.074585557", "feasible": "yes", "file": "labs065.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2145", "obj_value": "460", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs065.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs065.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 417.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs066/labs066_summary.csv", "best_value": "417", "family": "", "format": "", "id": "02-labs:labs066", "instance": "labs066", "paper_context": "MIP, 132 vars, density 0.00937, optimal no; QUBO, 2211 vars, density 0.0735, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009369792", "feasible": "", "file": "labs066.lp", "formulation": "MIP", "num_constraints": "66", "num_vars": "132", "obj_value": "417", "optimal": "no", "problem_size": "93.33809512" }, { "coeff_range": "42824", "density": "0.073493293", "feasible": "yes", "file": "labs066.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2211", "obj_value": "417", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs066.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs066.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 457.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs067/labs067_summary.csv", "best_value": "457", "family": "", "format": "", "id": "02-labs:labs067", "instance": "labs067", "paper_context": "MIP, 134 vars, density 0.00923, optimal no; QUBO, 2278 vars, density 0.0724, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009230999", "feasible": "", "file": "labs067.lp", "formulation": "MIP", "num_constraints": "67", "num_vars": "134", "obj_value": "457", "optimal": "no", "problem_size": "94.75230868" }, { "coeff_range": "43220", "density": "0.072425987", "feasible": "yes", "file": "labs067.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2278", "obj_value": "457", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs067.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs067.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 402.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs068/labs068_summary.csv", "best_value": "402", "family": "", "format": "", "id": "02-labs:labs068", "instance": "labs068", "paper_context": "MIP, 136 vars, density 0.0091, optimal no; QUBO, 2346 vars, density 0.0714, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.009097048", "feasible": "", "file": "labs068.lp", "formulation": "MIP", "num_constraints": "68", "num_vars": "136", "obj_value": "402", "optimal": "no", "problem_size": "96.16652224" }, { "coeff_range": "43620", "density": "0.071395491", "feasible": "yes", "file": "labs068.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2346", "obj_value": "402", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs068.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs068.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 446.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs069/labs069_summary.csv", "best_value": "446", "family": "", "format": "", "id": "02-labs:labs069", "instance": "labs069", "paper_context": "MIP, 138 vars, density 0.00897, optimal no; QUBO, 2415 vars, density 0.0704, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008966172", "feasible": "", "file": "labs069.lp", "formulation": "MIP", "num_constraints": "69", "num_vars": "138", "obj_value": "446", "optimal": "no", "problem_size": "97.5807358" }, { "coeff_range": "44028", "density": "0.07038789", "feasible": "yes", "file": "labs069.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2415", "obj_value": "446", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs069.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs069.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 527.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs070/labs070_summary.csv", "best_value": "527", "family": "", "format": "", "id": "02-labs:labs070", "instance": "labs070", "paper_context": "MIP, 140 vars, density 0.00884, optimal no; QUBO, 2485 vars, density 0.0694, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008839732", "feasible": "", "file": "labs070.lp", "formulation": "MIP", "num_constraints": "70", "num_vars": "140", "obj_value": "527", "optimal": "no", "problem_size": "98.99494937" }, { "coeff_range": "44440", "density": "0.069414071", "feasible": "yes", "file": "labs070.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2485", "obj_value": "527", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs070.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs070.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 499.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs071/labs071_summary.csv", "best_value": "499", "family": "", "format": "", "id": "02-labs:labs071", "instance": "labs071", "paper_context": "MIP, 142 vars, density 0.00872, optimal no; QUBO, 2556 vars, density 0.0685, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008716114", "feasible": "", "file": "labs071.lp", "formulation": "MIP", "num_constraints": "71", "num_vars": "142", "obj_value": "499", "optimal": "no", "problem_size": "100.4091629" }, { "coeff_range": "44860", "density": "0.068461304", "feasible": "yes", "file": "labs071.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2556", "obj_value": "499", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs071.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs071.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-29 01:35:14", "best_numeric": 492.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs072/labs072_summary.csv", "best_value": "492.0", "family": "", "format": "", "id": "02-labs:labs072", "instance": "labs072", "paper_context": "MIP, 144 vars, density 0.0086, optimal no; QUBO, 2628 vars, density 0.0675, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008596571", "feasible": "", "file": "labs072.lp", "formulation": "MIP", "num_constraints": "72", "num_vars": "144", "obj_value": "516", "optimal": "no", "problem_size": "101.8233765" }, { "coeff_range": "45284", "density": "0.067539613", "feasible": "yes", "file": "labs072.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2628", "obj_value": "516", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs072.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs072.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-29 02:02:47", "best_numeric": 548.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs073/labs073_summary.csv", "best_value": "548.0", "family": "", "format": "", "id": "02-labs:labs073", "instance": "labs073", "paper_context": "MIP, 146 vars, density 0.00848, optimal no; QUBO, 2701 vars, density 0.0666, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008479625", "feasible": "", "file": "labs073.lp", "formulation": "MIP", "num_constraints": "73", "num_vars": "146", "obj_value": "548", "optimal": "no", "problem_size": "103.2375901" }, { "coeff_range": "45716", "density": "0.066637326", "feasible": "yes", "file": "labs073.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2701", "obj_value": "548", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs073.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs073.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 557.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs074/labs074_summary.csv", "best_value": "557", "family": "", "format": "", "id": "02-labs:labs074", "instance": "labs074", "paper_context": "MIP, 148 vars, density 0.00837, optimal no; QUBO, 2775 vars, density 0.0658, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.00836643", "feasible": "", "file": "labs074.lp", "formulation": "MIP", "num_constraints": "74", "num_vars": "148", "obj_value": "557", "optimal": "no", "problem_size": "104.6518036" }, { "coeff_range": "46152", "density": "0.065763689", "feasible": "yes", "file": "labs074.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2775", "obj_value": "557", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs074.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs074.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 553.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs075/labs075_summary.csv", "best_value": "553", "family": "", "format": "", "id": "02-labs:labs075", "instance": "labs075", "paper_context": "MIP, 150 vars, density 0.00826, optimal no; QUBO, 2850 vars, density 0.0649, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008255628", "feasible": "", "file": "labs075.lp", "formulation": "MIP", "num_constraints": "75", "num_vars": "150", "obj_value": "553", "optimal": "no", "problem_size": "106.0660172" }, { "coeff_range": "46596", "density": "0.064907973", "feasible": "yes", "file": "labs075.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2850", "obj_value": "553", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs075.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs075.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2024-12-29 02:11:18", "best_numeric": 566.0, "best_submission": "20241229_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs076/labs076_summary.csv", "best_value": "566.0", "family": "", "format": "", "id": "02-labs:labs076", "instance": "labs076", "paper_context": "MIP, 152 vars, density 0.00815, optimal no; QUBO, 2926 vars, density 0.0641, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.008148289", "feasible": "", "file": "labs076.lp", "formulation": "MIP", "num_constraints": "76", "num_vars": "152", "obj_value": "602", "optimal": "no", "problem_size": "107.4802307" }, { "coeff_range": "47044", "density": "0.06407873", "feasible": "yes", "file": "labs076.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2926", "obj_value": "602", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs076.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs076.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 610.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs077/labs077_summary.csv", "best_value": "610", "family": "", "format": "", "id": "02-labs:labs077", "instance": "labs077", "paper_context": "MIP, 154 vars, density 0.00804, optimal no; QUBO, 3003 vars, density 0.0633, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.00804316", "feasible": "", "file": "labs077.lp", "formulation": "MIP", "num_constraints": "77", "num_vars": "154", "obj_value": "610", "optimal": "no", "problem_size": "108.8944443" }, { "coeff_range": "47500", "density": "0.063266073", "feasible": "yes", "file": "labs077.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3003", "obj_value": "610", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs077.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs077.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 643.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs078/labs078_summary.csv", "best_value": "643", "family": "", "format": "", "id": "02-labs:labs078", "instance": "labs078", "paper_context": "MIP, 156 vars, density 0.00794, optimal no; QUBO, 3081 vars, density 0.0625, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007941234", "feasible": "", "file": "labs078.lp", "formulation": "MIP", "num_constraints": "78", "num_vars": "156", "obj_value": "643", "optimal": "no", "problem_size": "110.3086579" }, { "coeff_range": "47960", "density": "0.062477924", "feasible": "yes", "file": "labs078.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3081", "obj_value": "643", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs078.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs078.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 611.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs079/labs079_summary.csv", "best_value": "611", "family": "", "format": "", "id": "02-labs:labs079", "instance": "labs079", "paper_context": "MIP, 158 vars, density 0.00784, optimal no; QUBO, 3160 vars, density 0.0617, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007841354", "feasible": "", "file": "labs079.lp", "formulation": "MIP", "num_constraints": "79", "num_vars": "158", "obj_value": "611", "optimal": "no", "problem_size": "111.7228714" }, { "coeff_range": "48428", "density": "0.061705157", "feasible": "yes", "file": "labs079.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3160", "obj_value": "611", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs079.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs079.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 644.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs080/labs080_summary.csv", "best_value": "644", "family": "", "format": "", "id": "02-labs:labs080", "instance": "labs080", "paper_context": "MIP, 160 vars, density 0.00774, optimal no; QUBO, 3240 vars, density 0.061, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.00774444", "feasible": "", "file": "labs080.lp", "formulation": "MIP", "num_constraints": "80", "num_vars": "160", "obj_value": "644", "optimal": "no", "problem_size": "113.137085" }, { "coeff_range": "48900", "density": "0.060955124", "feasible": "yes", "file": "labs080.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3240", "obj_value": "644", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs080.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs080.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 616.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs081/labs081_summary.csv", "best_value": "616", "family": "", "format": "", "id": "02-labs:labs081", "instance": "labs081", "paper_context": "MIP, 162 vars, density 0.00765, optimal no; QUBO, 3321 vars, density 0.0602, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007649425", "feasible": "", "file": "labs081.lp", "formulation": "MIP", "num_constraints": "81", "num_vars": "162", "obj_value": "616", "optimal": "no", "problem_size": "114.5512986" }, { "coeff_range": "49380", "density": "0.06021938", "feasible": "yes", "file": "labs081.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3321", "obj_value": "616", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs081.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs081.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 665.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs082/labs082_summary.csv", "best_value": "665", "family": "", "format": "", "id": "02-labs:labs082", "instance": "labs082", "paper_context": "MIP, 164 vars, density 0.00756, optimal no; QUBO, 3403 vars, density 0.0595, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007557164", "feasible": "", "file": "labs082.lp", "formulation": "MIP", "num_constraints": "82", "num_vars": "164", "obj_value": "665", "optimal": "no", "problem_size": "115.9655121" }, { "coeff_range": "49864", "density": "0.059504764", "feasible": "yes", "file": "labs082.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3403", "obj_value": "665", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs082.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs082.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 701.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs083/labs083_summary.csv", "best_value": "701", "family": "", "format": "", "id": "02-labs:labs083", "instance": "labs083", "paper_context": "MIP, 166 vars, density 0.00747, optimal no; QUBO, 3486 vars, density 0.0588, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007466667", "feasible": "", "file": "labs083.lp", "formulation": "MIP", "num_constraints": "83", "num_vars": "166", "obj_value": "701", "optimal": "no", "problem_size": "117.3797257" }, { "coeff_range": "50356", "density": "0.058803447", "feasible": "yes", "file": "labs083.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3486", "obj_value": "701", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs083.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs083.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 714.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs084/labs084_summary.csv", "best_value": "714", "family": "", "format": "", "id": "02-labs:labs084", "instance": "labs084", "paper_context": "MIP, 168 vars, density 0.00738, optimal no; QUBO, 3570 vars, density 0.0581, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007378731", "feasible": "", "file": "labs084.lp", "formulation": "MIP", "num_constraints": "84", "num_vars": "168", "obj_value": "714", "optimal": "no", "problem_size": "118.7939392" }, { "coeff_range": "50852", "density": "0.058121798", "feasible": "yes", "file": "labs084.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3570", "obj_value": "714", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs084.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs084.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 786.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs085/labs085_summary.csv", "best_value": "786", "family": "", "format": "", "id": "02-labs:labs085", "instance": "labs085", "paper_context": "MIP, 170 vars, density 0.00729, optimal no; QUBO, 3655 vars, density 0.0575, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007292438", "feasible": "", "file": "labs085.lp", "formulation": "MIP", "num_constraints": "85", "num_vars": "170", "obj_value": "786", "optimal": "no", "problem_size": "120.2081528" }, { "coeff_range": "51356", "density": "0.057452547", "feasible": "yes", "file": "labs085.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3655", "obj_value": "786", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs085.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs085.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 831.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs086/labs086_summary.csv", "best_value": "831", "family": "", "format": "", "id": "02-labs:labs086", "instance": "labs086", "paper_context": "MIP, 172 vars, density 0.00721, optimal no; QUBO, 3741 vars, density 0.0568, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.00720853", "feasible": "", "file": "labs086.lp", "formulation": "MIP", "num_constraints": "86", "num_vars": "172", "obj_value": "831", "optimal": "no", "problem_size": "121.6223664" }, { "coeff_range": "51864", "density": "0.056801637", "feasible": "yes", "file": "labs086.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3741", "obj_value": "831", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs086.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs086.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 815.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs087/labs087_summary.csv", "best_value": "815", "family": "", "format": "", "id": "02-labs:labs087", "instance": "labs087", "paper_context": "MIP, 174 vars, density 0.00713, optimal no; QUBO, 3828 vars, density 0.0562, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007126153", "feasible": "", "file": "labs087.lp", "formulation": "MIP", "num_constraints": "87", "num_vars": "174", "obj_value": "815", "optimal": "no", "problem_size": "123.0365799" }, { "coeff_range": "52380", "density": "0.056162302", "feasible": "yes", "file": "labs087.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3828", "obj_value": "815", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs087.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs087.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 748.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs088/labs088_summary.csv", "best_value": "748", "family": "", "format": "", "id": "02-labs:labs088", "instance": "labs088", "paper_context": "MIP, 176 vars, density 0.00705, optimal no; QUBO, 3916 vars, density 0.0555, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.007046003", "feasible": "", "file": "labs088.lp", "formulation": "MIP", "num_constraints": "88", "num_vars": "176", "obj_value": "748", "optimal": "no", "problem_size": "124.4507935" }, { "coeff_range": "52900", "density": "0.055540097", "feasible": "yes", "file": "labs088.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3916", "obj_value": "748", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs088.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs088.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 844.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs089/labs089_summary.csv", "best_value": "844", "family": "", "format": "", "id": "02-labs:labs089", "instance": "labs089", "paper_context": "MIP, 178 vars, density 0.00697, optimal no; QUBO, 4005 vars, density 0.0549, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006967283", "feasible": "", "file": "labs089.lp", "formulation": "MIP", "num_constraints": "89", "num_vars": "178", "obj_value": "844", "optimal": "no", "problem_size": "125.8650071" }, { "coeff_range": "53428", "density": "0.054928718", "feasible": "yes", "file": "labs089.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4005", "obj_value": "844", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs089.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs089.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 829.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs090/labs090_summary.csv", "best_value": "829", "family": "", "format": "", "id": "02-labs:labs090", "instance": "labs090", "paper_context": "MIP, 180 vars, density 0.00689, optimal no; QUBO, 4095 vars, density 0.0543, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006890643", "feasible": "", "file": "labs090.lp", "formulation": "MIP", "num_constraints": "90", "num_vars": "180", "obj_value": "829", "optimal": "no", "problem_size": "127.2792206" }, { "coeff_range": "53960", "density": "0.054333362", "feasible": "yes", "file": "labs090.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4095", "obj_value": "829", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs090.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs090.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 913.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs091/labs091_summary.csv", "best_value": "913", "family": "", "format": "", "id": "02-labs:labs091", "instance": "labs091", "paper_context": "MIP, 182 vars, density 0.00682, optimal no; QUBO, 4186 vars, density 0.0537, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006815341", "feasible": "", "file": "labs091.lp", "formulation": "MIP", "num_constraints": "91", "num_vars": "182", "obj_value": "913", "optimal": "no", "problem_size": "128.6934342" }, { "coeff_range": "54500", "density": "0.053748144", "feasible": "yes", "file": "labs091.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4186", "obj_value": "913", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs091.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs091.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 818.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs092/labs092_summary.csv", "best_value": "818", "family": "", "format": "", "id": "02-labs:labs092", "instance": "labs092", "paper_context": "MIP, 184 vars, density 0.00674, optimal no; QUBO, 4278 vars, density 0.0532, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006741986", "feasible": "", "file": "labs092.lp", "formulation": "MIP", "num_constraints": "92", "num_vars": "184", "obj_value": "818", "optimal": "no", "problem_size": "130.1076477" }, { "coeff_range": "55044", "density": "0.053177936", "feasible": "yes", "file": "labs092.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4278", "obj_value": "818", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs092.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs092.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 898.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs093/labs093_summary.csv", "best_value": "898", "family": "", "format": "", "id": "02-labs:labs093", "instance": "labs093", "paper_context": "MIP, 186 vars, density 0.00667, optimal no; QUBO, 4371 vars, density 0.0526, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006669884", "feasible": "", "file": "labs093.lp", "formulation": "MIP", "num_constraints": "93", "num_vars": "186", "obj_value": "898", "optimal": "no", "problem_size": "131.5218613" }, { "coeff_range": "55596", "density": "0.052617235", "feasible": "yes", "file": "labs093.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4371", "obj_value": "898", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs093.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs093.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 931.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs094/labs094_summary.csv", "best_value": "931", "family": "", "format": "", "id": "02-labs:labs094", "instance": "labs094", "paper_context": "MIP, 188 vars, density 0.0066, optimal no; QUBO, 4465 vars, density 0.0521, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006599608", "feasible": "", "file": "labs094.lp", "formulation": "MIP", "num_constraints": "94", "num_vars": "188", "obj_value": "931", "optimal": "no", "problem_size": "132.9360749" }, { "coeff_range": "56152", "density": "0.052070615", "feasible": "yes", "file": "labs094.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4465", "obj_value": "931", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs094.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs094.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 967.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs095/labs095_summary.csv", "best_value": "967", "family": "", "format": "", "id": "02-labs:labs095", "instance": "labs095", "paper_context": "MIP, 190 vars, density 0.00653, optimal no; QUBO, 4560 vars, density 0.0515, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006530507", "feasible": "", "file": "labs095.lp", "formulation": "MIP", "num_constraints": "95", "num_vars": "190", "obj_value": "967", "optimal": "no", "problem_size": "134.3502884" }, { "coeff_range": "56716", "density": "0.051532924", "feasible": "yes", "file": "labs095.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4560", "obj_value": "967", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs095.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs095.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 1012.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs096/labs096_summary.csv", "best_value": "1012", "family": "", "format": "", "id": "02-labs:labs096", "instance": "labs096", "paper_context": "MIP, 192 vars, density 0.00646, optimal no; QUBO, 4656 vars, density 0.051, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006463119", "feasible": "", "file": "labs096.lp", "formulation": "MIP", "num_constraints": "96", "num_vars": "192", "obj_value": "1012", "optimal": "no", "problem_size": "135.764502" }, { "coeff_range": "57284", "density": "0.051008459", "feasible": "yes", "file": "labs096.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4656", "obj_value": "1012", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs096.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs096.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 988.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs097/labs097_summary.csv", "best_value": "988", "family": "", "format": "", "id": "02-labs:labs097", "instance": "labs097", "paper_context": "MIP, 194 vars, density 0.0064, optimal no; QUBO, 4753 vars, density 0.0505, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006396835", "feasible": "", "file": "labs097.lp", "formulation": "MIP", "num_constraints": "97", "num_vars": "194", "obj_value": "988", "optimal": "no", "problem_size": "137.1787156" }, { "coeff_range": "57860", "density": "0.050492389", "feasible": "yes", "file": "labs097.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4753", "obj_value": "988", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs097.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs097.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 1049.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs098/labs098_summary.csv", "best_value": "1049", "family": "", "format": "", "id": "02-labs:labs098", "instance": "labs098", "paper_context": "MIP, 196 vars, density 0.00633, optimal no; QUBO, 4851 vars, density 0.05, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006332161", "feasible": "", "file": "labs098.lp", "formulation": "MIP", "num_constraints": "98", "num_vars": "196", "obj_value": "1049", "optimal": "no", "problem_size": "138.5929291" }, { "coeff_range": "58440", "density": "0.049988758", "feasible": "yes", "file": "labs098.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4851", "obj_value": "1049", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs098.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 1009.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs099/labs099_summary.csv", "best_value": "1009", "family": "", "format": "", "id": "02-labs:labs099", "instance": "labs099", "paper_context": "MIP, 198 vars, density 0.00627, optimal no; QUBO, 4950 vars, density 0.0495, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006268525", "feasible": "", "file": "labs099.lp", "formulation": "MIP", "num_constraints": "99", "num_vars": "198", "obj_value": "1009", "optimal": "no", "problem_size": "140.0071427" }, { "coeff_range": "59028", "density": "0.049493032", "feasible": "yes", "file": "labs099.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4950", "obj_value": "1009", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs099.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs099.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "21. Feb. 2025", "best_numeric": 1050.0, "best_submission": "20250221_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs100/labs100_summary.csv", "best_value": "1050", "family": "", "format": "", "id": "02-labs:labs100", "instance": "labs100", "paper_context": "MIP, 200 vars, density 0.00621, optimal no; QUBO, 5050 vars, density 0.049, optimal no", "paper_metrics": [ { "coeff_range": "8", "density": "0.006206404", "feasible": "", "file": "labs100.lp", "formulation": "MIP", "num_constraints": "100", "num_vars": "200", "obj_value": "1050", "optimal": "no", "problem_size": "141.4213562" }, { "coeff_range": "59620", "density": "0.049009019", "feasible": "yes", "file": "labs100.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5050", "obj_value": "1050", "optimal": "no", "problem_size": "" } ], "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "problem_why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.", "solution_path": "02-labs/solutions/labs100.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions/labs100.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones." }, { "best_date": "2026-01-10 20:51:38", "best_numeric": 2.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/B3_3_1_summary.csv", "best_value": "2.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_1", "instance": "B3_3_1", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-001.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "20300000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:04", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/B3_3_10_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_10", "instance": "B3_3_10", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-010.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "20400000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:41", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/B3_3_2_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_2", "instance": "B3_3_2", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-002.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "21900000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:44", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/B3_3_3_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_3", "instance": "B3_3_3", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-003.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "18000000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:47", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/B3_3_4_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_4", "instance": "B3_3_4", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-004.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "14200000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:50", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/B3_3_5_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_5", "instance": "B3_3_5", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-005.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "19900000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:53", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/B3_3_6_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_6", "instance": "B3_3_6", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-006.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "20600000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:56", "best_numeric": 2.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/B3_3_7_summary.csv", "best_value": "2.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_7", "instance": "B3_3_7", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-007.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "2", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "24400000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:51:58", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/B3_3_8_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_8", "instance": "B3_3_8", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-008.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "19100000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:01", "best_numeric": 2.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/B3_3_9_summary.csv", "best_value": "2.0", "family": "", "format": "", "id": "03-birkhoff:B3_3_9", "instance": "B3_3_9", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhS-3-009.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "3", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "25300000", "density": "0.36070491", "feasible": "yes", "file": "bhS-3-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:26", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/B3_9_1_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_1", "instance": "B3_9_1", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-001.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "17200000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:51", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/B3_9_10_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_10", "instance": "B3_9_10", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-010.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "21600000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:28", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/B3_9_2_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_2", "instance": "B3_9_2", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-002.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "13200000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:31", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/B3_9_3_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_3", "instance": "B3_9_3", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-003.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "16400000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:34", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/B3_9_4_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_4", "instance": "B3_9_4", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-004.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "4", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "15300000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:37", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/B3_9_5_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_5", "instance": "B3_9_5", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-005.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "16200000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:40", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/B3_9_6_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_6", "instance": "B3_9_6", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-006.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "4", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "18200000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:44", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/B3_9_7_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_7", "instance": "B3_9_7", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-007.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "22100000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:46", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/B3_9_8_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_8", "instance": "B3_9_8", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-008.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "16800000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:50", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/B3_9_9_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B3_9_9", "instance": "B3_9_9", "paper_context": "MIP, 12 vars, density 0.188, optimal yes; QUBO, 126 vars, density 0.361, optimal yes", "paper_metrics": [ { "coeff_range": "1001", "density": "0.1875", "feasible": "", "file": "bhD-3-009.lp", "formulation": "MIP", "num_constraints": "16", "num_vars": "12", "obj_value": "5", "optimal": "yes", "problem_size": "13.85640646" }, { "coeff_range": "18000000", "density": "0.36070491", "feasible": "yes", "file": "bhD-3-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "126", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:53", "best_numeric": 9.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/B4_16_1_summary.csv", "best_value": "9.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_1", "instance": "B4_16_1", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-001.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "10", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "6130000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:20", "best_numeric": 9.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/B4_16_10_summary.csv", "best_value": "9.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_10", "instance": "B4_16_10", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-010.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "10", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5250000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:55", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/B4_16_2_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_2", "instance": "B4_16_2", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-002.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "10", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5320000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:44:58", "best_numeric": 8.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/B4_16_3_summary.csv", "best_value": "8.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_3", "instance": "B4_16_3", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-003.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "10", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5040000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:02", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/B4_16_4_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_4", "instance": "B4_16_4", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-004.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "9", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "6090000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:04", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/B4_16_5_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_5", "instance": "B4_16_5", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-005.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "9", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5960000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:08", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/B4_16_6_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_6", "instance": "B4_16_6", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-006.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "10", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5530000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:11", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/B4_16_7_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_7", "instance": "B4_16_7", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-007.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "9", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5470000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:14", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/B4_16_8_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_8", "instance": "B4_16_8", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-008.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "9", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5040000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:17", "best_numeric": 10.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/B4_16_9_summary.csv", "best_value": "10.0", "family": "", "format": "", "id": "03-birkhoff:B4_16_9", "instance": "B4_16_9", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhD-4-009.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "9", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "5450000000", "density": "0.26606639", "feasible": "yes", "file": "bhD-4-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:07", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/B4_4_1_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_1", "instance": "B4_4_1", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-001.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "8100000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:34", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/B4_4_10_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_10", "instance": "B4_4_10", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-010.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "8030000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:10", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/B4_4_2_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_2", "instance": "B4_4_2", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-002.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "8060000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:13", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/B4_4_3_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_3", "instance": "B4_4_3", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-003.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "6930000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:16", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/B4_4_4_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_4", "instance": "B4_4_4", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-004.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "7540000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:19", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/B4_4_5_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_5", "instance": "B4_4_5", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-005.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "3", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "7470000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:22", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/B4_4_6_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_6", "instance": "B4_4_6", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-006.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "6710000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:25", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/B4_4_7_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_7", "instance": "B4_4_7", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-007.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "7900000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:28", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/B4_4_8_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_8", "instance": "B4_4_8", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-008.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "4", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "7250000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:31", "best_numeric": 4.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/B4_4_9_summary.csv", "best_value": "4.0", "family": "", "format": "", "id": "03-birkhoff:B4_4_9", "instance": "B4_4_9", "paper_context": "MIP, 48 vars, density 0.0854, optimal yes; QUBO, 696 vars, density 0.266, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.085365854", "feasible": "", "file": "bhS-4-009.lp", "formulation": "MIP", "num_constraints": "41", "num_vars": "48", "obj_value": "3", "optimal": "yes", "problem_size": "44.36214603" }, { "coeff_range": "7270000000", "density": "0.26606639", "feasible": "yes", "file": "bhS-4-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "696", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:45:22", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/B5_25_1_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_1", "instance": "B5_25_1", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-001.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "30700000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 10:27:24", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/B5_25_10_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_10", "instance": "B5_25_10", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-010.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "24500000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 05:46:14", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/B5_25_2_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_2", "instance": "B5_25_2", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-002.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "14", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "23500000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "14", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 07:08:58", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/B5_25_3_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_3", "instance": "B5_25_3", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-003.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "27900000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 07:10:17", "best_numeric": 13.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/B5_25_4_summary.csv", "best_value": "13.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_4", "instance": "B5_25_4", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-004.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "14", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "24100000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "14", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 07:49:45", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/B5_25_5_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_5", "instance": "B5_25_5", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-005.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "24300000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 07:54:10", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/B5_25_6_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_6", "instance": "B5_25_6", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-006.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "24400000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 09:55:08", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/B5_25_7_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_7", "instance": "B5_25_7", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-007.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "14", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "26600000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "14", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 10:01:09", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/B5_25_8_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_8", "instance": "B5_25_8", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-008.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "23500000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 10:24:33", "best_numeric": 14.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/B5_25_9_summary.csv", "best_value": "14.0", "family": "", "format": "", "id": "03-birkhoff:B5_25_9", "instance": "B5_25_9", "paper_context": "MIP, 240 vars, density 0.0274, optimal no; QUBO, 3480 vars, density 0.24, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhD-5-009.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "15", "optimal": "no", "problem_size": "187.1897433" }, { "coeff_range": "27000000000", "density": "0.23966557", "feasible": "yes", "file": "bhD-5-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "15", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:37", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/B5_5_1_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_1", "instance": "B5_5_1", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-001.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "30300000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:01", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/B5_5_10_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_10", "instance": "B5_5_10", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-010.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "42800000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:40", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/B5_5_2_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_2", "instance": "B5_5_2", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-002.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "31300000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:43", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/B5_5_3_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_3", "instance": "B5_5_3", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-003.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "32000000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:46", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/B5_5_4_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_4", "instance": "B5_5_4", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-004.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "35000000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:49", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/B5_5_5_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_5", "instance": "B5_5_5", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-005.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "39800000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:52", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/B5_5_6_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_6", "instance": "B5_5_6", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-006.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "32000000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:55", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/B5_5_7_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_7", "instance": "B5_5_7", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-007.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "44100000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:58", "best_numeric": 5.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/B5_5_8_summary.csv", "best_value": "5.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_8", "instance": "B5_5_8", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-008.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "41500000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:52:58", "best_numeric": 3.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/B5_5_9_summary.csv", "best_value": "3.0", "family": "", "format": "", "id": "03-birkhoff:B5_5_9", "instance": "B5_5_9", "paper_context": "MIP, 240 vars, density 0.0274, optimal yes; QUBO, 3480 vars, density 0.24, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.02739726", "feasible": "", "file": "bhS-5-009.lp", "formulation": "MIP", "num_constraints": "146", "num_vars": "240", "obj_value": "5", "optimal": "yes", "problem_size": "187.1897433" }, { "coeff_range": "38300000000", "density": "0.23966557", "feasible": "yes", "file": "bhS-5-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3480", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 10:38:31", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/B6_36_1_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_1", "instance": "B6_36_1", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-001.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "21", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.57E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "21", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:39:55", "best_numeric": 20.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/B6_36_10_summary.csv", "best_value": "20.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_10", "instance": "B6_36_10", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-010.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.26E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 12:32:16", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/B6_36_2_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_2", "instance": "B6_36_2", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-002.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "22", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.46E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "22", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 12:42:07", "best_numeric": 21.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/B6_36_3_summary.csv", "best_value": "21.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_3", "instance": "B6_36_3", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-003.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.32E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 14:34:41", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/B6_36_4_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_4", "instance": "B6_36_4", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-004.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "22", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.32E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "22", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 14:43:56", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/B6_36_5_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_5", "instance": "B6_36_5", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-005.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.38E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 16:36:20", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/B6_36_6_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_6", "instance": "B6_36_6", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-006.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.32E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 16:46:23", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/B6_36_7_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_7", "instance": "B6_36_7", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-007.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.28E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 18:38:04", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/B6_36_8_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_8", "instance": "B6_36_8", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-008.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.33E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 18:48:52", "best_numeric": 22.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/B6_36_9_summary.csv", "best_value": "22.0", "family": "", "format": "", "id": "03-birkhoff:B6_36_9", "instance": "B6_36_9", "paper_context": "MIP, 1440 vars, density 0.00594, optimal no; QUBO, 20880 vars, density 0.234, optimal no", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhD-6-009.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "23", "optimal": "no", "problem_size": "1044.068963" }, { "coeff_range": "1.67E+11", "density": "0.23415776", "feasible": "yes", "file": "bhD-6-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "23", "optimal": "no", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:04", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/B6_6_1_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_1", "instance": "B6_6_1", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-001.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.60E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-001.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:28", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/B6_6_10_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_10", "instance": "B6_6_10", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-010.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.72E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-010.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:07", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/B6_6_2_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_2", "instance": "B6_6_2", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-002.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "2.25E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-002.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:10", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/B6_6_3_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_3", "instance": "B6_6_3", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-003.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.69E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-003.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:13", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/B6_6_4_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_4", "instance": "B6_6_4", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-004.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.78E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-004.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:16", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/B6_6_5_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_5", "instance": "B6_6_5", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-005.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.68E+11", "density": "0.23415775", "feasible": "yes", "file": "bhS-6-005.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:19", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/B6_6_6_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_6", "instance": "B6_6_6", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-006.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.93E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-006.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:22", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/B6_6_7_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_7", "instance": "B6_6_7", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-007.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.50E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-007.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:25", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/B6_6_8_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_8", "instance": "B6_6_8", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-008.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "6", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "2.36E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-008.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "2026-01-10 20:53:28", "best_numeric": 6.0, "best_submission": "20260111_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/B6_6_9_summary.csv", "best_value": "6.0", "family": "", "format": "", "id": "03-birkhoff:B6_6_9", "instance": "B6_6_9", "paper_context": "MIP, 1440 vars, density 0.00594, optimal yes; QUBO, 20880 vars, density 0.234, optimal yes", "paper_metrics": [ { "coeff_range": "10001", "density": "0.005944518", "feasible": "", "file": "bhS-6-009.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "1440", "obj_value": "5", "optimal": "yes", "problem_size": "1044.068963" }, { "coeff_range": "1.94E+11", "density": "0.23415776", "feasible": "yes", "file": "bhS-6-009.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20880", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_03_dense", "instance": "qbench_03_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_03_dense.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_03_dense.json", "source_path": "03-birkhoff/instances/qbench_03_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_03_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_03_sparse", "instance": "qbench_03_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_03_sparse.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_03_sparse.json", "source_path": "03-birkhoff/instances/qbench_03_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_03_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_04_dense", "instance": "qbench_04_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_04_dense.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_04_dense.json", "source_path": "03-birkhoff/instances/qbench_04_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_04_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_04_sparse", "instance": "qbench_04_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_04_sparse.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_04_sparse.json", "source_path": "03-birkhoff/instances/qbench_04_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_04_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_05_dense", "instance": "qbench_05_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_05_dense.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_05_dense.json", "source_path": "03-birkhoff/instances/qbench_05_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_05_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_05_sparse", "instance": "qbench_05_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_05_sparse.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_05_sparse.json", "source_path": "03-birkhoff/instances/qbench_05_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_05_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_06_dense", "instance": "qbench_06_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_06_dense.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_06_dense.json", "source_path": "03-birkhoff/instances/qbench_06_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_06_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_06_sparse", "instance": "qbench_06_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "03-birkhoff/solutions/qbench_06_sparse.json", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions/qbench_06_sparse.json", "source_path": "03-birkhoff/instances/qbench_06_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_06_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_07_dense", "instance": "qbench_07_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_07_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_07_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_07_sparse", "instance": "qbench_07_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_07_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_07_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_08_dense", "instance": "qbench_08_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_08_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_08_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_08_sparse", "instance": "qbench_08_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_08_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_08_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_09_dense", "instance": "qbench_09_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_09_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_09_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_09_sparse", "instance": "qbench_09_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_09_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_09_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_10_dense", "instance": "qbench_10_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_10_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_10_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_10_sparse", "instance": "qbench_10_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_10_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_10_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_11_dense", "instance": "qbench_11_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_11_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_11_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_11_sparse", "instance": "qbench_11_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_11_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_11_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_12_dense", "instance": "qbench_12_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_12_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_12_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_12_sparse", "instance": "qbench_12_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_12_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_12_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_13_dense", "instance": "qbench_13_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_13_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_13_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_13_sparse", "instance": "qbench_13_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_13_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_13_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_14_dense", "instance": "qbench_14_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_14_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_14_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_14_sparse", "instance": "qbench_14_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_14_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_14_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_15_dense", "instance": "qbench_15_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_15_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_15_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_15_sparse", "instance": "qbench_15_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_15_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_15_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_16_dense", "instance": "qbench_16_dense", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_16_dense.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_16_dense.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".json", "id": "03-birkhoff:qbench_16_sparse", "instance": "qbench_16_sparse", "paper_context": "", "paper_metrics": [], "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "problem_why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "03-birkhoff/instances/qbench_16_sparse.json", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances/qbench_16_sparse.json", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l1_t2_h0_rs97531", "instance": "stp_s003_l1_t2_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l1_t2_h0_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l1_t2_h0_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s003_l1_t2_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l1_t2_h0_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l1_t2_h3_rs24098", "instance": "stp_s003_l1_t2_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l1_t2_h3_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l1_t2_h3_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s003_l1_t2_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l1_t2_h3_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l1_t2_h5_rs24098", "instance": "stp_s003_l1_t2_h5_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l1_t2_h5_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l1_t2_h5_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s003_l1_t2_h5_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l1_t2_h5_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l1_t3_h0_rs24098", "instance": "stp_s003_l1_t3_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l1_t3_h0_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l1_t3_h0_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s003_l1_t3_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l1_t3_h0_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l1_t3_h1_rs24098", "instance": "stp_s003_l1_t3_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l1_t3_h1_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l1_t3_h1_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s003_l1_t3_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l1_t3_h1_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l2_t2_h4_rs24098", "instance": "stp_s003_l2_t2_h4_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l2_t2_h4_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l2_t2_h4_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s003_l2_t2_h4_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l2_t2_h4_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s003_l2_t2_h5_rs37235", "instance": "stp_s003_l2_t2_h5_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s003_l2_t2_h5_rs37235.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s003_l2_t2_h5_rs37235.opt.sol", "source_path": "04-steiner/instances/stp_s003_l2_t2_h5_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s003_l2_t2_h5_rs37235", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s004_l1_t2_h4_rs37235", "instance": "stp_s004_l1_t2_h4_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s004_l1_t2_h4_rs37235.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s004_l1_t2_h4_rs37235.opt.sol", "source_path": "04-steiner/instances/stp_s004_l1_t2_h4_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s004_l1_t2_h4_rs37235", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s004_l1_t3_h3_rs24098", "instance": "stp_s004_l1_t3_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s004_l1_t3_h3_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s004_l1_t3_h3_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s004_l1_t3_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s004_l1_t3_h3_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s004_l1_t3_h3_rs97531", "instance": "stp_s004_l1_t3_h3_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s004_l1_t3_h3_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s004_l1_t3_h3_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s004_l1_t3_h3_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s004_l1_t3_h3_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l2_t3_h2_rs24098", "instance": "stp_s020_l2_t3_h2_rs24098", "paper_context": "MIP, 78372 vars, density 6.37e-05, optimal yes; QUBO, 127676 vars, density 0.000162, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "6.37E-05", "feasible": "", "file": "stp_s020_l2_t3_h2_rs24098.lp", "formulation": "MIP", "num_constraints": "41117", "num_vars": "78372", "obj_value": "228", "optimal": "yes", "problem_size": "56766.3767" }, { "coeff_range": "209000", "density": "0.00016245", "feasible": "yes", "file": "stp_s020_l2_t3_h2_rs24098.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "127676", "obj_value": "228", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l2_t3_h2_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l2_t3_h2_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s020_l2_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l2_t3_h2_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l2_t3_h3_rs97531", "instance": "stp_s020_l2_t3_h3_rs97531", "paper_context": "MIP, 95160 vars, density 5.19e-05, optimal yes; QUBO, 154510 vars, density 0.000148, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "5.19E-05", "feasible": "", "file": "stp_s020_l2_t3_h3_rs97531.lp", "formulation": "MIP", "num_constraints": "50376", "num_vars": "95160", "obj_value": "219", "optimal": "yes", "problem_size": "69237.12992" }, { "coeff_range": "256000", "density": "0.00014837", "feasible": "yes", "file": "stp_s020_l2_t3_h3_rs97531.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "154510", "obj_value": "219", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l2_t3_h3_rs97531.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l2_t3_h3_rs97531.bst.sol", "source_path": "04-steiner/instances/stp_s020_l2_t3_h3_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l2_t3_h3_rs97531", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l2_t4_h0_rs24098", "instance": "stp_s020_l2_t4_h0_rs24098", "paper_context": "MIP, 99840 vars, density 5.84e-05, optimal yes; QUBO, 158232 vars, density 0.000133, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "5.84E-05", "feasible": "", "file": "stp_s020_l2_t4_h0_rs24098.lp", "formulation": "MIP", "num_constraints": "46082", "num_vars": "99840", "obj_value": "242", "optimal": "yes", "problem_size": "67829.3954" }, { "coeff_range": "492000", "density": "0.00013323", "feasible": "yes", "file": "stp_s020_l2_t4_h0_rs24098.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "158232", "obj_value": "242", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l2_t4_h0_rs24098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l2_t4_h0_rs24098.bst.sol", "source_path": "04-steiner/instances/stp_s020_l2_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l2_t4_h0_rs24098", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l2_t4_h3_rs37235", "instance": "stp_s020_l2_t4_h3_rs37235", "paper_context": "MIP, 81664 vars, density 6.3e-05, optimal yes; QUBO, 123288 vars, density 0.000177, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "6.30E-05", "feasible": "", "file": "stp_s020_l2_t4_h3_rs37235.lp", "formulation": "MIP", "num_constraints": "41822", "num_vars": "81664", "obj_value": "189", "optimal": "yes", "problem_size": "58441.01135" }, { "coeff_range": "475000", "density": "0.00017671", "feasible": "yes", "file": "stp_s020_l2_t4_h3_rs37235.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "123288", "obj_value": "189", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l2_t4_h3_rs37235.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l2_t4_h3_rs37235.opt.sol", "source_path": "04-steiner/instances/stp_s020_l2_t4_h3_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l2_t4_h3_rs37235", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l3_t3_h2_rs24098", "instance": "stp_s020_l3_t3_h2_rs24098", "paper_context": "MIP, 211820 vars, density 2.21e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "2.21E-05", "feasible": "", "file": "stp_s020_l3_t3_h2_rs24098.lp", "formulation": "MIP", "num_constraints": "116216", "num_vars": "211820", "obj_value": "355", "optimal": "yes", "problem_size": "156897.6517" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l3_t3_h2_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "355", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l3_t3_h2_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l3_t3_h2_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s020_l3_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l3_t3_h2_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l3_t4_h0_rs24098", "instance": "stp_s020_l3_t4_h0_rs24098", "paper_context": "MIP, 160160 vars, density 3.44e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "3.44E-05", "feasible": "", "file": "stp_s020_l3_t4_h0_rs24098.lp", "formulation": "MIP", "num_constraints": "77210", "num_vars": "160160", "obj_value": "230", "optimal": "yes", "problem_size": "111202.3093" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l3_t4_h0_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "230", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l3_t4_h0_rs24098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l3_t4_h0_rs24098.bst.sol", "source_path": "04-steiner/instances/stp_s020_l3_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l3_t4_h0_rs24098", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l3_t4_h2_rs97531", "instance": "stp_s020_l3_t4_h2_rs97531", "paper_context": "MIP, 132880 vars, density 3.97e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "3.97E-05", "feasible": "", "file": "stp_s020_l3_t4_h2_rs97531.lp", "formulation": "MIP", "num_constraints": "66446", "num_vars": "132880", "obj_value": "163", "optimal": "yes", "problem_size": "93964.59163" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l3_t4_h2_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "163", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l3_t4_h2_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l3_t4_h2_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s020_l3_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l3_t4_h2_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l3_t4_h3_rs97531", "instance": "stp_s020_l3_t4_h3_rs97531", "paper_context": "MIP, 137540 vars, density 3.63e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "3.63E-05", "feasible": "", "file": "stp_s020_l3_t4_h3_rs97531.lp", "formulation": "MIP", "num_constraints": "71960", "num_vars": "137540", "obj_value": "217", "optimal": "yes", "problem_size": "99485.5688" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l3_t4_h3_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "217", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l3_t4_h3_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l3_t4_h3_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s020_l3_t4_h3_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l3_t4_h3_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l4_t3_h3_rs37235", "instance": "stp_s020_l4_t3_h3_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l4_t3_h3_rs37235.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l4_t3_h3_rs37235.bst.sol", "source_path": "04-steiner/instances/stp_s020_l4_t3_h3_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l4_t3_h3_rs37235", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l4_t4_h0_rs24098", "instance": "stp_s020_l4_t4_h0_rs24098", "paper_context": "MIP, 245920 vars, density 2.44e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "2.44E-05", "feasible": "", "file": "stp_s020_l4_t4_h0_rs24098.lp", "formulation": "MIP", "num_constraints": "110120", "num_vars": "245920", "obj_value": "281", "optimal": "yes", "problem_size": "164562.1779" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l4_t4_h0_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "281", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l4_t4_h0_rs24098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l4_t4_h0_rs24098.bst.sol", "source_path": "04-steiner/instances/stp_s020_l4_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l4_t4_h0_rs24098", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l4_t4_h3_rs37235", "instance": "stp_s020_l4_t4_h3_rs37235", "paper_context": "MIP, 179872 vars, density 2.95e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "2.95E-05", "feasible": "", "file": "stp_s020_l4_t4_h3_rs37235.lp", "formulation": "MIP", "num_constraints": "89384", "num_vars": "179872", "obj_value": "189", "optimal": "yes", "problem_size": "126797.7872" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l4_t4_h3_rs37235.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "189", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l4_t4_h3_rs37235.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l4_t4_h3_rs37235.opt.sol", "source_path": "04-steiner/instances/stp_s020_l4_t4_h3_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l4_t4_h3_rs37235", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l5_t3_h3_rs24098", "instance": "stp_s020_l5_t3_h3_rs24098", "paper_context": "MIP, 317880 vars, density 1.68e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "1.68E-05", "feasible": "", "file": "stp_s020_l5_t3_h3_rs24098.lp", "formulation": "MIP", "num_constraints": "156724", "num_vars": "317880", "obj_value": "284", "optimal": "yes", "problem_size": "223202.6548" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l5_t3_h3_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "284", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l5_t3_h3_rs24098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l5_t3_h3_rs24098.bst.sol", "source_path": "04-steiner/instances/stp_s020_l5_t3_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l5_t3_h3_rs24098", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l5_t4_h0_rs24098", "instance": "stp_s020_l5_t4_h0_rs24098", "paper_context": "MIP, 313200 vars, density 1.93e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "1.93E-05", "feasible": "", "file": "stp_s020_l5_t4_h0_rs24098.lp", "formulation": "MIP", "num_constraints": "139400", "num_vars": "313200", "obj_value": "281", "optimal": "yes", "problem_size": "208949.9462" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s020_l5_t4_h0_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "281", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l5_t4_h0_rs24098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l5_t4_h0_rs24098.bst.sol", "source_path": "04-steiner/instances/stp_s020_l5_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l5_t4_h0_rs24098", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s020_l5_t4_h3_rs97531", "instance": "stp_s020_l5_t4_h3_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s020_l5_t4_h3_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s020_l5_t4_h3_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s020_l5_t4_h3_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s020_l5_t4_h3_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l2_t3_h1_rs97531", "instance": "stp_s030_l2_t3_h1_rs97531", "paper_context": "MIP, 267654 vars, density 1.87e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "1.87E-05", "feasible": "", "file": "stp_s030_l2_t3_h1_rs97531.lp", "formulation": "MIP", "num_constraints": "139615", "num_vars": "267654", "obj_value": "389", "optimal": "yes", "problem_size": "193309.3718" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l2_t3_h1_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "389", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l2_t3_h1_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l2_t3_h1_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l2_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l2_t3_h1_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l2_t3_h3_rs97531", "instance": "stp_s030_l2_t3_h3_rs97531", "paper_context": "MIP, 269696 vars, density 1.89e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "1.89E-05", "feasible": "", "file": "stp_s030_l2_t3_h3_rs97531.lp", "formulation": "MIP", "num_constraints": "138692", "num_vars": "269696", "obj_value": "388", "optimal": "yes", "problem_size": "193402.8894" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l2_t3_h3_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "388", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l2_t3_h3_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l2_t3_h3_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l2_t3_h3_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l2_t3_h3_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l2_t4_h2_rs97531", "instance": "stp_s030_l2_t4_h2_rs97531", "paper_context": "MIP, 255240 vars, density 2.04e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "2.04E-05", "feasible": "", "file": "stp_s030_l2_t4_h2_rs97531.lp", "formulation": "MIP", "num_constraints": "129336", "num_vars": "255240", "obj_value": "387", "optimal": "yes", "problem_size": "181691.2784" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l2_t4_h2_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "387", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l2_t4_h2_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l2_t4_h2_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l2_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l2_t4_h2_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l2_t5_h1_rs24098", "instance": "stp_s030_l2_t5_h1_rs24098", "paper_context": "MIP, 276288 vars, density 2.1e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "5", "density": "2.10E-05", "feasible": "", "file": "stp_s030_l2_t5_h1_rs24098.lp", "formulation": "MIP", "num_constraints": "127706", "num_vars": "276288", "obj_value": "430", "optimal": "yes", "problem_size": "187839.3871" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l2_t5_h1_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "430", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l2_t5_h1_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l2_t5_h1_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s030_l2_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l2_t5_h1_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l3_t3_h1_rs97531", "instance": "stp_s030_l3_t3_h1_rs97531", "paper_context": "MIP, 361764 vars, density 1.41e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "1.41E-05", "feasible": "", "file": "stp_s030_l3_t3_h1_rs97531.lp", "formulation": "MIP", "num_constraints": "185216", "num_vars": "361764", "obj_value": "327", "optimal": "yes", "problem_size": "258852.2378" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l3_t3_h1_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "327", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l3_t3_h1_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l3_t3_h1_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l3_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l3_t3_h1_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l3_t3_h2_rs97531", "instance": "stp_s030_l3_t3_h2_rs97531", "paper_context": "MIP, 358488 vars, density 1.32e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "1.32E-05", "feasible": "", "file": "stp_s030_l3_t3_h2_rs97531.lp", "formulation": "MIP", "num_constraints": "195048", "num_vars": "358488", "obj_value": "343", "optimal": "yes", "problem_size": "264428.3786" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l3_t3_h2_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "343", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l3_t3_h2_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l3_t3_h2_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l3_t3_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l3_t3_h2_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l3_t4_h0_rs24098", "instance": "stp_s030_l3_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l3_t4_h0_rs24098.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l3_t4_h0_rs24098.bst.sol", "source_path": "04-steiner/instances/stp_s030_l3_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l3_t4_h0_rs24098", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l3_t5_h1_rs24098", "instance": "stp_s030_l3_t5_h1_rs24098", "paper_context": "MIP, 473076 vars, density 1.23e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "5", "density": "1.23E-05", "feasible": "", "file": "stp_s030_l3_t5_h1_rs24098.lp", "formulation": "MIP", "num_constraints": "217842", "num_vars": "473076", "obj_value": "476", "optimal": "yes", "problem_size": "321023.0864" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l3_t5_h1_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "476", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l3_t5_h1_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l3_t5_h1_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s030_l3_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l3_t5_h1_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l4_t3_h1_rs97531", "instance": "stp_s030_l4_t3_h1_rs97531", "paper_context": "MIP, 499044 vars, density 1.03e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "1.03E-05", "feasible": "", "file": "stp_s030_l4_t3_h1_rs97531.lp", "formulation": "MIP", "num_constraints": "253316", "num_vars": "499044", "obj_value": "328", "optimal": "yes", "problem_size": "355550.0385" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l4_t3_h1_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "328", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l4_t3_h1_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l4_t3_h1_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l4_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l4_t3_h1_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l4_t4_h0_rs97531", "instance": "stp_s030_l4_t4_h0_rs97531", "paper_context": "MIP, 676200 vars, density 8.87e-06, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "8.87E-06", "feasible": "", "file": "stp_s030_l4_t4_h0_rs97531.lp", "formulation": "MIP", "num_constraints": "302808", "num_vars": "676200", "obj_value": "429", "optimal": "yes", "problem_size": "452502.7841" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l4_t4_h0_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "429", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l4_t4_h0_rs97531.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l4_t4_h0_rs97531.bst.sol", "source_path": "04-steiner/instances/stp_s030_l4_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l4_t4_h0_rs97531", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l4_t4_h2_rs97531", "instance": "stp_s030_l4_t4_h2_rs97531", "paper_context": "MIP, 592410 vars, density 9.9e-06, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "9.90E-06", "feasible": "", "file": "stp_s030_l4_t4_h2_rs97531.lp", "formulation": "MIP", "num_constraints": "270531", "num_vars": "592410", "obj_value": "424", "optimal": "yes", "problem_size": "400331.4498" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l4_t4_h2_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "424", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l4_t4_h2_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l4_t4_h2_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l4_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l4_t4_h2_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l5_t3_h1_rs97531", "instance": "stp_s030_l5_t3_h1_rs97531", "paper_context": "MIP, 636324 vars, density 8.14e-06, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "3", "density": "8.14E-06", "feasible": "", "file": "stp_s030_l5_t3_h1_rs97531.lp", "formulation": "MIP", "num_constraints": "321416", "num_vars": "636324", "obj_value": "320", "optimal": "yes", "problem_size": "452244.0876" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l5_t3_h1_rs97531.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "320", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l5_t3_h1_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l5_t3_h1_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s030_l5_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l5_t3_h1_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s030_l5_t4_h0_rs24098", "instance": "stp_s030_l5_t4_h0_rs24098", "paper_context": "MIP, 762600 vars, density 7.76e-06, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "4", "density": "7.76E-06", "feasible": "", "file": "stp_s030_l5_t4_h0_rs24098.lp", "formulation": "MIP", "num_constraints": "345231", "num_vars": "762600", "obj_value": "447", "optimal": "yes", "problem_size": "513101.511" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "stp_s030_l5_t4_h0_rs24098.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "447", "optimal": "yes", "problem_size": "" } ], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s030_l5_t4_h0_rs24098.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s030_l5_t4_h0_rs24098.opt.sol", "source_path": "04-steiner/instances/stp_s030_l5_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s030_l5_t4_h0_rs24098", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l2_t3_h0_rs97531", "instance": "stp_s040_l2_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l2_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l2_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l2_t3_h2_rs24098", "instance": "stp_s040_l2_t3_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l2_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l2_t3_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l2_t4_h0_rs97531", "instance": "stp_s040_l2_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l2_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l2_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l2_t4_h3_rs123", "instance": "stp_s040_l2_t4_h3_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l2_t4_h3_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l2_t4_h3_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l3_t3_h0_rs97531", "instance": "stp_s040_l3_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l3_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l3_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l3_t4_h0_rs97531", "instance": "stp_s040_l3_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l3_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l3_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l3_t4_h1_rs24098", "instance": "stp_s040_l3_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l3_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l3_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l4_t3_h0_rs97531", "instance": "stp_s040_l4_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l4_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l4_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l4_t4_h0_rs123", "instance": "stp_s040_l4_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l4_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l4_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l4_t4_h0_rs97531", "instance": "stp_s040_l4_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l4_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l4_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l4_t4_h1_rs24098", "instance": "stp_s040_l4_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l4_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l4_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l4_t5_h0_rs24098", "instance": "stp_s040_l4_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l4_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l4_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l5_t3_h0_rs97531", "instance": "stp_s040_l5_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l5_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l5_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l5_t4_h0_rs24098", "instance": "stp_s040_l5_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l5_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l5_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l5_t4_h1_rs24098", "instance": "stp_s040_l5_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l5_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l5_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s040_l5_t5_h0_rs24098", "instance": "stp_s040_l5_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s040_l5_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s040_l5_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l2_t3_h1_rs97531", "instance": "stp_s050_l2_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s050_l2_t3_h1_rs97531.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s050_l2_t3_h1_rs97531.bst.sol", "source_path": "04-steiner/instances/stp_s050_l2_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l2_t3_h1_rs97531", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l2_t3_h3_rs24098", "instance": "stp_s050_l2_t3_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l2_t3_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l2_t3_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l2_t4_h0_rs24098", "instance": "stp_s050_l2_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l2_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l2_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l2_t4_h1_rs97531", "instance": "stp_s050_l2_t4_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s050_l2_t4_h1_rs97531.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s050_l2_t4_h1_rs97531.bst.sol", "source_path": "04-steiner/instances/stp_s050_l2_t4_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l2_t4_h1_rs97531", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l2_t4_h3_rs24098", "instance": "stp_s050_l2_t4_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l2_t4_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l2_t4_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l2_t5_h1_rs97531", "instance": "stp_s050_l2_t5_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l2_t5_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l2_t5_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t3_h3_rs24098", "instance": "stp_s050_l3_t3_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l3_t3_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t3_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t4_h0_rs123", "instance": "stp_s050_l3_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l3_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t4_h0_rs24098", "instance": "stp_s050_l3_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l3_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t4_h2_rs123", "instance": "stp_s050_l3_t4_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l3_t4_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t4_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t4_h2_rs24098", "instance": "stp_s050_l3_t4_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l3_t4_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t4_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t5_h1_rs97531", "instance": "stp_s050_l3_t5_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l3_t5_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t5_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l3_t6_h2_rs97531", "instance": "stp_s050_l3_t6_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s050_l3_t6_h2_rs97531.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s050_l3_t6_h2_rs97531.bst.sol", "source_path": "04-steiner/instances/stp_s050_l3_t6_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l3_t6_h2_rs97531", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l4_t4_h0_rs123", "instance": "stp_s050_l4_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l4_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l4_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l4_t4_h2_rs123", "instance": "stp_s050_l4_t4_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l4_t4_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l4_t4_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l4_t4_h2_rs24098", "instance": "stp_s050_l4_t4_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l4_t4_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l4_t4_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l4_t5_h0_rs97531", "instance": "stp_s050_l4_t5_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l4_t5_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l4_t5_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l5_t4_h0_rs97531", "instance": "stp_s050_l5_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l5_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l5_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s050_l5_t4_h2_rs97531", "instance": "stp_s050_l5_t4_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s050_l5_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s050_l5_t4_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l2_t4_h0_rs24098", "instance": "stp_s060_l2_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l2_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l2_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l2_t4_h1_rs123", "instance": "stp_s060_l2_t4_h1_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l2_t4_h1_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l2_t4_h1_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l2_t4_h1_rs24098", "instance": "stp_s060_l2_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l2_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l2_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l2_t5_h1_rs24098", "instance": "stp_s060_l2_t5_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l2_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l2_t5_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t3_h2_rs97531", "instance": "stp_s060_l3_t3_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t3_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t3_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t4_h0_rs123", "instance": "stp_s060_l3_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t4_h1_rs123", "instance": "stp_s060_l3_t4_h1_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s060_l3_t4_h1_rs123.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s060_l3_t4_h1_rs123.bst.sol", "source_path": "04-steiner/instances/stp_s060_l3_t4_h1_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t4_h1_rs123", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t4_h1_rs24098", "instance": "stp_s060_l3_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t4_h2_rs123", "instance": "stp_s060_l3_t4_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t4_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t4_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t4_h2_rs97531", "instance": "stp_s060_l3_t4_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t4_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t5_h0_rs24098", "instance": "stp_s060_l3_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t5_h0_rs97531", "instance": "stp_s060_l3_t5_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t5_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t5_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t5_h1_rs24098", "instance": "stp_s060_l3_t5_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t5_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t5_h2_rs24098", "instance": "stp_s060_l3_t5_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t5_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t5_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t5_h2_rs97531", "instance": "stp_s060_l3_t5_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t5_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t5_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l3_t6_h2_rs24098", "instance": "stp_s060_l3_t6_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l3_t6_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l3_t6_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t3_h0_rs24098", "instance": "stp_s060_l4_t3_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t3_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t3_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t3_h1_rs97531", "instance": "stp_s060_l4_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t3_h2_rs24098", "instance": "stp_s060_l4_t3_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t3_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t4_h0_rs123", "instance": "stp_s060_l4_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t4_h0_rs24098", "instance": "stp_s060_l4_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t4_h1_rs123", "instance": "stp_s060_l4_t4_h1_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t4_h1_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t4_h1_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t4_h1_rs24098", "instance": "stp_s060_l4_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l4_t5_h1_rs24098", "instance": "stp_s060_l4_t5_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l4_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l4_t5_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t3_h0_rs97531", "instance": "stp_s060_l5_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s060_l5_t3_h0_rs97531.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s060_l5_t3_h0_rs97531.opt.sol", "source_path": "04-steiner/instances/stp_s060_l5_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t3_h0_rs97531", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t3_h1_rs97531", "instance": "stp_s060_l5_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t4_h0_rs123", "instance": "stp_s060_l5_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t4_h1_rs123", "instance": "stp_s060_l5_t4_h1_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t4_h1_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t4_h1_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t4_h1_rs24098", "instance": "stp_s060_l5_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t5_h0_rs24098", "instance": "stp_s060_l5_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t5_h1_rs24098", "instance": "stp_s060_l5_t5_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t5_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s060_l5_t6_h2_rs37235", "instance": "stp_s060_l5_t6_h2_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s060_l5_t6_h2_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s060_l5_t6_h2_rs37235", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l2_t3_h0_rs97531", "instance": "stp_s070_l2_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l2_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l2_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l2_t4_h0_rs123", "instance": "stp_s070_l2_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l2_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l2_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l2_t6_h1_rs37235", "instance": "stp_s070_l2_t6_h1_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l2_t6_h1_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l2_t6_h1_rs37235", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l3_t4_h0_rs24098", "instance": "stp_s070_l3_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l3_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l3_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l3_t4_h2_rs24098", "instance": "stp_s070_l3_t4_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l3_t4_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l3_t4_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l3_t4_h2_rs97531", "instance": "stp_s070_l3_t4_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l3_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l3_t4_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l3_t5_h0_rs24098", "instance": "stp_s070_l3_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l3_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l3_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l3_t5_h2_rs24098", "instance": "stp_s070_l3_t5_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l3_t5_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l3_t5_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l4_t3_h0_rs97531", "instance": "stp_s070_l4_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l4_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l4_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l4_t4_h0_rs97531", "instance": "stp_s070_l4_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l4_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l4_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l4_t4_h1_rs24098", "instance": "stp_s070_l4_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l4_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l4_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l4_t4_h1_rs97531", "instance": "stp_s070_l4_t4_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l4_t4_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l4_t4_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l4_t4_h2_rs24098", "instance": "stp_s070_l4_t4_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l4_t4_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l4_t4_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l4_t6_h0_rs97531", "instance": "stp_s070_l4_t6_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "04-steiner/solutions/stp_s070_l4_t6_h0_rs97531.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions/stp_s070_l4_t6_h0_rs97531.bst.sol", "source_path": "04-steiner/instances/stp_s070_l4_t6_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l4_t6_h0_rs97531", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l5_t3_h0_rs97531", "instance": "stp_s070_l5_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l5_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l5_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l5_t4_h0_rs24098", "instance": "stp_s070_l5_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l5_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l5_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l5_t4_h1_rs24098", "instance": "stp_s070_l5_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l5_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l5_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l5_t4_h2_rs24098", "instance": "stp_s070_l5_t4_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l5_t4_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l5_t4_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l5_t5_h0_rs24098", "instance": "stp_s070_l5_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l5_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l5_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s070_l5_t5_h1_rs97531", "instance": "stp_s070_l5_t5_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s070_l5_t5_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s070_l5_t5_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l2_t4_h0_rs123", "instance": "stp_s080_l2_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l2_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l2_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l2_t4_h1_rs123", "instance": "stp_s080_l2_t4_h1_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l2_t4_h1_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l2_t4_h1_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l2_t4_h1_rs24098", "instance": "stp_s080_l2_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l2_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l2_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l2_t5_h0_rs24098", "instance": "stp_s080_l2_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l2_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l2_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l3_t3_h1_rs97531", "instance": "stp_s080_l3_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l3_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l3_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l3_t4_h0_rs123", "instance": "stp_s080_l3_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l3_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l3_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l3_t5_h0_rs24098", "instance": "stp_s080_l3_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l3_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l3_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l3_t5_h0_rs97531", "instance": "stp_s080_l3_t5_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l3_t5_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l3_t5_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t3_h0_rs24098", "instance": "stp_s080_l4_t3_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t3_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t3_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t3_h1_rs97531", "instance": "stp_s080_l4_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t4_h0_rs123", "instance": "stp_s080_l4_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t4_h0_rs24098", "instance": "stp_s080_l4_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t4_h0_rs97531", "instance": "stp_s080_l4_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t5_h0_rs24098", "instance": "stp_s080_l4_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l4_t5_h1_rs97531", "instance": "stp_s080_l4_t5_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l4_t5_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l4_t5_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l5_t4_h0_rs123", "instance": "stp_s080_l5_t4_h0_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l5_t4_h0_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l5_t4_h0_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s080_l5_t4_h0_rs24098", "instance": "stp_s080_l5_t4_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s080_l5_t4_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s080_l5_t4_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t3_h0_rs24098", "instance": "stp_s090_l2_t3_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t3_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t3_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t3_h1_rs123", "instance": "stp_s090_l2_t3_h1_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t3_h1_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t3_h1_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t3_h1_rs24098", "instance": "stp_s090_l2_t3_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t3_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t3_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t3_h1_rs97531", "instance": "stp_s090_l2_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t3_h2_rs24098", "instance": "stp_s090_l2_t3_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t3_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t3_h2_rs97531", "instance": "stp_s090_l2_t3_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t3_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t3_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l2_t5_h0_rs97531", "instance": "stp_s090_l2_t5_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l2_t5_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l2_t5_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t3_h0_rs97531", "instance": "stp_s090_l3_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t3_h1_rs97531", "instance": "stp_s090_l3_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t3_h2_rs123", "instance": "stp_s090_l3_t3_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t3_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t3_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t4_h0_rs97531", "instance": "stp_s090_l3_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t5_h0_rs24098", "instance": "stp_s090_l3_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t5_h0_rs97531", "instance": "stp_s090_l3_t5_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t5_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t5_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t5_h1_rs24098", "instance": "stp_s090_l3_t5_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t5_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t5_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l3_t6_h0_rs97531", "instance": "stp_s090_l3_t6_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l3_t6_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l3_t6_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t3_h0_rs24098", "instance": "stp_s090_l4_t3_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t3_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t3_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t3_h0_rs97531", "instance": "stp_s090_l4_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t3_h1_rs97531", "instance": "stp_s090_l4_t3_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t3_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t3_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t3_h2_rs123", "instance": "stp_s090_l4_t3_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t3_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t3_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t4_h0_rs97531", "instance": "stp_s090_l4_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t4_h1_rs97531", "instance": "stp_s090_l4_t4_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t4_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t4_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l4_t5_h0_rs24098", "instance": "stp_s090_l4_t5_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l4_t5_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l4_t5_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l5_t3_h0_rs97531", "instance": "stp_s090_l5_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l5_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l5_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l5_t4_h0_rs97531", "instance": "stp_s090_l5_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l5_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l5_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l5_t4_h1_rs97531", "instance": "stp_s090_l5_t4_h1_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l5_t4_h1_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l5_t4_h1_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s090_l5_t6_h0_rs37235", "instance": "stp_s090_l5_t6_h0_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s090_l5_t6_h0_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s090_l5_t6_h0_rs37235", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l2_t3_h0_rs97531", "instance": "stp_s100_l2_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l2_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l2_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l2_t3_h2_rs123", "instance": "stp_s100_l2_t3_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l2_t3_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l2_t3_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l2_t3_h3_rs24098", "instance": "stp_s100_l2_t3_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l2_t3_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l2_t3_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l2_t4_h0_rs97531", "instance": "stp_s100_l2_t4_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l2_t4_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l2_t4_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l2_t4_h3_rs24098", "instance": "stp_s100_l2_t4_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l2_t4_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l2_t4_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l2_t5_h0_rs97531", "instance": "stp_s100_l2_t5_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l2_t5_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l2_t5_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l3_t3_h1_rs24098", "instance": "stp_s100_l3_t3_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l3_t3_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l3_t3_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l3_t3_h2_rs24098", "instance": "stp_s100_l3_t3_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l3_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l3_t3_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l3_t3_h3_rs97531", "instance": "stp_s100_l3_t3_h3_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l3_t3_h3_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l3_t3_h3_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l3_t4_h1_rs24098", "instance": "stp_s100_l3_t4_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l3_t4_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l3_t4_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l3_t4_h3_rs24098", "instance": "stp_s100_l3_t4_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l3_t4_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l3_t4_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t3_h0_rs24098", "instance": "stp_s100_l4_t3_h0_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t3_h0_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t3_h0_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t3_h0_rs97531", "instance": "stp_s100_l4_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t3_h1_rs24098", "instance": "stp_s100_l4_t3_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t3_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t3_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t3_h2_rs123", "instance": "stp_s100_l4_t3_h2_rs123", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t3_h2_rs123", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t3_h2_rs123", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t3_h2_rs24098", "instance": "stp_s100_l4_t3_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t3_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t4_h3_rs24098", "instance": "stp_s100_l4_t4_h3_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t4_h3_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t4_h3_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l4_t6_h2_rs37235", "instance": "stp_s100_l4_t6_h2_rs37235", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l4_t6_h2_rs37235", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l4_t6_h2_rs37235", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l5_t3_h0_rs97531", "instance": "stp_s100_l5_t3_h0_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l5_t3_h0_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l5_t3_h0_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l5_t3_h1_rs24098", "instance": "stp_s100_l5_t3_h1_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l5_t3_h1_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l5_t3_h1_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l5_t3_h2_rs24098", "instance": "stp_s100_l5_t3_h2_rs24098", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l5_t3_h2_rs24098", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l5_t3_h2_rs24098", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l5_t3_h2_rs97531", "instance": "stp_s100_l5_t3_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l5_t3_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l5_t3_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "04-steiner:stp_s100_l5_t4_h2_rs97531", "instance": "stp_s100_l5_t4_h2_rs97531", "paper_context": "", "paper_metrics": [], "problem_dir": "04-steiner", "problem_number": "04", "problem_title": "Steiner Tree Packing", "problem_why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "04-steiner/instances/stp_s100_l5_t4_h2_rs97531", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances/stp_s100_l5_t4_h2_rs97531", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A routing benchmark for packing disjoint connection structures through constrained grid geometry." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_000_Medium", "instance": "Addition_000_Medium", "paper_context": "MIP, 3408 vars, density 0.00837, optimal yes; QUBO, 4667 vars, density 0.0723, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008372019", "feasible": "", "file": "Addition_000_Medium.lp", "formulation": "MIP", "num_constraints": "1162", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "1989.998995" }, { "coeff_range": "1360", "density": "0.072260079", "feasible": "yes", "file": "Addition_000_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4667", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_000_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_000_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_000_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_000_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_000_NoSoft", "instance": "Addition_000_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00278, optimal no; QUBO, 19099 vars, density 0.0291, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002775883", "feasible": "", "file": "Addition_000_NoSoft.lp", "formulation": "MIP", "num_constraints": "3020", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "6933.858954" }, { "coeff_range": "6760", "density": "0.029144334", "feasible": "yes", "file": "Addition_000_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "19099", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_000_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_000_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_000_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_000_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_000_Small", "instance": "Addition_000_Small", "paper_context": "MIP, 992 vars, density 0.027, optimal yes; QUBO, 1737 vars, density 0.123, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.027009947", "feasible": "", "file": "Addition_000_Small.lp", "formulation": "MIP", "num_constraints": "587", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "763.0884615" }, { "coeff_range": "585", "density": "0.123290358", "feasible": "yes", "file": "Addition_000_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1737", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_000_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_000_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_000_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_000_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_000_Tiny", "instance": "Addition_000_Tiny", "paper_context": "MIP, 408 vars, density 0.0535, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.053474484", "feasible": "", "file": "Addition_000_Tiny.lp", "formulation": "MIP", "num_constraints": "307", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "353.9152441" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_000_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_000_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_000_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_000_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_000_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_003_Medium", "instance": "Addition_003_Medium", "paper_context": "MIP, 3408 vars, density 0.00878, optimal yes; QUBO, 5118 vars, density 0.0603, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.00877516", "feasible": "", "file": "Addition_003_Medium.lp", "formulation": "MIP", "num_constraints": "1358", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2151.293564" }, { "coeff_range": "1620", "density": "0.060302587", "feasible": "yes", "file": "Addition_003_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5118", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_003_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_003_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_003_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_003_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_003_NoSoft", "instance": "Addition_003_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00468, optimal no; QUBO, 11077 vars, density 0.0363, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004679029", "feasible": "", "file": "Addition_003_NoSoft.lp", "formulation": "MIP", "num_constraints": "2376", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4394.556633" }, { "coeff_range": "4350", "density": "0.036334475", "feasible": "yes", "file": "Addition_003_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11077", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_003_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_003_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_003_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_003_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_003_Small", "instance": "Addition_003_Small", "paper_context": "MIP, 992 vars, density 0.0265, optimal yes; QUBO, 1880 vars, density 0.108, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.026492312", "feasible": "", "file": "Addition_003_Small.lp", "formulation": "MIP", "num_constraints": "642", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "798.0375931" }, { "coeff_range": "795", "density": "0.108115308", "feasible": "yes", "file": "Addition_003_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1880", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_003_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_003_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_003_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_003_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_003_Tiny", "instance": "Addition_003_Tiny", "paper_context": "MIP, 408 vars, density 0.0511, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.051147705", "feasible": "", "file": "Addition_003_Tiny.lp", "formulation": "MIP", "num_constraints": "334", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "369.1503759" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_003_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_003_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_003_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_003_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_003_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_005_Medium", "instance": "Addition_005_Medium", "paper_context": "MIP, 3408 vars, density 0.009, optimal yes; QUBO, 5604 vars, density 0.0557, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.009001054", "feasible": "", "file": "Addition_005_Medium.lp", "formulation": "MIP", "num_constraints": "1606", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2339.497382" }, { "coeff_range": "1620", "density": "0.055718325", "feasible": "yes", "file": "Addition_005_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5604", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_005_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_005_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_005_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_005_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_005_NoSoft", "instance": "Addition_005_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00376, optimal no; QUBO, 16481 vars, density 0.0275, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003755452", "feasible": "", "file": "Addition_005_NoSoft.lp", "formulation": "MIP", "num_constraints": "3584", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6445.597567" }, { "coeff_range": "4830", "density": "0.027465581", "feasible": "yes", "file": "Addition_005_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16481", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_005_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_005_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_005_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_005_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_005_Small", "instance": "Addition_005_Small", "paper_context": "MIP, 992 vars, density 0.026, optimal yes; QUBO, 2074 vars, density 0.0915, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.025991534", "feasible": "", "file": "Addition_005_Small.lp", "formulation": "MIP", "num_constraints": "744", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "859.0972006" }, { "coeff_range": "534", "density": "0.091531875", "feasible": "yes", "file": "Addition_005_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2074", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_005_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_005_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_005_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_005_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_005_Tiny", "instance": "Addition_005_Tiny", "paper_context": "MIP, 408 vars, density 0.0569, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.056943721", "feasible": "", "file": "Addition_005_Tiny.lp", "formulation": "MIP", "num_constraints": "339", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "371.9032132" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_005_Tiny.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_005_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_005_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_005_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_005_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_007_Medium", "instance": "Addition_007_Medium", "paper_context": "MIP, 3408 vars, density 0.00881, optimal yes; QUBO, 5666 vars, density 0.0549, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008806761", "feasible": "", "file": "Addition_007_Medium.lp", "formulation": "MIP", "num_constraints": "1711", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.764585" }, { "coeff_range": "1360", "density": "0.054879623", "feasible": "yes", "file": "Addition_007_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5666", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_007_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_007_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_007_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_007_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_007_NoSoft", "instance": "Addition_007_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00474, optimal no; QUBO, 12049 vars, density 0.033, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004743645", "feasible": "", "file": "Addition_007_NoSoft.lp", "formulation": "MIP", "num_constraints": "2937", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4885.891526" }, { "coeff_range": "4640", "density": "0.033002088", "feasible": "yes", "file": "Addition_007_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12049", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_007_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_007_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_007_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_007_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_007_Small", "instance": "Addition_007_Small", "paper_context": "MIP, 992 vars, density 0.0226, optimal yes; QUBO, 2098 vars, density 0.0907, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022632292", "feasible": "", "file": "Addition_007_Small.lp", "formulation": "MIP", "num_constraints": "851", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "918.7992164" }, { "coeff_range": "539", "density": "0.090694602", "feasible": "yes", "file": "Addition_007_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2098", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_007_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_007_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_007_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_007_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_007_Tiny", "instance": "Addition_007_Tiny", "paper_context": "MIP, 408 vars, density 0.0446, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.044563851", "feasible": "", "file": "Addition_007_Tiny.lp", "formulation": "MIP", "num_constraints": "390", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.8984833" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_007_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_007_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_007_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_007_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_007_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_015_Medium", "instance": "Addition_015_Medium", "paper_context": "MIP, 3408 vars, density 0.00873, optimal yes; QUBO, 5605 vars, density 0.0549, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008729998", "feasible": "", "file": "Addition_015_Medium.lp", "formulation": "MIP", "num_constraints": "1636", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2361.247128" }, { "coeff_range": "1170", "density": "0.054852724", "feasible": "yes", "file": "Addition_015_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5605", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_015_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_015_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_015_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_015_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_015_NoSoft", "instance": "Addition_015_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00474, optimal no; QUBO, 11995 vars, density 0.0322, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004744351", "feasible": "", "file": "Addition_015_NoSoft.lp", "formulation": "MIP", "num_constraints": "2859", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4820.575899" }, { "coeff_range": "4220", "density": "0.032197435", "feasible": "yes", "file": "Addition_015_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11995", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_015_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_015_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_015_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_015_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_015_Small", "instance": "Addition_015_Small", "paper_context": "MIP, 992 vars, density 0.0226, optimal yes; QUBO, 2082 vars, density 0.0846, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022586865", "feasible": "", "file": "Addition_015_Small.lp", "formulation": "MIP", "num_constraints": "778", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "878.5078258" }, { "coeff_range": "428", "density": "0.084628641", "feasible": "yes", "file": "Addition_015_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2082", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_015_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_015_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_015_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_015_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_015_Tiny", "instance": "Addition_015_Tiny", "paper_context": "MIP, 408 vars, density 0.048, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.04804337", "feasible": "", "file": "Addition_015_Tiny.lp", "formulation": "MIP", "num_constraints": "354", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "380.0421029" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_015_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_015_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_015_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_015_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_015_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_016_Medium", "instance": "Addition_016_Medium", "paper_context": "MIP, 3408 vars, density 0.00894, optimal yes; QUBO, 5586 vars, density 0.0552, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008942692", "feasible": "", "file": "Addition_016_Medium.lp", "formulation": "MIP", "num_constraints": "1609", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2341.681447" }, { "coeff_range": "1360", "density": "0.055183537", "feasible": "yes", "file": "Addition_016_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5586", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_016_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_016_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_016_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_016_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_016_NoSoft", "instance": "Addition_016_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00303, optimal no; QUBO, 21961 vars, density 0.0242, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003029911", "feasible": "", "file": "Addition_016_NoSoft.lp", "formulation": "MIP", "num_constraints": "4433", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8400.7952" }, { "coeff_range": "5980", "density": "0.024190858", "feasible": "yes", "file": "Addition_016_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "21961", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_016_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_016_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_016_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_016_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_016_Small", "instance": "Addition_016_Small", "paper_context": "MIP, 992 vars, density 0.0242, optimal yes; QUBO, 2063 vars, density 0.0892, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024182839", "feasible": "", "file": "Addition_016_Small.lp", "formulation": "MIP", "num_constraints": "753", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "864.2777331" }, { "coeff_range": "455", "density": "0.089227136", "feasible": "yes", "file": "Addition_016_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2063", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_016_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_016_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_016_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_016_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_016_Tiny", "instance": "Addition_016_Tiny", "paper_context": "MIP, 408 vars, density 0.0466, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.046568627", "feasible": "", "file": "Addition_016_Tiny.lp", "formulation": "MIP", "num_constraints": "342", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "373.545178" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_016_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_016_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_016_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_016_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_016_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_018_Medium", "instance": "Addition_018_Medium", "paper_context": "MIP, 3408 vars, density 0.00883, optimal yes; QUBO, 5655 vars, density 0.0563, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008827169", "feasible": "", "file": "Addition_018_Medium.lp", "formulation": "MIP", "num_constraints": "1711", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.764585" }, { "coeff_range": "1360", "density": "0.056269439", "feasible": "yes", "file": "Addition_018_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5655", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_018_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_018_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_018_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_018_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_018_NoSoft", "instance": "Addition_018_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00301, optimal no; QUBO, 22022 vars, density 0.0244, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003009225", "feasible": "", "file": "Addition_018_NoSoft.lp", "formulation": "MIP", "num_constraints": "4531", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8493.145471" }, { "coeff_range": "5980", "density": "0.024434858", "feasible": "yes", "file": "Addition_018_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22022", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_018_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_018_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_018_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_018_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_018_Small", "instance": "Addition_018_Small", "paper_context": "MIP, 992 vars, density 0.0246, optimal yes; QUBO, 2142 vars, density 0.0907, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024603408", "feasible": "", "file": "Addition_018_Small.lp", "formulation": "MIP", "num_constraints": "851", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "918.7992164" }, { "coeff_range": "663", "density": "0.090737742", "feasible": "yes", "file": "Addition_018_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2142", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_018_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_018_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_018_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_018_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_018_Tiny", "instance": "Addition_018_Tiny", "paper_context": "MIP, 408 vars, density 0.044, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.044029663", "feasible": "", "file": "Addition_018_Tiny.lp", "formulation": "MIP", "num_constraints": "390", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.8984833" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_018_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_018_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_018_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_018_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_018_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_020_Medium", "instance": "Addition_020_Medium", "paper_context": "MIP, 3408 vars, density 0.009, optimal yes; QUBO, 5682 vars, density 0.0573, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008997405", "feasible": "", "file": "Addition_020_Medium.lp", "formulation": "MIP", "num_constraints": "1710", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.058823" }, { "coeff_range": "1360", "density": "0.057303494", "feasible": "yes", "file": "Addition_020_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5682", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_020_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_020_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_020_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_020_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_020_NoSoft", "instance": "Addition_020_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00471, optimal no; QUBO, 12036 vars, density 0.0324, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004712437", "feasible": "", "file": "Addition_020_NoSoft.lp", "formulation": "MIP", "num_constraints": "2937", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4885.891526" }, { "coeff_range": "4220", "density": "0.032395144", "feasible": "yes", "file": "Addition_020_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12036", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_020_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_020_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_020_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_020_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_020_Small", "instance": "Addition_020_Small", "paper_context": "MIP, 992 vars, density 0.0238, optimal yes; QUBO, 2118 vars, density 0.091, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.023762367", "feasible": "", "file": "Addition_020_Small.lp", "formulation": "MIP", "num_constraints": "851", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "918.7992164" }, { "coeff_range": "795", "density": "0.090980432", "feasible": "yes", "file": "Addition_020_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2118", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_020_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_020_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_020_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_020_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_020_Tiny", "instance": "Addition_020_Tiny", "paper_context": "MIP, 408 vars, density 0.0456, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.045648722", "feasible": "", "file": "Addition_020_Tiny.lp", "formulation": "MIP", "num_constraints": "389", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.3867468" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_020_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_020_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_020_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_020_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_020_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_024_Medium", "instance": "Addition_024_Medium", "paper_context": "MIP, 3408 vars, density 0.00823, optimal no; QUBO, 4648 vars, density 0.0663, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008225116", "feasible": "", "file": "Addition_024_Medium.lp", "formulation": "MIP", "num_constraints": "1154", "num_vars": "3408", "obj_value": "feasible", "optimal": "no", "problem_size": "1983.136909" }, { "coeff_range": "1460", "density": "0.066265245", "feasible": "yes", "file": "Addition_024_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4648", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_024_Medium.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_024_Medium.xml.gz", "source_path": "05-sports/instances/Medium/Addition_024_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_024_Medium.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_024_NoSoft", "instance": "Addition_024_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00343, optimal no; QUBO, 14196 vars, density 0.0333, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003430554", "feasible": "", "file": "Addition_024_NoSoft.lp", "formulation": "MIP", "num_constraints": "2459", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "5338.981925" }, { "coeff_range": "5020", "density": "0.033341925", "feasible": "yes", "file": "Addition_024_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "14196", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_024_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_024_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_024_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_024_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_024_Small", "instance": "Addition_024_Small", "paper_context": "MIP, 992 vars, density 0.0246, optimal yes; QUBO, 1695 vars, density 0.124, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024618178", "feasible": "", "file": "Addition_024_Small.lp", "formulation": "MIP", "num_constraints": "584", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "761.1359931" }, { "coeff_range": "795", "density": "0.124337675", "feasible": "yes", "file": "Addition_024_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1695", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_024_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_024_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_024_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_024_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_024_Tiny", "instance": "Addition_024_Tiny", "paper_context": "MIP, 408 vars, density 0.0533, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.053318869", "feasible": "", "file": "Addition_024_Tiny.lp", "formulation": "MIP", "num_constraints": "305", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "352.760542" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_024_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_024_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_024_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_024_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_024_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_025_Medium", "instance": "Addition_025_Medium", "paper_context": "MIP, 3408 vars, density 0.00847, optimal no; QUBO, 4622 vars, density 0.0705, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008470005", "feasible": "", "file": "Addition_025_Medium.lp", "formulation": "MIP", "num_constraints": "1125", "num_vars": "3408", "obj_value": "feasible", "optimal": "no", "problem_size": "1958.060265" }, { "coeff_range": "1460", "density": "0.070492831", "feasible": "yes", "file": "Addition_025_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4622", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_025_Medium.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_025_Medium.xml.gz", "source_path": "05-sports/instances/Medium/Addition_025_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_025_Medium.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_025_NoSoft", "instance": "Addition_025_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00452, optimal no; QUBO, 10186 vars, density 0.0417, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004522854", "feasible": "", "file": "Addition_025_NoSoft.lp", "formulation": "MIP", "num_constraints": "1935", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "3965.813914" }, { "coeff_range": "4220", "density": "0.04166404", "feasible": "yes", "file": "Addition_025_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "10186", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_025_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_025_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_025_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_025_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_025_Small", "instance": "Addition_025_Small", "paper_context": "MIP, 992 vars, density 0.0248, optimal yes; QUBO, 1660 vars, density 0.13, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024842501", "feasible": "", "file": "Addition_025_Small.lp", "formulation": "MIP", "num_constraints": "553", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "740.6591659" }, { "coeff_range": "403", "density": "0.130436013", "feasible": "yes", "file": "Addition_025_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1660", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_025_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_025_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_025_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_025_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_025_Tiny", "instance": "Addition_025_Tiny", "paper_context": "MIP, 408 vars, density 0.0534, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.053355308", "feasible": "", "file": "Addition_025_Tiny.lp", "formulation": "MIP", "num_constraints": "290", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "343.9767434" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_025_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_025_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_025_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_025_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_025_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_027_Medium", "instance": "Addition_027_Medium", "paper_context": "MIP, 3408 vars, density 0.00871, optimal no; QUBO, 5115 vars, density 0.0598, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008709356", "feasible": "", "file": "Addition_027_Medium.lp", "formulation": "MIP", "num_constraints": "1372", "num_vars": "3408", "obj_value": "feasible", "optimal": "no", "problem_size": "2162.354273" }, { "coeff_range": "1620", "density": "0.059841549", "feasible": "yes", "file": "Addition_027_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5115", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_027_Medium.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_027_Medium.xml.gz", "source_path": "05-sports/instances/Medium/Addition_027_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_027_Medium.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_027_NoSoft", "instance": "Addition_027_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00363, optimal no; QUBO, 15321 vars, density 0.0301, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003633139", "feasible": "", "file": "Addition_027_NoSoft.lp", "formulation": "MIP", "num_constraints": "3017", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "5913.802837" }, { "coeff_range": "4830", "density": "0.030112551", "feasible": "yes", "file": "Addition_027_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15321", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_027_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_027_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_027_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_027_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_027_Small", "instance": "Addition_027_Small", "paper_context": "MIP, 992 vars, density 0.0256, optimal yes; QUBO, 1882 vars, density 0.106, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.02564998", "feasible": "", "file": "Addition_027_Small.lp", "formulation": "MIP", "num_constraints": "661", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "809.7604584" }, { "coeff_range": "663", "density": "0.106488335", "feasible": "yes", "file": "Addition_027_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1882", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_027_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_027_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_027_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_027_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_027_Tiny", "instance": "Addition_027_Tiny", "paper_context": "MIP, 408 vars, density 0.0528, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.052792546", "feasible": "", "file": "Addition_027_Tiny.lp", "formulation": "MIP", "num_constraints": "343", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "374.090898" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_027_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_027_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_027_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_027_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_027_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_028_Medium", "instance": "Addition_028_Medium", "paper_context": "MIP, 3408 vars, density 0.00872, optimal yes; QUBO, 5631 vars, density 0.0547, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008724735", "feasible": "", "file": "Addition_028_Medium.lp", "formulation": "MIP", "num_constraints": "1661", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2379.22004" }, { "coeff_range": "1460", "density": "0.054726852", "feasible": "yes", "file": "Addition_028_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5631", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_028_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_028_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_028_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_028_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_028_NoSoft", "instance": "Addition_028_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00301, optimal no; QUBO, 22020 vars, density 0.0243, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003011224", "feasible": "", "file": "Addition_028_NoSoft.lp", "formulation": "MIP", "num_constraints": "4485", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8449.923077" }, { "coeff_range": "6300", "density": "0.024267006", "feasible": "yes", "file": "Addition_028_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22020", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_028_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_028_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_028_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_028_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_028_Small", "instance": "Addition_028_Small", "paper_context": "MIP, 992 vars, density 0.0235, optimal yes; QUBO, 2086 vars, density 0.0896, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023450698", "feasible": "", "file": "Addition_028_Small.lp", "formulation": "MIP", "num_constraints": "802", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "891.9551558" }, { "coeff_range": "507", "density": "0.089570601", "feasible": "yes", "file": "Addition_028_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2086", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_028_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_028_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_028_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_028_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_028_Tiny", "instance": "Addition_028_Tiny", "paper_context": "MIP, 408 vars, density 0.0503, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.050312065", "feasible": "", "file": "Addition_028_Tiny.lp", "formulation": "MIP", "num_constraints": "366", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "386.4298125" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_028_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_028_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_028_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_028_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_028_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_029_Medium", "instance": "Addition_029_Medium", "paper_context": "MIP, 3408 vars, density 0.00858, optimal yes; QUBO, 5597 vars, density 0.0517, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008579954", "feasible": "", "file": "Addition_029_Medium.lp", "formulation": "MIP", "num_constraints": "1655", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2374.918946" }, { "coeff_range": "1620", "density": "0.051727744", "feasible": "yes", "file": "Addition_029_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5597", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_029_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_029_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_029_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_029_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_029_NoSoft", "instance": "Addition_029_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00301, optimal no; QUBO, 21999 vars, density 0.0242, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00301248", "feasible": "", "file": "Addition_029_NoSoft.lp", "formulation": "MIP", "num_constraints": "4478", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8443.326359" }, { "coeff_range": "6300", "density": "0.02419081", "feasible": "yes", "file": "Addition_029_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "21999", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_029_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_029_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_029_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_029_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_029_Small", "instance": "Addition_029_Small", "paper_context": "MIP, 992 vars, density 0.0223, optimal yes; QUBO, 2058 vars, density 0.0908, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022320165", "feasible": "", "file": "Addition_029_Small.lp", "formulation": "MIP", "num_constraints": "798", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "889.7280483" }, { "coeff_range": "539", "density": "0.090791052", "feasible": "yes", "file": "Addition_029_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2058", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_029_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_029_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_029_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_029_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_029_Tiny", "instance": "Addition_029_Tiny", "paper_context": "MIP, 408 vars, density 0.0497, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.049715065", "feasible": "", "file": "Addition_029_Tiny.lp", "formulation": "MIP", "num_constraints": "363", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "384.8428251" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_029_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_029_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_029_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_029_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_029_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_030_Medium", "instance": "Addition_030_Medium", "paper_context": "MIP, 3408 vars, density 0.00898, optimal yes; QUBO, 5645 vars, density 0.0592, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008975677", "feasible": "", "file": "Addition_030_Medium.lp", "formulation": "MIP", "num_constraints": "1689", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2399.189863" }, { "coeff_range": "1360", "density": "0.05918441", "feasible": "yes", "file": "Addition_030_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5645", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_030_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_030_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_030_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_030_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_030_NoSoft", "instance": "Addition_030_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00371, optimal no; QUBO, 16503 vars, density 0.0275, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003710419", "feasible": "", "file": "Addition_030_NoSoft.lp", "formulation": "MIP", "num_constraints": "3667", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6519.805519" }, { "coeff_range": "5220", "density": "0.027453101", "feasible": "yes", "file": "Addition_030_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16503", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_030_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_030_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_030_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_030_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_030_Small", "instance": "Addition_030_Small", "paper_context": "MIP, 992 vars, density 0.0239, optimal yes; QUBO, 2101 vars, density 0.0913, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023897558", "feasible": "", "file": "Addition_030_Small.lp", "formulation": "MIP", "num_constraints": "831", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "907.9383239" }, { "coeff_range": "795", "density": "0.091279084", "feasible": "yes", "file": "Addition_030_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2101", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_030_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_030_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_030_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_030_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_030_Tiny", "instance": "Addition_030_Tiny", "paper_context": "MIP, 408 vars, density 0.0431, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.043082932", "feasible": "", "file": "Addition_030_Tiny.lp", "formulation": "MIP", "num_constraints": "379", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "393.2327555" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_030_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_030_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_030_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_030_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_030_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_032_Medium", "instance": "Addition_032_Medium", "paper_context": "MIP, 3408 vars, density 0.00859, optimal yes; QUBO, 5643 vars, density 0.0519, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008586562", "feasible": "", "file": "Addition_032_Medium.lp", "formulation": "MIP", "num_constraints": "1711", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.764585" }, { "coeff_range": "1360", "density": "0.051862452", "feasible": "yes", "file": "Addition_032_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5643", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_032_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_032_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_032_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_032_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_032_NoSoft", "instance": "Addition_032_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00475, optimal no; QUBO, 12038 vars, density 0.0335, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004749384", "feasible": "", "file": "Addition_032_NoSoft.lp", "formulation": "MIP", "num_constraints": "2937", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4885.891526" }, { "coeff_range": "4350", "density": "0.033465157", "feasible": "yes", "file": "Addition_032_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12038", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_032_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_032_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_032_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_032_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_032_Small", "instance": "Addition_032_Small", "paper_context": "MIP, 992 vars, density 0.0228, optimal yes; QUBO, 2108 vars, density 0.0894, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022826641", "feasible": "", "file": "Addition_032_Small.lp", "formulation": "MIP", "num_constraints": "854", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "920.4172967" }, { "coeff_range": "663", "density": "0.089436885", "feasible": "yes", "file": "Addition_032_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2108", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_032_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_032_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_032_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_032_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_032_Tiny", "instance": "Addition_032_Tiny", "paper_context": "MIP, 408 vars, density 0.0484, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.04838649", "feasible": "", "file": "Addition_032_Tiny.lp", "formulation": "MIP", "num_constraints": "391", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.4095642" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_032_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_032_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_032_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_032_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_032_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_034_Medium", "instance": "Addition_034_Medium", "paper_context": "MIP, 3408 vars, density 0.00869, optimal yes; QUBO, 5651 vars, density 0.0545, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008685412", "feasible": "", "file": "Addition_034_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2415.470141" }, { "coeff_range": "1460", "density": "0.054480021", "feasible": "yes", "file": "Addition_034_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5651", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_034_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_034_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_034_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_034_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_034_NoSoft", "instance": "Addition_034_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00371, optimal no; QUBO, 16524 vars, density 0.0275, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003710273", "feasible": "", "file": "Addition_034_NoSoft.lp", "formulation": "MIP", "num_constraints": "3689", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6539.333911" }, { "coeff_range": "5220", "density": "0.027538361", "feasible": "yes", "file": "Addition_034_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16524", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_034_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_034_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_034_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_034_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_034_Small", "instance": "Addition_034_Small", "paper_context": "MIP, 992 vars, density 0.0244, optimal yes; QUBO, 2134 vars, density 0.0898, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024380052", "feasible": "", "file": "Addition_034_Small.lp", "formulation": "MIP", "num_constraints": "854", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "920.4172967" }, { "coeff_range": "557", "density": "0.089777419", "feasible": "yes", "file": "Addition_034_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2134", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_034_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_034_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_034_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_034_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_034_Tiny", "instance": "Addition_034_Tiny", "paper_context": "MIP, 408 vars, density 0.0471, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.047068828", "feasible": "", "file": "Addition_034_Tiny.lp", "formulation": "MIP", "num_constraints": "392", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.919992" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_034_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_034_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_034_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_034_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_034_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_035_Medium", "instance": "Addition_035_Medium", "paper_context": "MIP, 3408 vars, density 0.0086, optimal yes; QUBO, 5650 vars, density 0.0519, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008604171", "feasible": "", "file": "Addition_035_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2415.470141" }, { "coeff_range": "1460", "density": "0.051850859", "feasible": "yes", "file": "Addition_035_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5650", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_035_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_035_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_035_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_035_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_035_NoSoft", "instance": "Addition_035_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00475, optimal no; QUBO, 12032 vars, density 0.0334, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004745614", "feasible": "", "file": "Addition_035_NoSoft.lp", "formulation": "MIP", "num_constraints": "2937", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4885.891526" }, { "coeff_range": "4350", "density": "0.033434885", "feasible": "yes", "file": "Addition_035_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12032", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_035_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_035_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_035_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_035_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_035_Small", "instance": "Addition_035_Small", "paper_context": "MIP, 992 vars, density 0.0227, optimal yes; QUBO, 2104 vars, density 0.0881, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022667829", "feasible": "", "file": "Addition_035_Small.lp", "formulation": "MIP", "num_constraints": "851", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "918.7992164" }, { "coeff_range": "465", "density": "0.088077906", "feasible": "yes", "file": "Addition_035_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2104", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_035_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_035_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_035_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_035_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_035_Tiny", "instance": "Addition_035_Tiny", "paper_context": "MIP, 408 vars, density 0.0477, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.047687825", "feasible": "", "file": "Addition_035_Tiny.lp", "formulation": "MIP", "num_constraints": "392", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.919992" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_035_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_035_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_035_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_035_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_035_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_043_Medium", "instance": "Addition_043_Medium", "paper_context": "MIP, 3408 vars, density 0.00868, optimal yes; QUBO, 5592 vars, density 0.0514, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008683447", "feasible": "", "file": "Addition_043_Medium.lp", "formulation": "MIP", "num_constraints": "1615", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2346.043478" }, { "coeff_range": "1460", "density": "0.051399064", "feasible": "yes", "file": "Addition_043_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5592", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_043_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_043_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_043_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_043_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_043_NoSoft", "instance": "Addition_043_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00475, optimal no; QUBO, 11990 vars, density 0.0324, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00474631", "feasible": "", "file": "Addition_043_NoSoft.lp", "formulation": "MIP", "num_constraints": "2846", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4809.603726" }, { "coeff_range": "4220", "density": "0.032351717", "feasible": "yes", "file": "Addition_043_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11990", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_043_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_043_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_043_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_043_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_043_Small", "instance": "Addition_043_Small", "paper_context": "MIP, 992 vars, density 0.0227, optimal yes; QUBO, 2047 vars, density 0.0888, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022723399", "feasible": "", "file": "Addition_043_Small.lp", "formulation": "MIP", "num_constraints": "757", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "866.570251" }, { "coeff_range": "431", "density": "0.088762709", "feasible": "yes", "file": "Addition_043_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2047", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_043_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_043_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_043_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_043_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_043_Tiny", "instance": "Addition_043_Tiny", "paper_context": "MIP, 408 vars, density 0.0522, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.052181936", "feasible": "", "file": "Addition_043_Tiny.lp", "formulation": "MIP", "num_constraints": "348", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "376.8076432" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_043_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_043_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_043_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_043_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_043_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_044_Medium", "instance": "Addition_044_Medium", "paper_context": "MIP, 3408 vars, density 0.00845, optimal yes; QUBO, 5651 vars, density 0.0496, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008450808", "feasible": "", "file": "Addition_044_Medium.lp", "formulation": "MIP", "num_constraints": "1693", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2402.029142" }, { "coeff_range": "1460", "density": "0.049573862", "feasible": "yes", "file": "Addition_044_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5651", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_044_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_044_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_044_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_044_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_044_NoSoft", "instance": "Addition_044_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00472, optimal no; QUBO, 12032 vars, density 0.033, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004720242", "feasible": "", "file": "Addition_044_NoSoft.lp", "formulation": "MIP", "num_constraints": "2917", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4869.227454" }, { "coeff_range": "4100", "density": "0.032976621", "feasible": "yes", "file": "Addition_044_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12032", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_044_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_044_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_044_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_044_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_044_Small", "instance": "Addition_044_Small", "paper_context": "MIP, 992 vars, density 0.0227, optimal yes; QUBO, 2101 vars, density 0.0879, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022689318", "feasible": "", "file": "Addition_044_Small.lp", "formulation": "MIP", "num_constraints": "833", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "909.0302525" }, { "coeff_range": "539", "density": "0.087874425", "feasible": "yes", "file": "Addition_044_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2101", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_044_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_044_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_044_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_044_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_044_Tiny", "instance": "Addition_044_Tiny", "paper_context": "MIP, 408 vars, density 0.0493, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.049295504", "feasible": "", "file": "Addition_044_Tiny.lp", "formulation": "MIP", "num_constraints": "382", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "394.786018" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_044_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_044_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_044_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_044_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_044_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_046_Medium", "instance": "Addition_046_Medium", "paper_context": "MIP, 3408 vars, density 0.00887, optimal yes; QUBO, 5572 vars, density 0.053, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008868064", "feasible": "", "file": "Addition_046_Medium.lp", "formulation": "MIP", "num_constraints": "1592", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2329.278" }, { "coeff_range": "1260", "density": "0.053028981", "feasible": "yes", "file": "Addition_046_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5572", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_046_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_046_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_046_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_046_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_046_NoSoft", "instance": "Addition_046_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00479, optimal no; QUBO, 11955 vars, density 0.0322, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004791592", "feasible": "", "file": "Addition_046_NoSoft.lp", "formulation": "MIP", "num_constraints": "2818", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4785.885916" }, { "coeff_range": "4350", "density": "0.032216888", "feasible": "yes", "file": "Addition_046_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11955", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_046_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_046_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_046_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_046_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_046_Small", "instance": "Addition_046_Small", "paper_context": "MIP, 992 vars, density 0.0242, optimal yes; QUBO, 2025 vars, density 0.0901, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024232003", "feasible": "", "file": "Addition_046_Small.lp", "formulation": "MIP", "num_constraints": "734", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "853.3041662" }, { "coeff_range": "663", "density": "0.090132475", "feasible": "yes", "file": "Addition_046_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2025", "obj_value": "feasible\tyes", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_046_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_046_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_046_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_046_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_046_Tiny", "instance": "Addition_046_Tiny", "paper_context": "MIP, 408 vars, density 0.0515, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.051463206", "feasible": "", "file": "Addition_046_Tiny.lp", "formulation": "MIP", "num_constraints": "332", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "368.0434757" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_046_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_046_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_046_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_046_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_046_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_047_Medium", "instance": "Addition_047_Medium", "paper_context": "MIP, 3408 vars, density 0.00889, optimal yes; QUBO, 5560 vars, density 0.051, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008887552", "feasible": "", "file": "Addition_047_Medium.lp", "formulation": "MIP", "num_constraints": "1586", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2324.884513" }, { "coeff_range": "1360", "density": "0.05101387", "feasible": "yes", "file": "Addition_047_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5560", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_047_Medium.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_047_Medium.xml.gz", "source_path": "05-sports/instances/Medium/Addition_047_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_047_Medium.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_047_NoSoft", "instance": "Addition_047_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00379, optimal no; QUBO, 16449 vars, density 0.0275, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003785649", "feasible": "", "file": "Addition_047_NoSoft.lp", "formulation": "MIP", "num_constraints": "3563", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6426.686238" }, { "coeff_range": "5220", "density": "0.02750399", "feasible": "yes", "file": "Addition_047_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16449", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_047_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_047_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_047_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_047_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_047_Small", "instance": "Addition_047_Small", "paper_context": "MIP, 992 vars, density 0.025, optimal yes; QUBO, 2025 vars, density 0.0945, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.025017447", "feasible": "", "file": "Addition_047_Small.lp", "formulation": "MIP", "num_constraints": "728", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "849.8093904" }, { "coeff_range": "795", "density": "0.094541333", "feasible": "yes", "file": "Addition_047_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2025", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_047_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_047_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_047_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_047_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_047_Tiny", "instance": "Addition_047_Tiny", "paper_context": "MIP, 408 vars, density 0.0529, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.052938197", "feasible": "", "file": "Addition_047_Tiny.lp", "formulation": "MIP", "num_constraints": "329", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "366.3768552" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_047_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_047_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_047_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_047_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_047_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_048_Medium", "instance": "Addition_048_Medium", "paper_context": "MIP, 3408 vars, density 0.00872, optimal no; QUBO, 5661 vars, density 0.0531, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008722947", "feasible": "", "file": "Addition_048_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "no", "problem_size": "2415.470141" }, { "coeff_range": "1260", "density": "0.053096253", "feasible": "yes", "file": "Addition_048_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5661", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_048_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_048_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_048_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_048_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_048_NoSoft", "instance": "Addition_048_NoSoft", "paper_context": "MIP, 8128 vars, density 0.0047, optimal no; QUBO, 12015 vars, density 0.0327, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004695255", "feasible": "", "file": "Addition_048_NoSoft.lp", "formulation": "MIP", "num_constraints": "2938", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4886.723238" }, { "coeff_range": "4350", "density": "0.032687877", "feasible": "yes", "file": "Addition_048_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12015", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_048_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_048_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_048_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_048_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_048_Small", "instance": "Addition_048_Small", "paper_context": "MIP, 992 vars, density 0.0244, optimal yes; QUBO, 2123 vars, density 0.0916, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024447335", "feasible": "", "file": "Addition_048_Small.lp", "formulation": "MIP", "num_constraints": "854", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "920.4172967" }, { "coeff_range": "609", "density": "0.091612534", "feasible": "yes", "file": "Addition_048_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2123", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_048_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_048_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_048_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_048_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_048_Tiny", "instance": "Addition_048_Tiny", "paper_context": "MIP, 408 vars, density 0.0459, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.045877325", "feasible": "", "file": "Addition_048_Tiny.lp", "formulation": "MIP", "num_constraints": "390", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.8984833" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_048_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_048_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_048_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_048_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_048_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_050_Medium", "instance": "Addition_050_Medium", "paper_context": "MIP, 3408 vars, density 0.00884, optimal yes; QUBO, 5655 vars, density 0.0563, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008837096", "feasible": "", "file": "Addition_050_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2415.470141" }, { "coeff_range": "1460", "density": "0.056341473", "feasible": "yes", "file": "Addition_050_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5655", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_050_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_050_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_050_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_050_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_050_NoSoft", "instance": "Addition_050_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00301, optimal no; QUBO, 22012 vars, density 0.0244, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003009545", "feasible": "", "file": "Addition_050_NoSoft.lp", "formulation": "MIP", "num_constraints": "4532", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8494.082646" }, { "coeff_range": "6760", "density": "0.024359877", "feasible": "yes", "file": "Addition_050_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22012", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_050_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_050_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_050_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_050_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_050_Small", "instance": "Addition_050_Small", "paper_context": "MIP, 992 vars, density 0.023, optimal yes; QUBO, 2105 vars, density 0.0889, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023018656", "feasible": "", "file": "Addition_050_Small.lp", "formulation": "MIP", "num_constraints": "852", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.3388929" }, { "coeff_range": "566", "density": "0.088908288", "feasible": "yes", "file": "Addition_050_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2105", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_050_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_050_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_050_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_050_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_050_Tiny", "instance": "Addition_050_Tiny", "paper_context": "MIP, 408 vars, density 0.0492, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.049219179", "feasible": "", "file": "Addition_050_Tiny.lp", "formulation": "MIP", "num_constraints": "393", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "400.4297691" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_050_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_050_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_050_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_050_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_050_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_052_Medium", "instance": "Addition_052_Medium", "paper_context": "MIP, 3408 vars, density 0.00884, optimal yes; QUBO, 5656 vars, density 0.0556, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008835248", "feasible": "", "file": "Addition_052_Medium.lp", "formulation": "MIP", "num_constraints": "1710", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.058823" }, { "coeff_range": "1460", "density": "0.055635781", "feasible": "yes", "file": "Addition_052_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5656", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_052_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_052_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_052_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_052_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_052_NoSoft", "instance": "Addition_052_NoSoft", "paper_context": "MIP, 8128 vars, density 0.0047, optimal no; QUBO, 12020 vars, density 0.0326, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004700616", "feasible": "", "file": "Addition_052_NoSoft.lp", "formulation": "MIP", "num_constraints": "2938", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4886.723238" }, { "coeff_range": "4220", "density": "0.032583024", "feasible": "yes", "file": "Addition_052_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12020", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_052_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_052_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_052_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_052_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_052_Small", "instance": "Addition_052_Small", "paper_context": "MIP, 992 vars, density 0.0234, optimal yes; QUBO, 2115 vars, density 0.0917, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023399638", "feasible": "", "file": "Addition_052_Small.lp", "formulation": "MIP", "num_constraints": "852", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.3388929" }, { "coeff_range": "539", "density": "0.091685101", "feasible": "yes", "file": "Addition_052_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2115", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_052_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_052_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_052_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_052_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_052_Tiny", "instance": "Addition_052_Tiny", "paper_context": "MIP, 408 vars, density 0.0485, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.048504274", "feasible": "", "file": "Addition_052_Tiny.lp", "formulation": "MIP", "num_constraints": "390", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.8984833" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_052_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_052_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_052_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_052_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_052_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_064_Medium", "instance": "Addition_064_Medium", "paper_context": "MIP, 3408 vars, density 0.00883, optimal yes; QUBO, 5564 vars, density 0.0503, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008825758", "feasible": "", "file": "Addition_064_Medium.lp", "formulation": "MIP", "num_constraints": "1586", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2324.884513" }, { "coeff_range": "1360", "density": "0.050322798", "feasible": "yes", "file": "Addition_064_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5564", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_064_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_064_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_064_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_064_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_064_NoSoft", "instance": "Addition_064_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00378, optimal no; QUBO, 16449 vars, density 0.0277, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003784366", "feasible": "", "file": "Addition_064_NoSoft.lp", "formulation": "MIP", "num_constraints": "3563", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6426.686238" }, { "coeff_range": "5220", "density": "0.02773177", "feasible": "yes", "file": "Addition_064_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16449", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_064_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_064_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_064_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_064_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_064_Small", "instance": "Addition_064_Small", "paper_context": "MIP, 992 vars, density 0.0271, optimal yes; QUBO, 2055 vars, density 0.0932, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.027096941", "feasible": "", "file": "Addition_064_Small.lp", "formulation": "MIP", "num_constraints": "726", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "848.641267" }, { "coeff_range": "588", "density": "0.093241785", "feasible": "yes", "file": "Addition_064_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2055", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_064_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_064_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_064_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_064_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_064_Tiny", "instance": "Addition_064_Tiny", "paper_context": "MIP, 408 vars, density 0.053, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.052957616", "feasible": "", "file": "Addition_064_Tiny.lp", "formulation": "MIP", "num_constraints": "328", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "365.8196277" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_064_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_064_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_064_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_064_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_064_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_066_Medium", "instance": "Addition_066_Medium", "paper_context": "MIP, 3408 vars, density 0.0086, optimal yes; QUBO, 5691 vars, density 0.0526, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008601096", "feasible": "", "file": "Addition_066_Medium.lp", "formulation": "MIP", "num_constraints": "1731", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2428.836759" }, { "coeff_range": "1460", "density": "0.052593368", "feasible": "yes", "file": "Addition_066_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5691", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_066_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_066_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_066_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_066_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_066_NoSoft", "instance": "Addition_066_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00368, optimal no; QUBO, 16529 vars, density 0.0276, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003680963", "feasible": "", "file": "Addition_066_NoSoft.lp", "formulation": "MIP", "num_constraints": "3706", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6554.384182" }, { "coeff_range": "5020", "density": "0.02757134", "feasible": "yes", "file": "Addition_066_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16529", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_066_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_066_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_066_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_066_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_066_Small", "instance": "Addition_066_Small", "paper_context": "MIP, 992 vars, density 0.0221, optimal yes; QUBO, 2119 vars, density 0.0876, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022074414", "feasible": "", "file": "Addition_066_Small.lp", "formulation": "MIP", "num_constraints": "871", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "929.5332162" }, { "coeff_range": "539", "density": "0.08763078", "feasible": "yes", "file": "Addition_066_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2119", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_066_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_066_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_066_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_066_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_066_Tiny", "instance": "Addition_066_Tiny", "paper_context": "MIP, 408 vars, density 0.0458, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.045794959", "feasible": "", "file": "Addition_066_Tiny.lp", "formulation": "MIP", "num_constraints": "396", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "401.9552214" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_066_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_066_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_066_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_066_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_066_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_067_Medium", "instance": "Addition_067_Medium", "paper_context": "MIP, 3408 vars, density 0.00863, optimal yes; QUBO, 5607 vars, density 0.0493, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.00863414", "feasible": "", "file": "Addition_067_Medium.lp", "formulation": "MIP", "num_constraints": "1670", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2385.657142" }, { "coeff_range": "1360", "density": "0.049281556", "feasible": "yes", "file": "Addition_067_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5607", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_067_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_067_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_067_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_067_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_067_NoSoft", "instance": "Addition_067_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00376, optimal no; QUBO, 16500 vars, density 0.0279, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003760207", "feasible": "", "file": "Addition_067_NoSoft.lp", "formulation": "MIP", "num_constraints": "3646", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6501.110059" }, { "coeff_range": "5220", "density": "0.027895955", "feasible": "yes", "file": "Addition_067_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16500", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_067_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_067_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_067_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_067_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_067_Small", "instance": "Addition_067_Small", "paper_context": "MIP, 992 vars, density 0.024, optimal yes; QUBO, 2066 vars, density 0.0933, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023986225", "feasible": "", "file": "Addition_067_Small.lp", "formulation": "MIP", "num_constraints": "812", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "897.4987465" }, { "coeff_range": "518", "density": "0.09331771", "feasible": "yes", "file": "Addition_067_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2066", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_067_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_067_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_067_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_067_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_067_Tiny", "instance": "Addition_067_Tiny", "paper_context": "MIP, 408 vars, density 0.0509, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.050919284", "feasible": "", "file": "Addition_067_Tiny.lp", "formulation": "MIP", "num_constraints": "369", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "388.0103091" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_067_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_067_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_067_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_067_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_067_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_068_Medium", "instance": "Addition_068_Medium", "paper_context": "MIP, 3408 vars, density 0.0088, optimal yes; QUBO, 5657 vars, density 0.0554, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008799728", "feasible": "", "file": "Addition_068_Medium.lp", "formulation": "MIP", "num_constraints": "1710", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.058823" }, { "coeff_range": "1460", "density": "0.055416535", "feasible": "yes", "file": "Addition_068_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5657", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_068_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_068_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_068_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_068_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_068_NoSoft", "instance": "Addition_068_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00374, optimal no; QUBO, 16556 vars, density 0.0281, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003741328", "feasible": "", "file": "Addition_068_NoSoft.lp", "formulation": "MIP", "num_constraints": "3689", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6539.333911" }, { "coeff_range": "4830", "density": "0.028084732", "feasible": "yes", "file": "Addition_068_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16556", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_068_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_068_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_068_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_068_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_068_Small", "instance": "Addition_068_Small", "paper_context": "MIP, 992 vars, density 0.0226, optimal yes; QUBO, 2095 vars, density 0.0899, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.0226394", "feasible": "", "file": "Addition_068_Small.lp", "formulation": "MIP", "num_constraints": "851", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "918.7992164" }, { "coeff_range": "663", "density": "0.089901437", "feasible": "yes", "file": "Addition_068_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2095", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_068_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_068_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_068_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_068_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_068_Tiny", "instance": "Addition_068_Tiny", "paper_context": "MIP, 408 vars, density 0.049, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.048982093", "feasible": "", "file": "Addition_068_Tiny.lp", "formulation": "MIP", "num_constraints": "392", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.919992" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_068_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_068_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_068_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_068_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_068_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_069_Medium", "instance": "Addition_069_Medium", "paper_context": "MIP, 3408 vars, density 0.0087, optimal yes; QUBO, 5646 vars, density 0.0537, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008695742", "feasible": "", "file": "Addition_069_Medium.lp", "formulation": "MIP", "num_constraints": "1710", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.058823" }, { "coeff_range": "1460", "density": "0.053716716", "feasible": "yes", "file": "Addition_069_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5646", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_069_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_069_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_069_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_069_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_069_NoSoft", "instance": "Addition_069_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00469, optimal no; QUBO, 12015 vars, density 0.0321, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004685631", "feasible": "", "file": "Addition_069_NoSoft.lp", "formulation": "MIP", "num_constraints": "2936", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4885.059672" }, { "coeff_range": "4220", "density": "0.032098636", "feasible": "yes", "file": "Addition_069_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12015", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_069_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_069_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_069_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_069_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_069_Small", "instance": "Addition_069_Small", "paper_context": "MIP, 992 vars, density 0.0238, optimal yes; QUBO, 2120 vars, density 0.0904, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023822467", "feasible": "", "file": "Addition_069_Small.lp", "formulation": "MIP", "num_constraints": "853", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.8782528" }, { "coeff_range": "539", "density": "0.090417478", "feasible": "yes", "file": "Addition_069_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2120", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_069_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_069_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_069_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_069_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_069_Tiny", "instance": "Addition_069_Tiny", "paper_context": "MIP, 408 vars, density 0.0467, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.04668146", "feasible": "", "file": "Addition_069_Tiny.lp", "formulation": "MIP", "num_constraints": "391", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.4095642" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_069_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_069_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_069_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_069_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_069_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_070_Medium", "instance": "Addition_070_Medium", "paper_context": "MIP, 3408 vars, density 0.00874, optimal yes; QUBO, 5664 vars, density 0.0531, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008741286", "feasible": "", "file": "Addition_070_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2415.470141" }, { "coeff_range": "1460", "density": "0.053140069", "feasible": "yes", "file": "Addition_070_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5664", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_070_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_070_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_070_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_070_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_070_NoSoft", "instance": "Addition_070_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00469, optimal no; QUBO, 12034 vars, density 0.0317, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004691193", "feasible": "", "file": "Addition_070_NoSoft.lp", "formulation": "MIP", "num_constraints": "2938", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4886.723238" }, { "coeff_range": "4480", "density": "0.031730993", "feasible": "yes", "file": "Addition_070_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12034", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_070_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_070_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_070_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_070_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_070_Small", "instance": "Addition_070_Small", "paper_context": "MIP, 992 vars, density 0.0232, optimal yes; QUBO, 2108 vars, density 0.0881, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.02319612", "feasible": "", "file": "Addition_070_Small.lp", "formulation": "MIP", "num_constraints": "853", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.8782528" }, { "coeff_range": "539", "density": "0.088087288", "feasible": "yes", "file": "Addition_070_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2108", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_070_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_070_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_070_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_070_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_070_Tiny", "instance": "Addition_070_Tiny", "paper_context": "MIP, 408 vars, density 0.0465, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.046531016", "feasible": "", "file": "Addition_070_Tiny.lp", "formulation": "MIP", "num_constraints": "391", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.4095642" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_070_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_070_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_070_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_070_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_070_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_082_Medium", "instance": "Addition_082_Medium", "paper_context": "MIP, 3408 vars, density 0.00901, optimal yes; QUBO, 5551 vars, density 0.0517, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.009005381", "feasible": "", "file": "Addition_082_Medium.lp", "formulation": "MIP", "num_constraints": "1563", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2307.965338" }, { "coeff_range": "1460", "density": "0.051732377", "feasible": "yes", "file": "Addition_082_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5551", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_082_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_082_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_082_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_082_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_082_NoSoft", "instance": "Addition_082_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00381, optimal no; QUBO, 16434 vars, density 0.0278, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003812317", "feasible": "", "file": "Addition_082_NoSoft.lp", "formulation": "MIP", "num_constraints": "3540", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6405.909771" }, { "coeff_range": "5220", "density": "0.027847978", "feasible": "yes", "file": "Addition_082_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16434", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_082_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_082_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_082_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_082_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_082_Small", "instance": "Addition_082_Small", "paper_context": "MIP, 992 vars, density 0.0279, optimal yes; QUBO, 2036 vars, density 0.0943, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.027852608", "feasible": "", "file": "Addition_082_Small.lp", "formulation": "MIP", "num_constraints": "705", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "836.2774659" }, { "coeff_range": "896", "density": "0.094334864", "feasible": "yes", "file": "Addition_082_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2036", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_082_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_082_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_082_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_082_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_082_Tiny", "instance": "Addition_082_Tiny", "paper_context": "MIP, 408 vars, density 0.0574, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.057371381", "feasible": "", "file": "Addition_082_Tiny.lp", "formulation": "MIP", "num_constraints": "319", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "360.765852" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_082_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_082_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_082_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_082_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_082_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_083_Medium", "instance": "Addition_083_Medium", "paper_context": "MIP, 3408 vars, density 0.00871, optimal yes; QUBO, 5587 vars, density 0.0506, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008709331", "feasible": "", "file": "Addition_083_Medium.lp", "formulation": "MIP", "num_constraints": "1629", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2356.190145" }, { "coeff_range": "1460", "density": "0.050599107", "feasible": "yes", "file": "Addition_083_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5587", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_083_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_083_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_083_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_083_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_083_NoSoft", "instance": "Addition_083_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00375, optimal no; QUBO, 16477 vars, density 0.0272, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003746436", "feasible": "", "file": "Addition_083_NoSoft.lp", "formulation": "MIP", "num_constraints": "3604", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6463.556916" }, { "coeff_range": "5220", "density": "0.027220582", "feasible": "yes", "file": "Addition_083_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16477", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_083_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_083_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_083_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_083_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_083_Small", "instance": "Addition_083_Small", "paper_context": "MIP, 992 vars, density 0.0233, optimal yes; QUBO, 2038 vars, density 0.0902, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.02330331", "feasible": "", "file": "Addition_083_Small.lp", "formulation": "MIP", "num_constraints": "770", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "873.9794048" }, { "coeff_range": "663", "density": "0.090247533", "feasible": "yes", "file": "Addition_083_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2038", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_083_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_083_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_083_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_083_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_083_Tiny", "instance": "Addition_083_Tiny", "paper_context": "MIP, 408 vars, density 0.0459, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.045884308", "feasible": "", "file": "Addition_083_Tiny.lp", "formulation": "MIP", "num_constraints": "351", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "378.4283287" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_083_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_083_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_083_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_083_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_083_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_085_Medium", "instance": "Addition_085_Medium", "paper_context": "MIP, 3408 vars, density 0.00885, optimal yes; QUBO, 5591 vars, density 0.0522, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008849888", "feasible": "", "file": "Addition_085_Medium.lp", "formulation": "MIP", "num_constraints": "1627", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2354.743298" }, { "coeff_range": "1360", "density": "0.052176641", "feasible": "yes", "file": "Addition_085_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5591", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_085_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_085_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_085_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_085_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_085_NoSoft", "instance": "Addition_085_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00482, optimal no; QUBO, 11977 vars, density 0.0329, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00481785", "feasible": "", "file": "Addition_085_NoSoft.lp", "formulation": "MIP", "num_constraints": "2853", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4815.514926" }, { "coeff_range": "4350", "density": "0.032927362", "feasible": "yes", "file": "Addition_085_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11977", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_085_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_085_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_085_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_085_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_085_Small", "instance": "Addition_085_Small", "paper_context": "MIP, 992 vars, density 0.0254, optimal yes; QUBO, 2068 vars, density 0.0934, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.025424752", "feasible": "", "file": "Addition_085_Small.lp", "formulation": "MIP", "num_constraints": "768", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "872.8436286" }, { "coeff_range": "578", "density": "0.093370591", "feasible": "yes", "file": "Addition_085_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2068", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_085_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_085_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_085_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_085_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_085_Tiny", "instance": "Addition_085_Tiny", "paper_context": "MIP, 408 vars, density 0.0495, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.049460784", "feasible": "", "file": "Addition_085_Tiny.lp", "formulation": "MIP", "num_constraints": "350", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "377.8888726" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_085_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_085_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_085_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_085_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_085_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_090_Medium", "instance": "Addition_090_Medium", "paper_context": "MIP, 3408 vars, density 0.00893, optimal yes; QUBO, 5605 vars, density 0.0561, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.00892543", "feasible": "", "file": "Addition_090_Medium.lp", "formulation": "MIP", "num_constraints": "1668", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2384.228177" }, { "coeff_range": "1360", "density": "0.056053171", "feasible": "yes", "file": "Addition_090_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5605", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_090_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_090_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_090_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_090_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_090_NoSoft", "instance": "Addition_090_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00304, optimal no; QUBO, 21978 vars, density 0.0246, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003044495", "feasible": "", "file": "Addition_090_NoSoft.lp", "formulation": "MIP", "num_constraints": "4488", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8452.748665" }, { "coeff_range": "5600", "density": "0.024644165", "feasible": "yes", "file": "Addition_090_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "21978", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_090_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_090_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_090_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_090_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_090_Small", "instance": "Addition_090_Small", "paper_context": "MIP, 992 vars, density 0.0237, optimal yes; QUBO, 2061 vars, density 0.0931, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023743031", "feasible": "", "file": "Addition_090_Small.lp", "formulation": "MIP", "num_constraints": "810", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "896.3927711" }, { "coeff_range": "440", "density": "0.093131365", "feasible": "yes", "file": "Addition_090_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2061", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_090_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_090_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_090_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_090_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_090_Tiny", "instance": "Addition_090_Tiny", "paper_context": "MIP, 408 vars, density 0.0483, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.048279689", "feasible": "", "file": "Addition_090_Tiny.lp", "formulation": "MIP", "num_constraints": "371", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "389.0604066" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_090_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_090_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_090_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_090_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_090_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_100_Medium", "instance": "Addition_100_Medium", "paper_context": "MIP, 3408 vars, density 0.00858, optimal yes; QUBO, 5113 vars, density 0.058, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008582535", "feasible": "", "file": "Addition_100_Medium.lp", "formulation": "MIP", "num_constraints": "1388", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2174.926206" }, { "coeff_range": "1360", "density": "0.058045849", "feasible": "yes", "file": "Addition_100_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5113", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_100_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_100_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_100_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_100_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_100_NoSoft", "instance": "Addition_100_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00363, optimal no; QUBO, 15351 vars, density 0.03, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00363101", "feasible": "", "file": "Addition_100_NoSoft.lp", "formulation": "MIP", "num_constraints": "3033", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "5929.463382" }, { "coeff_range": "5220", "density": "0.030023819", "feasible": "yes", "file": "Addition_100_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15351", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_100_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_100_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_100_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_100_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_100_Small", "instance": "Addition_100_Small", "paper_context": "MIP, 992 vars, density 0.0239, optimal yes; QUBO, 1894 vars, density 0.103, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023884745", "feasible": "", "file": "Addition_100_Small.lp", "formulation": "MIP", "num_constraints": "679", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "820.7118861" }, { "coeff_range": "663", "density": "0.103423392", "feasible": "yes", "file": "Addition_100_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1894", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_100_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_100_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_100_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_100_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_100_Tiny", "instance": "Addition_100_Tiny", "paper_context": "MIP, 408 vars, density 0.0539, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.053872409", "feasible": "", "file": "Addition_100_Tiny.lp", "formulation": "MIP", "num_constraints": "349", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "377.3486452" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_100_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_100_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_100_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_100_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_100_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_104_Medium", "instance": "Addition_104_Medium", "paper_context": "MIP, 3408 vars, density 0.00876, optimal yes; QUBO, 5168 vars, density 0.0632, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.00876415", "feasible": "", "file": "Addition_104_Medium.lp", "formulation": "MIP", "num_constraints": "1457", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2228.330317" }, { "coeff_range": "1260", "density": "0.063203655", "feasible": "yes", "file": "Addition_104_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5168", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_104_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_104_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_104_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_104_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_104_NoSoft", "instance": "Addition_104_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00461, optimal no; QUBO, 11134 vars, density 0.0361, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004605113", "feasible": "", "file": "Addition_104_NoSoft.lp", "formulation": "MIP", "num_constraints": "2477", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4486.987408" }, { "coeff_range": "4350", "density": "0.036125287", "feasible": "yes", "file": "Addition_104_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11134", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_104_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_104_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_104_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_104_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_104_Small", "instance": "Addition_104_Small", "paper_context": "MIP, 992 vars, density 0.025, optimal yes; QUBO, 1926 vars, density 0.105, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.025018943", "feasible": "", "file": "Addition_104_Small.lp", "formulation": "MIP", "num_constraints": "745", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "859.674357" }, { "coeff_range": "589", "density": "0.105346713", "feasible": "yes", "file": "Addition_104_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1926", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_104_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_104_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_104_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_104_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_104_Tiny", "instance": "Addition_104_Tiny", "paper_context": "MIP, 408 vars, density 0.0493, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.049306086", "feasible": "", "file": "Addition_104_Tiny.lp", "formulation": "MIP", "num_constraints": "385", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "396.3331932" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_104_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_104_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_104_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_104_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_104_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_105_Medium", "instance": "Addition_105_Medium", "paper_context": "MIP, 3408 vars, density 0.00846, optimal no; QUBO, 5560 vars, density 0.0489, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008460366", "feasible": "", "file": "Addition_105_Medium.lp", "formulation": "MIP", "num_constraints": "1640", "num_vars": "3408", "obj_value": "feasible", "optimal": "no", "problem_size": "2364.131976" }, { "coeff_range": "1360", "density": "0.048915236", "feasible": "yes", "file": "Addition_105_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5560", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_105_Medium.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_105_Medium.xml.gz", "source_path": "05-sports/instances/Medium/Addition_105_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_105_Medium.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_105_NoSoft", "instance": "Addition_105_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00468, optimal no; QUBO, 11950 vars, density 0.0312, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004681378", "feasible": "", "file": "Addition_105_NoSoft.lp", "formulation": "MIP", "num_constraints": "2866", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4826.473661" }, { "coeff_range": "4350", "density": "0.031222135", "feasible": "yes", "file": "Addition_105_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11950", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_105_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_105_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_105_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_105_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_105_Small", "instance": "Addition_105_Small", "paper_context": "MIP, 992 vars, density 0.0207, optimal yes; QUBO, 1992 vars, density 0.0899, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.020673712", "feasible": "", "file": "Addition_105_Small.lp", "formulation": "MIP", "num_constraints": "781", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "880.1999773" }, { "coeff_range": "663", "density": "0.089854652", "feasible": "yes", "file": "Addition_105_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1992", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_105_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_105_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_105_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_105_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_105_Tiny", "instance": "Addition_105_Tiny", "paper_context": "MIP, 408 vars, density 0.0396, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.039629936", "feasible": "", "file": "Addition_105_Tiny.lp", "formulation": "MIP", "num_constraints": "355", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "380.578507" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_105_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_105_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_105_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_105_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_105_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_107_Medium", "instance": "Addition_107_Medium", "paper_context": "MIP, 3408 vars, density 0.00843, optimal yes; QUBO, 5572 vars, density 0.0485, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008426759", "feasible": "", "file": "Addition_107_Medium.lp", "formulation": "MIP", "num_constraints": "1669", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2384.942767" }, { "coeff_range": "1460", "density": "0.048507192", "feasible": "yes", "file": "Addition_107_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5572", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_107_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_107_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_107_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_107_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_107_NoSoft", "instance": "Addition_107_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00472, optimal no; QUBO, 11984 vars, density 0.032, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004719634", "feasible": "", "file": "Addition_107_NoSoft.lp", "formulation": "MIP", "num_constraints": "2896", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4851.668579" }, { "coeff_range": "4480", "density": "0.031965469", "feasible": "yes", "file": "Addition_107_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11984", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_107_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_107_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_107_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_107_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_107_Small", "instance": "Addition_107_Small", "paper_context": "MIP, 992 vars, density 0.0227, optimal yes; QUBO, 2036 vars, density 0.0897, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.0226889", "feasible": "", "file": "Addition_107_Small.lp", "formulation": "MIP", "num_constraints": "812", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "897.4987465" }, { "coeff_range": "496", "density": "0.089720331", "feasible": "yes", "file": "Addition_107_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2036", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_107_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_107_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_107_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_107_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_107_Tiny", "instance": "Addition_107_Tiny", "paper_context": "MIP, 408 vars, density 0.0414, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.041369378", "feasible": "", "file": "Addition_107_Tiny.lp", "formulation": "MIP", "num_constraints": "371", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "389.0604066" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_107_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_107_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_107_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_107_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_107_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_109_Medium", "instance": "Addition_109_Medium", "paper_context": "MIP, 3408 vars, density 0.00875, optimal yes; QUBO, 5592 vars, density 0.0531, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008748635", "feasible": "", "file": "Addition_109_Medium.lp", "formulation": "MIP", "num_constraints": "1668", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2384.228177" }, { "coeff_range": "1620", "density": "0.053147622", "feasible": "yes", "file": "Addition_109_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5592", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_109_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_109_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_109_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_109_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_109_NoSoft", "instance": "Addition_109_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00476, optimal no; QUBO, 11981 vars, density 0.0323, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004758734", "feasible": "", "file": "Addition_109_NoSoft.lp", "formulation": "MIP", "num_constraints": "2894", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4849.99299" }, { "coeff_range": "4350", "density": "0.032296226", "feasible": "yes", "file": "Addition_109_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11981", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_109_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_109_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_109_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_109_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_109_Small", "instance": "Addition_109_Small", "paper_context": "MIP, 992 vars, density 0.0234, optimal yes; QUBO, 2048 vars, density 0.0934, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023364695", "feasible": "", "file": "Addition_109_Small.lp", "formulation": "MIP", "num_constraints": "810", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "896.3927711" }, { "coeff_range": "539", "density": "0.093356801", "feasible": "yes", "file": "Addition_109_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2048", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_109_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_109_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_109_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_109_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_109_Tiny", "instance": "Addition_109_Tiny", "paper_context": "MIP, 408 vars, density 0.046, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.046020295", "feasible": "", "file": "Addition_109_Tiny.lp", "formulation": "MIP", "num_constraints": "371", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "389.0604066" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_109_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_109_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_109_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_109_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_109_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_110_Medium", "instance": "Addition_110_Medium", "paper_context": "MIP, 3408 vars, density 0.00897, optimal yes; QUBO, 5604 vars, density 0.0568, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008970113", "feasible": "", "file": "Addition_110_Medium.lp", "formulation": "MIP", "num_constraints": "1668", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2384.228177" }, { "coeff_range": "1620", "density": "0.05682592", "feasible": "yes", "file": "Addition_110_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5604", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_110_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_110_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_110_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_110_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_110_NoSoft", "instance": "Addition_110_NoSoft", "paper_context": "MIP, 8128 vars, density 0.0048, optimal no; QUBO, 11992 vars, density 0.0333, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004797038", "feasible": "", "file": "Addition_110_NoSoft.lp", "formulation": "MIP", "num_constraints": "2894", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4849.99299" }, { "coeff_range": "4350", "density": "0.033289975", "feasible": "yes", "file": "Addition_110_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11992", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_110_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_110_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_110_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_110_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_110_Small", "instance": "Addition_110_Small", "paper_context": "MIP, 992 vars, density 0.0239, optimal yes; QUBO, 2057 vars, density 0.0933, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023877439", "feasible": "", "file": "Addition_110_Small.lp", "formulation": "MIP", "num_constraints": "810", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "896.3927711" }, { "coeff_range": "539", "density": "0.093258082", "feasible": "yes", "file": "Addition_110_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2057", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_110_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_110_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_110_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_110_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_110_Tiny", "instance": "Addition_110_Tiny", "paper_context": "MIP, 408 vars, density 0.0495, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.049521695", "feasible": "", "file": "Addition_110_Tiny.lp", "formulation": "MIP", "num_constraints": "371", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "389.0604066" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_110_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_110_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_110_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_110_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_110_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_111_Medium", "instance": "Addition_111_Medium", "paper_context": "MIP, 3408 vars, density 0.00866, optimal yes; QUBO, 5658 vars, density 0.0521, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.00865936", "feasible": "", "file": "Addition_111_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2415.470141" }, { "coeff_range": "1620", "density": "0.052142719", "feasible": "yes", "file": "Addition_111_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5658", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_111_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_111_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_111_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_111_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_111_NoSoft", "instance": "Addition_111_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00302, optimal no; QUBO, 22037 vars, density 0.0245, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003020065", "feasible": "", "file": "Addition_111_NoSoft.lp", "formulation": "MIP", "num_constraints": "4532", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8494.082646" }, { "coeff_range": "6300", "density": "0.024481037", "feasible": "yes", "file": "Addition_111_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22037", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_111_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_111_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_111_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_111_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_111_Small", "instance": "Addition_111_Small", "paper_context": "MIP, 992 vars, density 0.023, optimal yes; QUBO, 2104 vars, density 0.0914, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022994034", "feasible": "", "file": "Addition_111_Small.lp", "formulation": "MIP", "num_constraints": "853", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.8782528" }, { "coeff_range": "663", "density": "0.091364035", "feasible": "yes", "file": "Addition_111_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2104", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_111_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_111_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_111_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_111_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_111_Tiny", "instance": "Addition_111_Tiny", "paper_context": "MIP, 408 vars, density 0.0471, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.047056323", "feasible": "", "file": "Addition_111_Tiny.lp", "formulation": "MIP", "num_constraints": "392", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.919992" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_111_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_111_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_111_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_111_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_111_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_128_Medium", "instance": "Addition_128_Medium", "paper_context": "MIP, 3408 vars, density 0.00865, optimal no; QUBO, 5655 vars, density 0.0515, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008652659", "feasible": "", "file": "Addition_128_Medium.lp", "formulation": "MIP", "num_constraints": "1704", "num_vars": "3408", "obj_value": "feasible", "optimal": "no", "problem_size": "2409.81991" }, { "coeff_range": "1460", "density": "0.051454071", "feasible": "yes", "file": "Addition_128_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5655", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_128_Medium.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_128_Medium.xml.gz", "source_path": "05-sports/instances/Medium/Addition_128_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_128_Medium.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_128_NoSoft", "instance": "Addition_128_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00473, optimal no; QUBO, 12024 vars, density 0.0325, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004727517", "feasible": "", "file": "Addition_128_NoSoft.lp", "formulation": "MIP", "num_constraints": "2930", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4880.065573" }, { "coeff_range": "4220", "density": "0.032478743", "feasible": "yes", "file": "Addition_128_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12024", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_128_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_128_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_128_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_128_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_128_Small", "instance": "Addition_128_Small", "paper_context": "MIP, 992 vars, density 0.0246, optimal yes; QUBO, 2123 vars, density 0.0903, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024628985", "feasible": "", "file": "Addition_128_Small.lp", "formulation": "MIP", "num_constraints": "845", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "915.5544768" }, { "coeff_range": "795", "density": "0.090251332", "feasible": "yes", "file": "Addition_128_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2123", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_128_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_128_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_128_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_128_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_128_Tiny", "instance": "Addition_128_Tiny", "paper_context": "MIP, 408 vars, density 0.0446, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.044559834", "feasible": "", "file": "Addition_128_Tiny.lp", "formulation": "MIP", "num_constraints": "388", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "397.874352" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_128_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_128_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_128_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_128_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_128_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_129_Medium", "instance": "Addition_129_Medium", "paper_context": "MIP, 3408 vars, density 0.00873, optimal yes; QUBO, 5652 vars, density 0.0535, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008734905", "feasible": "", "file": "Addition_129_Medium.lp", "formulation": "MIP", "num_constraints": "1711", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.764585" }, { "coeff_range": "1460", "density": "0.053498953", "feasible": "yes", "file": "Addition_129_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5652", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_129_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_129_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_129_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_129_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_129_NoSoft", "instance": "Addition_129_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00473, optimal no; QUBO, 12032 vars, density 0.0327, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004731623", "feasible": "", "file": "Addition_129_NoSoft.lp", "formulation": "MIP", "num_constraints": "2937", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4885.891526" }, { "coeff_range": "4100", "density": "0.032696377", "feasible": "yes", "file": "Addition_129_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12032", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_129_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_129_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_129_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_129_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_129_Small", "instance": "Addition_129_Small", "paper_context": "MIP, 992 vars, density 0.0243, optimal yes; QUBO, 2128 vars, density 0.0887, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024260989", "feasible": "", "file": "Addition_129_Small.lp", "formulation": "MIP", "num_constraints": "852", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.3388929" }, { "coeff_range": "590", "density": "0.088680043", "feasible": "yes", "file": "Addition_129_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2128", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_129_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_129_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_129_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_129_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_129_Tiny", "instance": "Addition_129_Tiny", "paper_context": "MIP, 408 vars, density 0.0507, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.050682773", "feasible": "", "file": "Addition_129_Tiny.lp", "formulation": "MIP", "num_constraints": "392", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "399.919992" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_129_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_129_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_129_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_129_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_129_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_130_Medium", "instance": "Addition_130_Medium", "paper_context": "MIP, 3408 vars, density 0.00905, optimal yes; QUBO, 5612 vars, density 0.0578, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.009052441", "feasible": "", "file": "Addition_130_Medium.lp", "formulation": "MIP", "num_constraints": "1668", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2384.228177" }, { "coeff_range": "1360", "density": "0.057753682", "feasible": "yes", "file": "Addition_130_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5612", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_130_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_130_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_130_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_130_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_130_NoSoft", "instance": "Addition_130_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00303, optimal no; QUBO, 21969 vars, density 0.0245, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00303474", "feasible": "", "file": "Addition_130_NoSoft.lp", "formulation": "MIP", "num_constraints": "4488", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8452.748665" }, { "coeff_range": "6760", "density": "0.024535098", "feasible": "yes", "file": "Addition_130_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "21969", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_130_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_130_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_130_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_130_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_130_Small", "instance": "Addition_130_Small", "paper_context": "MIP, 992 vars, density 0.0231, optimal yes; QUBO, 2044 vars, density 0.0915, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023078455", "feasible": "", "file": "Addition_130_Small.lp", "formulation": "MIP", "num_constraints": "810", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "896.3927711" }, { "coeff_range": "444", "density": "0.091452591", "feasible": "yes", "file": "Addition_130_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2044", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_130_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_130_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_130_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_130_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_130_Tiny", "instance": "Addition_130_Tiny", "paper_context": "MIP, 408 vars, density 0.0451, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.045068971", "feasible": "", "file": "Addition_130_Tiny.lp", "formulation": "MIP", "num_constraints": "371", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "389.0604066" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_130_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_130_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_130_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_130_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_130_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_132_Medium", "instance": "Addition_132_Medium", "paper_context": "MIP, 3408 vars, density 0.00878, optimal yes; QUBO, 5659 vars, density 0.0557, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008778136", "feasible": "", "file": "Addition_132_Medium.lp", "formulation": "MIP", "num_constraints": "1712", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2415.470141" }, { "coeff_range": "1460", "density": "0.055725112", "feasible": "yes", "file": "Addition_132_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5659", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_132_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_132_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_132_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_132_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_132_NoSoft", "instance": "Addition_132_NoSoft", "paper_context": "MIP, 8128 vars, density 0.0047, optimal no; QUBO, 12035 vars, density 0.032, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004696637", "feasible": "", "file": "Addition_132_NoSoft.lp", "formulation": "MIP", "num_constraints": "2938", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4886.723238" }, { "coeff_range": "4350", "density": "0.03196218", "feasible": "yes", "file": "Addition_132_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12035", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_132_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_132_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_132_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_132_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_132_Small", "instance": "Addition_132_Small", "paper_context": "MIP, 992 vars, density 0.0242, optimal yes; QUBO, 2130 vars, density 0.0902, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024201831", "feasible": "", "file": "Addition_132_Small.lp", "formulation": "MIP", "num_constraints": "852", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.3388929" }, { "coeff_range": "574", "density": "0.090181382", "feasible": "yes", "file": "Addition_132_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2130", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_132_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_132_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_132_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_132_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_132_Tiny", "instance": "Addition_132_Tiny", "paper_context": "MIP, 408 vars, density 0.0509, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.050879839", "feasible": "", "file": "Addition_132_Tiny.lp", "formulation": "MIP", "num_constraints": "390", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.8984833" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_132_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_132_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_132_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_132_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_132_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_133_Medium", "instance": "Addition_133_Medium", "paper_context": "MIP, 3408 vars, density 0.0088, optimal yes; QUBO, 5661 vars, density 0.0541, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008801445", "feasible": "", "file": "Addition_133_Medium.lp", "formulation": "MIP", "num_constraints": "1711", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.764585" }, { "coeff_range": "1460", "density": "0.054097545", "feasible": "yes", "file": "Addition_133_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5661", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_133_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_133_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_133_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_133_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_133_NoSoft", "instance": "Addition_133_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00373, optimal no; QUBO, 16536 vars, density 0.0278, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003729922", "feasible": "", "file": "Addition_133_NoSoft.lp", "formulation": "MIP", "num_constraints": "3688", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6538.447522" }, { "coeff_range": "5410", "density": "0.027802501", "feasible": "yes", "file": "Addition_133_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16536", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_133_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_133_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_133_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_133_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_133_Small", "instance": "Addition_133_Small", "paper_context": "MIP, 992 vars, density 0.0236, optimal yes; QUBO, 2117 vars, density 0.0904, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.02360906", "feasible": "", "file": "Addition_133_Small.lp", "formulation": "MIP", "num_constraints": "852", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.3388929" }, { "coeff_range": "553", "density": "0.090361626", "feasible": "yes", "file": "Addition_133_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2117", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_133_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_133_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_133_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_133_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_133_Tiny", "instance": "Addition_133_Tiny", "paper_context": "MIP, 408 vars, density 0.0445, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.044513575", "feasible": "", "file": "Addition_133_Tiny.lp", "formulation": "MIP", "num_constraints": "390", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "398.8984833" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_133_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_133_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_133_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_133_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_133_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Addition_152_Medium", "instance": "Addition_152_Medium", "paper_context": "MIP, 3408 vars, density 0.00898, optimal yes; QUBO, 5613 vars, density 0.0572, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008982251", "feasible": "", "file": "Addition_152_Medium.lp", "formulation": "MIP", "num_constraints": "1668", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2384.228177" }, { "coeff_range": "1460", "density": "0.057152619", "feasible": "yes", "file": "Addition_152_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5613", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Addition_152_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Addition_152_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Addition_152_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Addition_152_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Addition_152_NoSoft", "instance": "Addition_152_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00482, optimal no; QUBO, 12000 vars, density 0.0333, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004815616", "feasible": "", "file": "Addition_152_NoSoft.lp", "formulation": "MIP", "num_constraints": "2894", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4849.99299" }, { "coeff_range": "4350", "density": "0.033311946", "feasible": "yes", "file": "Addition_152_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12000", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Addition_152_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Addition_152_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Addition_152_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Addition_152_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Addition_152_Small", "instance": "Addition_152_Small", "paper_context": "MIP, 992 vars, density 0.0241, optimal yes; QUBO, 2062 vars, density 0.0944, feasible yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024089008", "feasible": "", "file": "Addition_152_Small.lp", "formulation": "MIP", "num_constraints": "810", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "896.3927711" }, { "coeff_range": "438", "density": "0.094362217", "feasible": "yes", "file": "Addition_152_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2062", "obj_value": "", "optimal": "", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Addition_152_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Addition_152_Small.opt.sol", "source_path": "05-sports/instances/Small/Addition_152_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Addition_152_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Addition_152_Tiny", "instance": "Addition_152_Tiny", "paper_context": "MIP, 408 vars, density 0.046, optimal yes; QUBO, n/a vars, optimal n/a", "paper_metrics": [ { "coeff_range": "2", "density": "0.046007082", "feasible": "", "file": "Addition_152_Tiny.lp", "formulation": "MIP", "num_constraints": "371", "num_vars": "408", "obj_value": "feasible", "optimal": "yes", "problem_size": "389.0604066" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "yes", "file": "Addition_152_Tiny.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "n/a", "optimal": "n/a", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Addition_152_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Addition_152_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Addition_152_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Addition_152_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Early_005_Medium", "instance": "Early_005_Medium", "paper_context": "MIP, 3408 vars, density 0.00861, optimal yes; QUBO, 5624 vars, density 0.0516, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008607839", "feasible": "", "file": "Early_005_Medium.lp", "formulation": "MIP", "num_constraints": "1681", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2393.501201" }, { "coeff_range": "1460", "density": "0.051602782", "feasible": "yes", "file": "Early_005_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5624", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Early_005_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Early_005_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Early_005_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Early_005_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Early_005_NoSoft", "instance": "Early_005_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00375, optimal no; QUBO, 16509 vars, density 0.028, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003745604", "feasible": "", "file": "Early_005_NoSoft.lp", "formulation": "MIP", "num_constraints": "3656", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6510.019355" }, { "coeff_range": "5410", "density": "0.028026142", "feasible": "yes", "file": "Early_005_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16509", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Early_005_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Early_005_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Early_005_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Early_005_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Early_005_Small", "instance": "Early_005_Small", "paper_context": "MIP, 992 vars, density 0.023, optimal yes; QUBO, 2108 vars, density 0.0882, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.022992891", "feasible": "", "file": "Early_005_Small.lp", "formulation": "MIP", "num_constraints": "827", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "905.7505175" }, { "coeff_range": "428", "density": "0.088161066", "feasible": "yes", "file": "Early_005_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2108", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Early_005_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Early_005_Small.opt.sol", "source_path": "05-sports/instances/Small/Early_005_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Early_005_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Early_005_Tiny", "instance": "Early_005_Tiny", "paper_context": "", "paper_metrics": [], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Early_005_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Early_005_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Early_005_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Early_005_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Early_010_Medium", "instance": "Early_010_Medium", "paper_context": "MIP, 3408 vars, density 0.00867, optimal yes; QUBO, 5648 vars, density 0.0535, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008669394", "feasible": "", "file": "Early_010_Medium.lp", "formulation": "MIP", "num_constraints": "1711", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.764585" }, { "coeff_range": "1460", "density": "0.053482228", "feasible": "yes", "file": "Early_010_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5648", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Early_010_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Early_010_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Early_010_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Early_010_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Early_010_NoSoft", "instance": "Early_010_NoSoft", "paper_context": "MIP, 15920 vars, density 0.00302, optimal no; QUBO, 22030 vars, density 0.0247, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003024431", "feasible": "", "file": "Early_010_NoSoft.lp", "formulation": "MIP", "num_constraints": "4532", "num_vars": "15920", "obj_value": "feasible", "optimal": "no", "problem_size": "8494.082646" }, { "coeff_range": "6300", "density": "0.024719973", "feasible": "yes", "file": "Early_010_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22030", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Early_010_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Early_010_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Early_010_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Early_010_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Early_010_Small", "instance": "Early_010_Small", "paper_context": "MIP, 992 vars, density 0.024, optimal yes; QUBO, 2122 vars, density 0.0922, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023966379", "feasible": "", "file": "Early_010_Small.lp", "formulation": "MIP", "num_constraints": "852", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.3388929" }, { "coeff_range": "795", "density": "0.092169023", "feasible": "yes", "file": "Early_010_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2122", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Early_010_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Early_010_Small.opt.sol", "source_path": "05-sports/instances/Small/Early_010_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Early_010_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Early_010_Tiny", "instance": "Early_010_Tiny", "paper_context": "", "paper_metrics": [], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Early_010_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Early_010_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Early_010_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Early_010_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_01", "instance": "ITC2021_Early_01", "paper_context": "MIP, 8608 vars, density 0.00862, optimal no; QUBO, 11791 vars, density 0.0508, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008618277", "feasible": "", "file": "ITC2021_Early_01.lp", "formulation": "MIP", "num_constraints": "2364", "num_vars": "8608", "obj_value": "362", "optimal": "no", "problem_size": "4511.02117" }, { "coeff_range": "4480", "density": "0.050844828", "feasible": "yes", "file": "ITC2021_Early_01.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11791", "obj_value": "362", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_01.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_01.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_01.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_01.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_02", "instance": "ITC2021_Early_02", "paper_context": "MIP, 8608 vars, density 0.00779, optimal no; QUBO, 13577 vars, density 0.0403, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00778724", "feasible": "", "file": "ITC2021_Early_02.lp", "formulation": "MIP", "num_constraints": "3225", "num_vars": "8608", "obj_value": "144", "optimal": "no", "problem_size": "5268.851867" }, { "coeff_range": "4350", "density": "0.040327889", "feasible": "yes", "file": "ITC2021_Early_02.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "13577", "obj_value": "144", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_02.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_02.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_02.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_02.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_03", "instance": "ITC2021_Early_03", "paper_context": "MIP, 8608 vars, density 0.00837, optimal no; QUBO, 11869 vars, density 0.0444, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008370779", "feasible": "", "file": "ITC2021_Early_03.lp", "formulation": "MIP", "num_constraints": "2443", "num_vars": "8608", "obj_value": "934", "optimal": "no", "problem_size": "4585.77627" }, { "coeff_range": "109", "density": "0.044370576", "feasible": "yes", "file": "ITC2021_Early_03.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "11869", "obj_value": "934", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_03.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_03.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_03.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_03.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_04", "instance": "ITC2021_Early_04", "paper_context": "MIP, 11592 vars, density 0.00338, optimal no; QUBO, 14206 vars, density 0.0322, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003379245", "feasible": "", "file": "ITC2021_Early_04.lp", "formulation": "MIP", "num_constraints": "2468", "num_vars": "11592", "obj_value": "430", "optimal": "no", "problem_size": "5348.743404" }, { "coeff_range": "5410", "density": "0.032159126", "feasible": "yes", "file": "ITC2021_Early_04.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "14206", "obj_value": "430", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_04.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_04.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_04.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_04.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_05", "instance": "ITC2021_Early_05", "paper_context": "MIP, 11592 vars, density 0.00375, optimal no; QUBO, 16509 vars, density 0.028, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003745604", "feasible": "", "file": "ITC2021_Early_05.lp", "formulation": "MIP", "num_constraints": "3656", "num_vars": "11592", "obj_value": "3127", "optimal": "no", "problem_size": "6510.019355" }, { "coeff_range": "5410", "density": "0.028026142", "feasible": "yes", "file": "ITC2021_Early_05.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16509", "obj_value": "3127", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_05.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_05.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_05.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_05.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_06", "instance": "ITC2021_Early_06", "paper_context": "MIP, 12204 vars, density 0.00656, optimal no; QUBO, 19070 vars, density 0.0348, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006561093", "feasible": "", "file": "ITC2021_Early_06.lp", "formulation": "MIP", "num_constraints": "4247", "num_vars": "12204", "obj_value": "3287", "optimal": "no", "problem_size": "7199.332469" }, { "coeff_range": "109", "density": "0.034836603", "feasible": "yes", "file": "ITC2021_Early_06.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "19070", "obj_value": "3287", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_06.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_06.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_06.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_06.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_07", "instance": "ITC2021_Early_07", "paper_context": "MIP, 11592 vars, density 0.00368, optimal no; QUBO, 15340 vars, density 0.0297, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003679994", "feasible": "", "file": "ITC2021_Early_07.lp", "formulation": "MIP", "num_constraints": "2893", "num_vars": "11592", "obj_value": "4744", "optimal": "no", "problem_size": "5790.997841" }, { "coeff_range": "5020", "density": "0.029733183", "feasible": "yes", "file": "ITC2021_Early_07.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15340", "obj_value": "4744", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_07.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_07.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_07.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_07.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_08", "instance": "ITC2021_Early_08", "paper_context": "MIP, 12204 vars, density 0.00775, optimal no; QUBO, 16665 vars, density 0.0411, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.007748386", "feasible": "", "file": "ITC2021_Early_08.lp", "formulation": "MIP", "num_constraints": "2822", "num_vars": "12204", "obj_value": "1051", "optimal": "no", "problem_size": "5868.533718" }, { "coeff_range": "280", "density": "0.041128759", "feasible": "yes", "file": "ITC2021_Early_08.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16665", "obj_value": "1051", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_08.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_08.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_08.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_08.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_09", "instance": "ITC2021_Early_09", "paper_context": "MIP, 12204 vars, density 0.00771, optimal no; QUBO, 16708 vars, density 0.0411, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.007710592", "feasible": "", "file": "ITC2021_Early_09.lp", "formulation": "MIP", "num_constraints": "2848", "num_vars": "12204", "obj_value": "56", "optimal": "no", "problem_size": "5895.506085" }, { "coeff_range": "288", "density": "0.041050768", "feasible": "yes", "file": "ITC2021_Early_09.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16708", "obj_value": "56", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_09.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_09.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_09.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_09.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_10", "instance": "ITC2021_Early_10", "paper_context": "MIP, 15920 vars, density 0.00302, optimal no; QUBO, 22030 vars, density 0.0247, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003024431", "feasible": "", "file": "ITC2021_Early_10.lp", "formulation": "MIP", "num_constraints": "4532", "num_vars": "15920", "obj_value": "3400", "optimal": "no", "problem_size": "8494.082646" }, { "coeff_range": "6300", "density": "0.024719973", "feasible": "yes", "file": "ITC2021_Early_10.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22030", "obj_value": "3400", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_10.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_10.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_10.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_10.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_11", "instance": "ITC2021_Early_11", "paper_context": "MIP, 15920 vars, density 0.00304, optimal no; QUBO, 22025 vars, density 0.0241, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.00303911", "feasible": "", "file": "ITC2021_Early_11.lp", "formulation": "MIP", "num_constraints": "4341", "num_vars": "15920", "obj_value": "4381", "optimal": "no", "problem_size": "8313.165462" }, { "coeff_range": "6760", "density": "0.024121405", "feasible": "yes", "file": "ITC2021_Early_11.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22025", "obj_value": "4381", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_11.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_11.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_11.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_11.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_12", "instance": "ITC2021_Early_12", "paper_context": "MIP, 15920 vars, density 0.00296, optimal no; QUBO, 21936 vars, density 0.0191, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002961064", "feasible": "", "file": "ITC2021_Early_12.lp", "formulation": "MIP", "num_constraints": "4474", "num_vars": "15920", "obj_value": "315", "optimal": "no", "problem_size": "8439.554491" }, { "coeff_range": "135", "density": "0.019115923", "feasible": "yes", "file": "ITC2021_Early_12.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "21936", "obj_value": "315", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_12.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_12.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_12.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_12.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_13", "instance": "ITC2021_Early_13", "paper_context": "MIP, 15920 vars, density 0.00289, optimal no; QUBO, 20392 vars, density 0.0249, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002891072", "feasible": "", "file": "ITC2021_Early_13.lp", "formulation": "MIP", "num_constraints": "3480", "num_vars": "15920", "obj_value": "121", "optimal": "no", "problem_size": "7443.225107" }, { "coeff_range": "7220", "density": "0.024853633", "feasible": "yes", "file": "ITC2021_Early_13.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20392", "obj_value": "121", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_13.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_13.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_13.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_13.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_14", "instance": "ITC2021_Early_14", "paper_context": "MIP, 16680 vars, density 0.00685, optimal no; QUBO, 22361 vars, density 0.0388, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006847376", "feasible": "", "file": "ITC2021_Early_14.lp", "formulation": "MIP", "num_constraints": "3487", "num_vars": "16680", "obj_value": "4", "optimal": "no", "problem_size": "7626.477562" }, { "coeff_range": "287", "density": "0.038843034", "feasible": "yes", "file": "ITC2021_Early_14.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22361", "obj_value": "4", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_14.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_14.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_14.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_14.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Early_15", "instance": "ITC2021_Early_15", "paper_context": "MIP, 16680 vars, density 0.00582, optimal no; QUBO, 25364 vars, density 0.0325, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.005823586", "feasible": "", "file": "ITC2021_Early_15.lp", "formulation": "MIP", "num_constraints": "5043", "num_vars": "16680", "obj_value": "2955", "optimal": "no", "problem_size": "9171.545126" }, { "coeff_range": "301", "density": "0.032541606", "feasible": "yes", "file": "ITC2021_Early_15.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "25364", "obj_value": "2955", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Early_15.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Early_15.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Early_15.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Early_15.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_01", "instance": "ITC2021_Late_01", "paper_context": "MIP, 8608 vars, density 0.00812, optimal no; QUBO, 13092 vars, density 0.04, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008121618", "feasible": "", "file": "ITC2021_Late_01.lp", "formulation": "MIP", "num_constraints": "2839", "num_vars": "8608", "obj_value": "5177", "optimal": "no", "problem_size": "4943.491883" }, { "coeff_range": "260", "density": "0.039999229", "feasible": "yes", "file": "ITC2021_Late_01.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "13092", "obj_value": "5177", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_01.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_01.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_01.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_01.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_02", "instance": "ITC2021_Late_02", "paper_context": "MIP, 8128 vars, density 0.00474, optimal no; QUBO, 12043 vars, density 0.0317, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004739638", "feasible": "", "file": "ITC2021_Late_02.lp", "formulation": "MIP", "num_constraints": "2818", "num_vars": "8128", "obj_value": "7381", "optimal": "no", "problem_size": "4785.885916" }, { "coeff_range": "4480", "density": "0.031724994", "feasible": "yes", "file": "ITC2021_Late_02.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12043", "obj_value": "7381", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_02.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_02.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_02.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_02.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_03", "instance": "ITC2021_Late_03", "paper_context": "MIP, 8608 vars, density 0.00817, optimal no; QUBO, 12924 vars, density 0.0384, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.008171006", "feasible": "", "file": "ITC2021_Late_03.lp", "formulation": "MIP", "num_constraints": "2732", "num_vars": "8608", "obj_value": "9315", "optimal": "no", "problem_size": "4849.43873" }, { "coeff_range": "257", "density": "0.038418584", "feasible": "yes", "file": "ITC2021_Late_03.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12924", "obj_value": "9315", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_03.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_03.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_03.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_03.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_04", "instance": "ITC2021_Late_04", "paper_context": "MIP, 11592 vars, density 0.00324, optimal no; QUBO, 14099 vars, density 0.0233, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003242065", "feasible": "", "file": "ITC2021_Late_04.lp", "formulation": "MIP", "num_constraints": "2402", "num_vars": "11592", "obj_value": "7", "optimal": "no", "problem_size": "5276.739903" }, { "coeff_range": "119", "density": "0.023325883", "feasible": "yes", "file": "ITC2021_Late_04.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "14099", "obj_value": "7", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_04.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_04.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_04.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_04.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_05", "instance": "ITC2021_Late_05", "paper_context": "MIP, 12204 vars, density 0.00657, optimal no; QUBO, 19095 vars, density 0.0386, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006569963", "feasible": "", "file": "ITC2021_Late_05.lp", "formulation": "MIP", "num_constraints": "4243", "num_vars": "12204", "obj_value": "279", "optimal": "no", "problem_size": "7195.941356" }, { "coeff_range": "5410", "density": "0.0386152", "feasible": "yes", "file": "ITC2021_Late_05.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "19095", "obj_value": "279", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_05.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_05.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_05.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_05.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_06", "instance": "ITC2021_Late_06", "paper_context": "MIP, 11592 vars, density 0.00339, optimal no; QUBO, 14197 vars, density 0.0259, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003386569", "feasible": "", "file": "ITC2021_Late_06.lp", "formulation": "MIP", "num_constraints": "2462", "num_vars": "11592", "obj_value": "1090", "optimal": "no", "problem_size": "5342.237733" }, { "coeff_range": "122", "density": "0.025933848", "feasible": "yes", "file": "ITC2021_Late_06.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "14197", "obj_value": "1090", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_06.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_06.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_06.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_06.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_07", "instance": "ITC2021_Late_07", "paper_context": "MIP, 11592 vars, density 0.00352, optimal no; QUBO, 15228 vars, density 0.0275, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003524551", "feasible": "", "file": "ITC2021_Late_07.lp", "formulation": "MIP", "num_constraints": "2845", "num_vars": "11592", "obj_value": "1780", "optimal": "no", "problem_size": "5742.755436" }, { "coeff_range": "5410", "density": "0.027460353", "feasible": "yes", "file": "ITC2021_Late_07.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15228", "obj_value": "1780", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_07.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_07.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_07.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_07.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_08", "instance": "ITC2021_Late_08", "paper_context": "MIP, 11592 vars, density 0.00323, optimal no; QUBO, 14073 vars, density 0.0231, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003225527", "feasible": "", "file": "ITC2021_Late_08.lp", "formulation": "MIP", "num_constraints": "2416", "num_vars": "11592", "obj_value": "129", "optimal": "no", "problem_size": "5292.095237" }, { "coeff_range": "66", "density": "0.02309931", "feasible": "yes", "file": "ITC2021_Late_08.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "14073", "obj_value": "129", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_08.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_08.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_08.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_08.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_09", "instance": "ITC2021_Late_09", "paper_context": "MIP, 12204 vars, density 0.00669, optimal no; QUBO, 19000 vars, density 0.0333, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006691522", "feasible": "", "file": "ITC2021_Late_09.lp", "formulation": "MIP", "num_constraints": "4004", "num_vars": "12204", "obj_value": "415", "optimal": "no", "problem_size": "6990.337331" }, { "coeff_range": "300", "density": "0.033302225", "feasible": "yes", "file": "ITC2021_Late_09.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "19000", "obj_value": "415", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_09.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_09.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_09.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_09.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_10", "instance": "ITC2021_Late_10", "paper_context": "MIP, 15920 vars, density 0.00298, optimal no; QUBO, 22035 vars, density 0.0241, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002983675", "feasible": "", "file": "ITC2021_Late_10.lp", "formulation": "MIP", "num_constraints": "4529", "num_vars": "15920", "obj_value": "1228", "optimal": "no", "problem_size": "8491.270812" }, { "coeff_range": "7220", "density": "0.024117216", "feasible": "yes", "file": "ITC2021_Late_10.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22035", "obj_value": "1228", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_10.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_10.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_10.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_10.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_11", "instance": "ITC2021_Late_11", "paper_context": "MIP, 16680 vars, density 0.00666, optimal no; QUBO, 22208 vars, density 0.0437, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006660829", "feasible": "", "file": "ITC2021_Late_11.lp", "formulation": "MIP", "num_constraints": "3664", "num_vars": "16680", "obj_value": "2177", "optimal": "no", "problem_size": "7817.641588" }, { "coeff_range": "7220", "density": "0.04374871", "feasible": "yes", "file": "ITC2021_Late_11.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22208", "obj_value": "2177", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_11.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_11.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_11.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_11.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_12", "instance": "ITC2021_Late_12", "paper_context": "MIP, 15920 vars, density 0.00303, optimal no; QUBO, 22006 vars, density 0.0239, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003030522", "feasible": "", "file": "ITC2021_Late_12.lp", "formulation": "MIP", "num_constraints": "4339", "num_vars": "15920", "obj_value": "1", "optimal": "no", "problem_size": "8311.250207" }, { "coeff_range": "6760", "density": "0.023947182", "feasible": "yes", "file": "ITC2021_Late_12.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22006", "obj_value": "1", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_12.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_12.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_12.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_12.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_13", "instance": "ITC2021_Late_13", "paper_context": "MIP, 16680 vars, density 0.00584, optimal no; QUBO, 25362 vars, density 0.0325, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.005837527", "feasible": "", "file": "ITC2021_Late_13.lp", "formulation": "MIP", "num_constraints": "5025", "num_vars": "16680", "obj_value": "211", "optimal": "no", "problem_size": "9155.162478" }, { "coeff_range": "301", "density": "0.032536369", "feasible": "yes", "file": "ITC2021_Late_13.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "25362", "obj_value": "211", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_13.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_13.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_13.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_13.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_14", "instance": "ITC2021_Late_14", "paper_context": "MIP, 16680 vars, density 0.00582, optimal no; QUBO, 25238 vars, density 0.0319, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.005824307", "feasible": "", "file": "ITC2021_Late_14.lp", "formulation": "MIP", "num_constraints": "4972", "num_vars": "16680", "obj_value": "1140", "optimal": "no", "problem_size": "9106.753538" }, { "coeff_range": "300", "density": "0.031938472", "feasible": "yes", "file": "ITC2021_Late_14.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "25238", "obj_value": "1140", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_14.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_14.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_14.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_14.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Late_15", "instance": "ITC2021_Late_15", "paper_context": "MIP, 16680 vars, density 0.00686, optimal no; QUBO, 22356 vars, density 0.0389, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006858506", "feasible": "", "file": "ITC2021_Late_15.lp", "formulation": "MIP", "num_constraints": "3481", "num_vars": "16680", "obj_value": "462", "optimal": "no", "problem_size": "7619.913385" }, { "coeff_range": "289", "density": "0.038857085", "feasible": "yes", "file": "ITC2021_Late_15.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "22356", "obj_value": "462", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Late_15.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Late_15.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Late_15.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Late_15.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_01", "instance": "ITC2021_Middle_01", "paper_context": "MIP, 8128 vars, density 0.00449, optimal no; QUBO, 10181 vars, density 0.0414, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004485835", "feasible": "", "file": "ITC2021_Middle_01.lp", "formulation": "MIP", "num_constraints": "1942", "num_vars": "8128", "obj_value": "1919", "optimal": "no", "problem_size": "3972.980745" }, { "coeff_range": "4480", "density": "0.041444859", "feasible": "yes", "file": "ITC2021_Middle_01.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "10181", "obj_value": "1919", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_01.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_01.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_01.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_01.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_02", "instance": "ITC2021_Middle_02", "paper_context": "MIP, 8128 vars, density 0.00471, optimal no; QUBO, 12035 vars, density 0.0326, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004714225", "feasible": "", "file": "ITC2021_Middle_02.lp", "formulation": "MIP", "num_constraints": "2938", "num_vars": "8128", "obj_value": "5379", "optimal": "no", "problem_size": "4886.723238" }, { "coeff_range": "4480", "density": "0.032573654", "feasible": "yes", "file": "ITC2021_Middle_02.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12035", "obj_value": "5379", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_02.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_02.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_02.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_02.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_03", "instance": "ITC2021_Middle_03", "paper_context": "MIP, 8608 vars, density 0.00778, optimal no; QUBO, 14000 vars, density 0.0375, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.007783528", "feasible": "", "file": "ITC2021_Middle_03.lp", "formulation": "MIP", "num_constraints": "3289", "num_vars": "8608", "obj_value": "2369", "optimal": "no", "problem_size": "5320.875116" }, { "coeff_range": "273", "density": "0.03752082", "feasible": "yes", "file": "ITC2021_Middle_03.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "14000", "obj_value": "2369", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_03.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_03.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_03.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_03.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_04", "instance": "ITC2021_Middle_04", "paper_context": "MIP, 11592 vars, density 0.00346, optimal no; QUBO, 15196 vars, density 0.0216, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.0034622", "feasible": "", "file": "ITC2021_Middle_04.lp", "formulation": "MIP", "num_constraints": "2974", "num_vars": "11592", "obj_value": "0", "optimal": "no", "problem_size": "5871.508154" }, { "coeff_range": "49", "density": "0.0216333", "feasible": "yes", "file": "ITC2021_Middle_04.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15196", "obj_value": "0", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_04.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_04.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_04.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_04.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_05", "instance": "ITC2021_Middle_05", "paper_context": "MIP, 12204 vars, density 0.00732, optimal no; QUBO, 16688 vars, density 0.0412, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.007317803", "feasible": "", "file": "ITC2021_Middle_05.lp", "formulation": "MIP", "num_constraints": "3064", "num_vars": "12204", "obj_value": "1849", "optimal": "no", "problem_size": "6114.986182" }, { "coeff_range": "109", "density": "0.041231078", "feasible": "yes", "file": "ITC2021_Middle_05.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16688", "obj_value": "1849", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_05.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_05.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_05.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_05.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_06", "instance": "ITC2021_Middle_06", "paper_context": "MIP, 11592 vars, density 0.00364, optimal no; QUBO, 16414 vars, density 0.0211, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003639289", "feasible": "", "file": "ITC2021_Middle_06.lp", "formulation": "MIP", "num_constraints": "3606", "num_vars": "11592", "obj_value": "872", "optimal": "no", "problem_size": "6465.350107" }, { "coeff_range": "66", "density": "0.021082305", "feasible": "yes", "file": "ITC2021_Middle_06.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16414", "obj_value": "872", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_06.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_06.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_06.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_06.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_07", "instance": "ITC2021_Middle_07", "paper_context": "MIP, 11592 vars, density 0.00361, optimal no; QUBO, 15344 vars, density 0.0236, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003608541", "feasible": "", "file": "ITC2021_Middle_07.lp", "formulation": "MIP", "num_constraints": "2874", "num_vars": "11592", "obj_value": "1558", "optimal": "no", "problem_size": "5771.950104" }, { "coeff_range": "129", "density": "0.023637312", "feasible": "yes", "file": "ITC2021_Middle_07.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "15344", "obj_value": "1558", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_07.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_07.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_07.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_07.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_08", "instance": "ITC2021_Middle_08", "paper_context": "MIP, 11592 vars, density 0.00367, optimal no; QUBO, 16341 vars, density 0.02, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003673905", "feasible": "", "file": "ITC2021_Middle_08.lp", "formulation": "MIP", "num_constraints": "3356", "num_vars": "11592", "obj_value": "934", "optimal": "no", "problem_size": "6237.207067" }, { "coeff_range": "85", "density": "0.019965502", "feasible": "yes", "file": "ITC2021_Middle_08.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16341", "obj_value": "934", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_08.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_08.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_08.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_08.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_09", "instance": "ITC2021_Middle_09", "paper_context": "MIP, 12204 vars, density 0.00714, optimal no; QUBO, 17849 vars, density 0.0365, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.007139565", "feasible": "", "file": "ITC2021_Middle_09.lp", "formulation": "MIP", "num_constraints": "3421", "num_vars": "12204", "obj_value": "498", "optimal": "no", "problem_size": "6461.415015" }, { "coeff_range": "287", "density": "0.036538305", "feasible": "yes", "file": "ITC2021_Middle_09.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "17849", "obj_value": "498", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_09.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_09.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_09.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_09.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_10", "instance": "ITC2021_Middle_10", "paper_context": "MIP, 15920 vars, density 0.0027, optimal no; QUBO, 19057 vars, density 0.0279, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002701191", "feasible": "", "file": "ITC2021_Middle_10.lp", "formulation": "MIP", "num_constraints": "3046", "num_vars": "15920", "obj_value": "1786", "optimal": "no", "problem_size": "6963.642725" }, { "coeff_range": "7220", "density": "0.027926532", "feasible": "yes", "file": "ITC2021_Middle_10.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "19057", "obj_value": "1786", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_10.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_10.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_10.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_10.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_11", "instance": "ITC2021_Middle_11", "paper_context": "MIP, 16680 vars, density 0.00569, optimal no; QUBO, 25240 vars, density 0.0325, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.005691012", "feasible": "", "file": "ITC2021_Middle_11.lp", "formulation": "MIP", "num_constraints": "5222", "num_vars": "16680", "obj_value": "201", "optimal": "no", "problem_size": "9332.896656" }, { "coeff_range": "113", "density": "0.03247341", "feasible": "yes", "file": "ITC2021_Middle_11.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "25240", "obj_value": "201", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_11.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_11.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_11.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_11.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_12", "instance": "ITC2021_Middle_12", "paper_context": "MIP, 16680 vars, density 0.0061, optimal no; QUBO, 23649 vars, density 0.035, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.006102858", "feasible": "", "file": "ITC2021_Middle_12.lp", "formulation": "MIP", "num_constraints": "4390", "num_vars": "16680", "obj_value": "3226", "optimal": "no", "problem_size": "8557.17243" }, { "coeff_range": "99", "density": "0.034956346", "feasible": "yes", "file": "ITC2021_Middle_12.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "23649", "obj_value": "3226", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_12.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_12.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_12.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_12.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_13", "instance": "ITC2021_Middle_13", "paper_context": "MIP, 15920 vars, density 0.00293, optimal no; QUBO, 20562 vars, density 0.0212, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002933826", "feasible": "", "file": "ITC2021_Middle_13.lp", "formulation": "MIP", "num_constraints": "3598", "num_vars": "15920", "obj_value": "1813", "optimal": "no", "problem_size": "7568.365742" }, { "coeff_range": "88", "density": "0.021207607", "feasible": "yes", "file": "ITC2021_Middle_13.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "20562", "obj_value": "1813", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_13.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_13.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_13.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_13.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_14", "instance": "ITC2021_Middle_14", "paper_context": "MIP, 16680 vars, density 0.00587, optimal no; QUBO, 25239 vars, density 0.0353, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.005871914", "feasible": "", "file": "ITC2021_Middle_14.lp", "formulation": "MIP", "num_constraints": "4922", "num_vars": "16680", "obj_value": "1140", "optimal": "no", "problem_size": "9060.847642" }, { "coeff_range": "5980", "density": "0.035279128", "feasible": "yes", "file": "ITC2021_Middle_14.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "25239", "obj_value": "1140", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_14.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_14.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_14.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_14.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "ITC2021", "format": ".xml.gz", "id": "05-sports:ITC2021_Middle_15", "instance": "ITC2021_Middle_15", "paper_context": "MIP, 15920 vars, density 0.00265, optimal no; QUBO, 18985 vars, density 0.0206, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.002654638", "feasible": "", "file": "ITC2021_Middle_15.lp", "formulation": "MIP", "num_constraints": "2765", "num_vars": "15920", "obj_value": "0", "optimal": "no", "problem_size": "6634.666533" }, { "coeff_range": "119", "density": "0.020648923", "feasible": "yes", "file": "ITC2021_Middle_15.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "18985", "obj_value": "0", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/ITC2021/ITC2021_Middle_15.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/ITC2021/ITC2021_Middle_15.xml.gz", "source_path": "05-sports/instances/ITC2021/ITC2021_Middle_15.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/ITC2021/ITC2021_Middle_15.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Late_005_Medium", "instance": "Late_005_Medium", "paper_context": "MIP, 3408 vars, density 0.00879, optimal yes; QUBO, 5590 vars, density 0.0542, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008786773", "feasible": "", "file": "Late_005_Medium.lp", "formulation": "MIP", "num_constraints": "1646", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2368.452659" }, { "coeff_range": "1360", "density": "0.054174211", "feasible": "yes", "file": "Late_005_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5590", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Late_005_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Late_005_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Late_005_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Late_005_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Late_005_NoSoft", "instance": "Late_005_NoSoft", "paper_context": "MIP, 11592 vars, density 0.00374, optimal no; QUBO, 16503 vars, density 0.0278, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.003742431", "feasible": "", "file": "Late_005_NoSoft.lp", "formulation": "MIP", "num_constraints": "3631", "num_vars": "11592", "obj_value": "feasible", "optimal": "no", "problem_size": "6487.723175" }, { "coeff_range": "5410", "density": "0.02782226", "feasible": "yes", "file": "Late_005_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16503", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Late_005_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Late_005_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Late_005_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Late_005_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Late_005_Small", "instance": "Late_005_Small", "paper_context": "MIP, 992 vars, density 0.024, optimal yes; QUBO, 2065 vars, density 0.0916, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.024034648", "feasible": "", "file": "Late_005_Small.lp", "formulation": "MIP", "num_constraints": "793", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "886.9362999" }, { "coeff_range": "572", "density": "0.091617307", "feasible": "yes", "file": "Late_005_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2065", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Late_005_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Late_005_Small.opt.sol", "source_path": "05-sports/instances/Small/Late_005_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Late_005_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Late_005_Tiny", "instance": "Late_005_Tiny", "paper_context": "", "paper_metrics": [], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Late_005_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Late_005_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Late_005_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Late_005_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Medium", "format": ".xml.gz", "id": "05-sports:Middle_002_Medium", "instance": "Middle_002_Medium", "paper_context": "MIP, 3408 vars, density 0.00875, optimal yes; QUBO, 5654 vars, density 0.0544, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.008750309", "feasible": "", "file": "Middle_002_Medium.lp", "formulation": "MIP", "num_constraints": "1710", "num_vars": "3408", "obj_value": "feasible", "optimal": "yes", "problem_size": "2414.058823" }, { "coeff_range": "1360", "density": "0.054421539", "feasible": "yes", "file": "Middle_002_Medium.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "5654", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Medium/Middle_002_Medium.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Medium/Middle_002_Medium.opt.sol", "source_path": "05-sports/instances/Medium/Middle_002_Medium.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Medium/Middle_002_Medium.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Large", "format": ".xml.gz", "id": "05-sports:Middle_002_NoSoft", "instance": "Middle_002_NoSoft", "paper_context": "MIP, 8128 vars, density 0.00471, optimal no; QUBO, 12035 vars, density 0.0326, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "0.004714225", "feasible": "", "file": "Middle_002_NoSoft.lp", "formulation": "MIP", "num_constraints": "2938", "num_vars": "8128", "obj_value": "feasible", "optimal": "no", "problem_size": "4886.723238" }, { "coeff_range": "4480", "density": "0.032573654", "feasible": "yes", "file": "Middle_002_NoSoft.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "12035", "obj_value": "feasible", "optimal": "no", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Large/Middle_002_NoSoft.xml.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Large/Middle_002_NoSoft.xml.gz", "source_path": "05-sports/instances/Large/Middle_002_NoSoft.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Large/Middle_002_NoSoft.xml.gz", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Small", "format": ".xml.gz", "id": "05-sports:Middle_002_Small", "instance": "Middle_002_Small", "paper_context": "MIP, 992 vars, density 0.0233, optimal yes; QUBO, 2110 vars, density 0.0903, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.023314299", "feasible": "", "file": "Middle_002_Small.lp", "formulation": "MIP", "num_constraints": "853", "num_vars": "992", "obj_value": "feasible", "optimal": "yes", "problem_size": "919.8782528" }, { "coeff_range": "795", "density": "0.090327578", "feasible": "yes", "file": "Middle_002_Small.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2110", "obj_value": "feasible", "optimal": "yes", "problem_size": "" } ], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Small/Middle_002_Small.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Small/Middle_002_Small.opt.sol", "source_path": "05-sports/instances/Small/Middle_002_Small.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Small/Middle_002_Small.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "Tiny", "format": ".xml.gz", "id": "05-sports:Middle_002_Tiny", "instance": "Middle_002_Tiny", "paper_context": "", "paper_metrics": [], "problem_dir": "05-sports", "problem_number": "05", "problem_title": "Sports Tournament Scheduling", "problem_why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.", "solution_path": "05-sports/solutions/Tiny/Middle_002_Tiny.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions/Tiny/Middle_002_Tiny.opt.sol", "source_path": "05-sports/instances/Tiny/Middle_002_Tiny.xml.gz", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances/Tiny/Middle_002_Tiny.xml.gz", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge." }, { "best_date": "8. Mar. 2026", "best_numeric": -0.030604, "best_submission": "20260308_Arvak_Hinderink", "best_submitter": "Daniel Hinderink (hiq-lab)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/po_a010_t10_orig_summary.csv", "best_value": "-0.030604", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t10_orig", "instance": "po_a010_t10_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t10_orig_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t10_orig_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t10_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t10_orig", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t10_s00", "instance": "po_a010_t10_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t10_s00_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t10_s00_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t10_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t10_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t10_s01", "instance": "po_a010_t10_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t10_s01_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t10_s01_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t10_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t10_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t10_s02", "instance": "po_a010_t10_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t10_s02_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t10_s02_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t10_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t10_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "8. Mar. 2026", "best_numeric": -0.007064, "best_submission": "20260308_Arvak_Hinderink", "best_submitter": "Daniel Hinderink (hiq-lab)", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/po_a010_t15_orig_summary.csv", "best_value": "-0.007064", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t15_orig", "instance": "po_a010_t15_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t15_orig_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t15_orig_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t15_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t15_orig", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t15_s00", "instance": "po_a010_t15_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t15_s00_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t15_s00_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t15_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t15_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t15_s01", "instance": "po_a010_t15_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t15_s01_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t15_s01_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t15_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t15_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a010_t15_s02", "instance": "po_a010_t15_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a010_t15_s02_b004.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a010_t15_s02_b004.tar.gz", "source_path": "06-portfolio/instances/po_a010_t15_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a010_t15_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t10_orig", "instance": "po_a050_t10_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t10_orig_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t10_orig_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t10_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t10_orig", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t10_s00", "instance": "po_a050_t10_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t10_s00_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t10_s00_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t10_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t10_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t10_s01", "instance": "po_a050_t10_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t10_s01_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t10_s01_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t10_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t10_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t10_s02", "instance": "po_a050_t10_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t10_s02_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t10_s02_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t10_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t10_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t15_orig", "instance": "po_a050_t15_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t15_orig_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t15_orig_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t15_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t15_orig", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t15_s00", "instance": "po_a050_t15_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t15_s00_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t15_s00_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t15_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t15_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t15_s01", "instance": "po_a050_t15_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t15_s01_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t15_s01_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t15_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t15_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a050_t15_s02", "instance": "po_a050_t15_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "06-portfolio/solutions/uqo/a050_t15_s02_b020.tar.gz", "solution_status": "solution", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions/uqo/a050_t15_s02_b020.tar.gz", "source_path": "06-portfolio/instances/po_a050_t15_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a050_t15_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t10_orig", "instance": "po_a200_t10_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t10_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t10_orig", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t10_s00", "instance": "po_a200_t10_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t10_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t10_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t10_s01", "instance": "po_a200_t10_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t10_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t10_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t10_s02", "instance": "po_a200_t10_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t10_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t10_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t15_orig", "instance": "po_a200_t15_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t15_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t15_orig", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t15_s00", "instance": "po_a200_t15_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t15_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t15_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t15_s01", "instance": "po_a200_t15_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t15_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t15_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a200_t15_s02", "instance": "po_a200_t15_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a200_t15_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a200_t15_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t10_orig", "instance": "po_a400_t10_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t10_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t10_orig", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t10_s00", "instance": "po_a400_t10_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t10_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t10_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t10_s01", "instance": "po_a400_t10_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t10_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t10_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t10_s02", "instance": "po_a400_t10_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t10_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t10_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t15_orig", "instance": "po_a400_t15_orig", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t15_orig", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t15_orig", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t15_s00", "instance": "po_a400_t15_s00", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t15_s00", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t15_s00", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t15_s01", "instance": "po_a400_t15_s01", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t15_s01", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t15_s01", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": "directory", "id": "06-portfolio:po_a400_t15_s02", "instance": "po_a400_t15_s02", "paper_context": "", "paper_metrics": [], "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "problem_why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.", "solution_path": "", "solution_status": "", "solution_url": "", "source_path": "06-portfolio/instances/po_a400_t15_s02", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances/po_a400_t15_s02", "status": "open", "status_label": "Open", "submission_count": 0, "why_care": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions." }, { "best_date": "2025-07-15 15:45:47", "best_numeric": 34.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/C125-9_summary.csv", "best_value": "34.0", "family": "", "format": ".gph", "id": "07-independentset:C125-9", "instance": "C125-9", "paper_context": "MIP, 125 vars, density 0.016, optimal yes; QUBO, 125 vars, density 0.116, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.016", "feasible": "", "file": "C125-9.lp", "formulation": "MIP", "num_constraints": "787", "num_vars": "125", "obj_value": "34", "optimal": "yes", "problem_size": "313.6478918" }, { "coeff_range": "2", "density": "0.115809524", "feasible": "yes", "file": "C125-9.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "125", "obj_value": "34", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/C125-9.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/C125-9.opt.sol", "source_path": "07-independentset/instances/C125-9.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/C125-9.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 18.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/C4000-5_summary.csv", "best_value": "18", "family": "", "format": ".gph", "id": "07-independentset:C4000-5", "instance": "C4000-5", "paper_context": "MIP, 4000 vars, density 0.0005, optimal no; QUBO, 4000 vars, density 0.5, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.0005", "feasible": "", "file": "C4000-5.lp", "formulation": "MIP", "num_constraints": "3997732", "num_vars": "4000", "obj_value": "57", "optimal": "no", "problem_size": "126455.2411" }, { "coeff_range": "2", "density": "0.500091477", "feasible": "yes", "file": "C4000-5.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4000", "obj_value": "57", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/C4000-5.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/C4000-5.bst.sol", "source_path": "07-independentset/instances/C4000-5.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/C4000-5.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 57.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C500-9/C500-9_summary.csv", "best_value": "57", "family": "", "format": ".gph", "id": "07-independentset:C500-9", "instance": "C500-9", "paper_context": "MIP, 500 vars, density 0.004, optimal no; QUBO, 500 vars, density 0.103, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.004", "feasible": "", "file": "C500-9.lp", "formulation": "MIP", "num_constraints": "12418", "num_vars": "500", "obj_value": "18", "optimal": "no", "problem_size": "2491.786508" }, { "coeff_range": "2", "density": "0.103137725", "feasible": "yes", "file": "C500-9.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "500", "obj_value": "18", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/C500-9.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/C500-9.bst.sol", "source_path": "07-independentset/instances/C500-9.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/C500-9.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:02:39", "best_numeric": 3.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/MANN-a9_summary.csv", "best_value": "3.0", "family": "", "format": ".gph", "id": "07-independentset:MANN-a9", "instance": "MANN-a9", "paper_context": "MIP, 45 vars, density 0.0444, optimal yes; QUBO, 45 vars, density 0.93, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.044444444", "feasible": "", "file": "MANN-a9.lp", "formulation": "MIP", "num_constraints": "918", "num_vars": "45", "obj_value": "13", "optimal": "yes", "problem_size": "203.2486162" }, { "coeff_range": "2", "density": "0.930434783", "feasible": "yes", "file": "MANN-a9.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "45", "obj_value": "13", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/MANN-a9.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/MANN-a9.opt.sol", "source_path": "07-independentset/instances/MANN-a9.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/MANN-a9.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 115.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/R_1000_005_1_summary.csv", "best_value": "115", "family": "", "format": ".gph", "id": "07-independentset:R_1000_005_1", "instance": "R_1000_005_1", "paper_context": "MIP, 1000 vars, density 0.002, optimal no; QUBO, 1000 vars, density 0.0513, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.002", "feasible": "", "file": "R_1000_005_1.lp", "formulation": "MIP", "num_constraints": "24670", "num_vars": "1000", "obj_value": "94", "optimal": "no", "problem_size": "4966.890375" }, { "coeff_range": "2", "density": "0.051288711", "feasible": "yes", "file": "R_1000_005_1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1000", "obj_value": "94", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/R_1000_005_1.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/R_1000_005_1.bst.sol", "source_path": "07-independentset/instances/R_1000_005_1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/R_1000_005_1.gph", "status": "best_known", "status_label": "Best known", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 90.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/R_500_005_1_summary.csv", "best_value": "90", "family": "", "format": ".gph", "id": "07-independentset:R_500_005_1", "instance": "R_500_005_1", "paper_context": "MIP, 500 vars, density 0.004, optimal no; QUBO, 500 vars, density 0.0539, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.004", "feasible": "", "file": "R_500_005_1.lp", "formulation": "MIP", "num_constraints": "6256", "num_vars": "500", "obj_value": "91", "optimal": "no", "problem_size": "1768.615278" }, { "coeff_range": "2", "density": "0.05394012", "feasible": "yes", "file": "R_500_005_1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "500", "obj_value": "91", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/R_500_005_1.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/R_500_005_1.bst.sol", "source_path": "07-independentset/instances/R_500_005_1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/R_500_005_1.gph", "status": "best_known", "status_label": "Best known", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:43:03", "best_numeric": 13.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv", "best_value": "13.0", "family": "", "format": ".gph", "id": "07-independentset:aves-sparrow-social", "instance": "aves-sparrow-social", "paper_context": "MIP, 52 vars, density 0.0385, optimal yes; QUBO, 52 vars, density 0.367, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.038461538", "feasible": "", "file": "aves-sparrow-social.lp", "formulation": "MIP", "num_constraints": "454", "num_vars": "52", "obj_value": "13", "optimal": "yes", "problem_size": "153.6489505" }, { "coeff_range": "2", "density": "0.367198839", "feasible": "yes", "file": "aves-sparrow-social.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "52", "obj_value": "13", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/aves-sparrow-social.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/aves-sparrow-social.opt.sol", "source_path": "07-independentset/instances/aves-sparrow-social.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/aves-sparrow-social.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 4, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:43:06", "best_numeric": 6.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/brock200-1_summary.csv", "best_value": "6.0", "family": "", "format": ".gph", "id": "07-independentset:brock200-1", "instance": "brock200-1", "paper_context": "MIP, 200 vars, density 0.01, optimal yes; QUBO, 200 vars, density 0.748, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.01", "feasible": "", "file": "brock200-1.lp", "formulation": "MIP", "num_constraints": "14834", "num_vars": "200", "obj_value": "6", "optimal": "yes", "problem_size": "1722.44013" }, { "coeff_range": "2", "density": "0.747960199", "feasible": "yes", "file": "brock200-1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/brock200-1.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/brock200-1.opt.sol", "source_path": "07-independentset/instances/brock200-1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/brock200-1.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:43:13", "best_numeric": 12.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/brock200-2_summary.csv", "best_value": "12.0", "family": "", "format": ".gph", "id": "07-independentset:brock200-2", "instance": "brock200-2", "paper_context": "MIP, 200 vars, density 0.01, optimal yes; QUBO, 200 vars, density 0.509, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.01", "feasible": "", "file": "brock200-2.lp", "formulation": "MIP", "num_constraints": "10024", "num_vars": "200", "obj_value": "12", "optimal": "yes", "problem_size": "1415.909602" }, { "coeff_range": "2", "density": "0.508656716", "feasible": "yes", "file": "brock200-2.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "12", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/brock200-2.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/brock200-2.opt.sol", "source_path": "07-independentset/instances/brock200-2.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/brock200-2.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:43:20", "best_numeric": 9.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/brock200-3_summary.csv", "best_value": "9.0", "family": "", "format": ".gph", "id": "07-independentset:brock200-3", "instance": "brock200-3", "paper_context": "MIP, 200 vars, density 0.01, optimal yes; QUBO, 200 vars, density 0.609, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.01", "feasible": "", "file": "brock200-3.lp", "formulation": "MIP", "num_constraints": "12048", "num_vars": "200", "obj_value": "9", "optimal": "yes", "problem_size": "1552.288633" }, { "coeff_range": "2", "density": "0.609353234", "feasible": "yes", "file": "brock200-3.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/brock200-3.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/brock200-3.opt.sol", "source_path": "07-independentset/instances/brock200-3.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/brock200-3.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:43:28", "best_numeric": 8.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/brock200-4_summary.csv", "best_value": "8.0", "family": "", "format": ".gph", "id": "07-independentset:brock200-4", "instance": "brock200-4", "paper_context": "MIP, 200 vars, density 0.01, optimal yes; QUBO, 200 vars, density 0.661, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.01", "feasible": "", "file": "brock200-4.lp", "formulation": "MIP", "num_constraints": "13089", "num_vars": "200", "obj_value": "8", "optimal": "yes", "problem_size": "1617.961681" }, { "coeff_range": "2", "density": "0.661144279", "feasible": "yes", "file": "brock200-4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "8", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/brock200-4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/brock200-4.opt.sol", "source_path": "07-independentset/instances/brock200-4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/brock200-4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 16:43:35", "best_numeric": 27.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/brock400-1_summary.csv", "best_value": "27.0", "family": "", "format": ".gph", "id": "07-independentset:brock400-1", "instance": "brock400-1", "paper_context": "MIP, 400 vars, density 0.005, optimal yes; QUBO, 400 vars, density 0.255, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.005", "feasible": "", "file": "brock400-1.lp", "formulation": "MIP", "num_constraints": "20077", "num_vars": "400", "obj_value": "27", "optimal": "yes", "problem_size": "2833.866616" }, { "coeff_range": "2", "density": "0.25532419", "feasible": "yes", "file": "brock400-1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "400", "obj_value": "27", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/brock400-1.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/brock400-1.opt.sol", "source_path": "07-independentset/instances/brock400-1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/brock400-1.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 23.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/brock800-1_summary.csv", "best_value": "23", "family": "", "format": ".gph", "id": "07-independentset:brock800-1", "instance": "brock800-1", "paper_context": "MIP, 800 vars, density 0.0025, optimal yes; QUBO, 800 vars, density 0.352, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.0025", "feasible": "", "file": "brock800-1.lp", "formulation": "MIP", "num_constraints": "112095", "num_vars": "800", "obj_value": "23", "optimal": "yes", "problem_size": "9469.741285" }, { "coeff_range": "2", "density": "0.352356429", "feasible": "yes", "file": "brock800-1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "800", "obj_value": "23", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/brock800-1.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/brock800-1.opt.sol", "source_path": "07-independentset/instances/brock800-1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/brock800-1.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:03", "best_numeric": 18.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/c-fat200-1_summary.csv", "best_value": "18.0", "family": "", "format": ".gph", "id": "07-independentset:c-fat200-1", "instance": "c-fat200-1", "paper_context": "MIP, 200 vars, density 0.01, optimal yes; QUBO, 200 vars, density 0.0863, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.01", "feasible": "", "file": "c-fat200-1.lp", "formulation": "MIP", "num_constraints": "1534", "num_vars": "200", "obj_value": "18", "optimal": "yes", "problem_size": "553.895297" }, { "coeff_range": "2", "density": "0.086268657", "feasible": "yes", "file": "c-fat200-1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "18", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/c-fat200-1.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/c-fat200-1.opt.sol", "source_path": "07-independentset/instances/c-fat200-1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/c-fat200-1.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:06", "best_numeric": 17.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/chesapeake_summary.csv", "best_value": "17.0", "family": "", "format": ".gph", "id": "07-independentset:chesapeake", "instance": "chesapeake", "paper_context": "MIP, 39 vars, density 0.0513, optimal yes; QUBO, 39 vars, density 0.268, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.051282051", "feasible": "", "file": "chesapeake.lp", "formulation": "MIP", "num_constraints": "170", "num_vars": "39", "obj_value": "17", "optimal": "yes", "problem_size": "81.42481194" }, { "coeff_range": "2", "density": "0.267948718", "feasible": "yes", "file": "chesapeake.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "39", "obj_value": "17", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/chesapeake.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/chesapeake.opt.sol", "source_path": "07-independentset/instances/chesapeake.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/chesapeake.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:09", "best_numeric": 60.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/es60fst01_summary.csv", "best_value": "60.0", "family": "", "format": ".gph", "id": "07-independentset:es60fst01", "instance": "es60fst01", "paper_context": "MIP, 123 vars, density 0.0163, optimal yes; QUBO, 123 vars, density 0.037, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.016260163", "feasible": "", "file": "es60fst01.lp", "formulation": "MIP", "num_constraints": "159", "num_vars": "123", "obj_value": "17", "optimal": "yes", "problem_size": "139.8463442" }, { "coeff_range": "2", "density": "0.036978757", "feasible": "yes", "file": "es60fst01.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "123", "obj_value": "17", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/es60fst01.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/es60fst01.opt.sol", "source_path": "07-independentset/instances/es60fst01.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/es60fst01.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:10", "best_numeric": 88.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/es60fst02_summary.csv", "best_value": "88.0", "family": "", "format": ".gph", "id": "07-independentset:es60fst02", "instance": "es60fst02", "paper_context": "MIP, 186 vars, density 0.0108, optimal yes; QUBO, 186 vars, density 0.0268, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.010752688", "feasible": "", "file": "es60fst02.lp", "formulation": "MIP", "num_constraints": "280", "num_vars": "186", "obj_value": "60", "optimal": "yes", "problem_size": "228.2104292" }, { "coeff_range": "2", "density": "0.026795469", "feasible": "yes", "file": "es60fst02.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "186", "obj_value": "60", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/es60fst02.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/es60fst02.opt.sol", "source_path": "07-independentset/instances/es60fst02.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/es60fst02.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:13", "best_numeric": 55.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/es60fst03_summary.csv", "best_value": "55.0", "family": "", "format": ".gph", "id": "07-independentset:es60fst03", "instance": "es60fst03", "paper_context": "MIP, 113 vars, density 0.0177, optimal yes; QUBO, 113 vars, density 0.0396, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.017699115", "feasible": "", "file": "es60fst03.lp", "formulation": "MIP", "num_constraints": "142", "num_vars": "113", "obj_value": "88", "optimal": "yes", "problem_size": "126.6728069" }, { "coeff_range": "2", "density": "0.039590126", "feasible": "yes", "file": "es60fst03.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "113", "obj_value": "88", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/es60fst03.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/es60fst03.opt.sol", "source_path": "07-independentset/instances/es60fst03.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/es60fst03.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:15", "best_numeric": 78.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/es60fst04_summary.csv", "best_value": "78.0", "family": "", "format": ".gph", "id": "07-independentset:es60fst04", "instance": "es60fst04", "paper_context": "MIP, 162 vars, density 0.0123, optimal yes; QUBO, 162 vars, density 0.0303, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.012345679", "feasible": "", "file": "es60fst04.lp", "formulation": "MIP", "num_constraints": "238", "num_vars": "162", "obj_value": "55", "optimal": "yes", "problem_size": "196.3568181" }, { "coeff_range": "2", "density": "0.030296145", "feasible": "yes", "file": "es60fst04.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "162", "obj_value": "55", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/es60fst04.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/es60fst04.opt.sol", "source_path": "07-independentset/instances/es60fst04.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/es60fst04.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:16", "best_numeric": 10.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/farm/farm_summary.csv", "best_value": "10.0", "family": "", "format": ".gph", "id": "07-independentset:farm", "instance": "farm", "paper_context": "MIP, 17 vars, density 0.118, optimal yes; QUBO, 17 vars, density 0.366, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.117647059", "feasible": "", "file": "farm.lp", "formulation": "MIP", "num_constraints": "39", "num_vars": "17", "obj_value": "78", "optimal": "yes", "problem_size": "25.74878638" }, { "coeff_range": "2", "density": "0.366013072", "feasible": "yes", "file": "farm.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "17", "obj_value": "78", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/farm.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/farm.opt.sol", "source_path": "07-independentset/instances/farm.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/farm.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:28:19", "best_numeric": 16.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/football/football_summary.csv", "best_value": "16.0", "family": "", "format": ".gph", "id": "07-independentset:football", "instance": "football", "paper_context": "MIP, 35 vars, density 0.0571, optimal yes; QUBO, 35 vars, density 0.243, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.057142857", "feasible": "", "file": "football.lp", "formulation": "MIP", "num_constraints": "118", "num_vars": "35", "obj_value": "10", "optimal": "yes", "problem_size": "64.26507605" }, { "coeff_range": "2", "density": "0.242857143", "feasible": "yes", "file": "football.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "35", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/football.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/football.opt.sol", "source_path": "07-independentset/instances/football.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/football.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 93.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/frb100-40_summary.csv", "best_value": "93", "family": "", "format": ".gph", "id": "07-independentset:frb100-40", "instance": "frb100-40", "paper_context": "MIP, 4000 vars, density 0.0005, optimal no; QUBO, 4000 vars, density 0.0721, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.0005", "feasible": "", "file": "frb100-40.lp", "formulation": "MIP", "num_constraints": "572774", "num_vars": "4000", "obj_value": "16", "optimal": "no", "problem_size": "47865.3946" }, { "coeff_range": "2", "density": "0.07207873", "feasible": "yes", "file": "frb100-40.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4000", "obj_value": "16", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/frb100-40.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/frb100-40.bst.sol", "source_path": "07-independentset/instances/frb100-40.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/frb100-40.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:42:04", "best_numeric": 44.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/frb45-21-3_summary.csv", "best_value": "44.0", "family": "", "format": ".gph", "id": "07-independentset:frb45-21-3", "instance": "frb45-21-3", "paper_context": "MIP, 945 vars, density 0.00212, optimal yes; QUBO, 945 vars, density 0.132, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.002116402", "feasible": "", "file": "frb45-21-3.lp", "formulation": "MIP", "num_constraints": "58245", "num_vars": "945", "obj_value": "45", "optimal": "yes", "problem_size": "7418.997574" }, { "coeff_range": "2", "density": "0.132420551", "feasible": "yes", "file": "frb45-21-3.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "945", "obj_value": "45", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/frb45-21-3.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/frb45-21-3.opt.sol", "source_path": "07-independentset/instances/frb45-21-3.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/frb45-21-3.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 49.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/frb50-23-3_summary.csv", "best_value": "49", "family": "", "format": ".gph", "id": "07-independentset:frb50-23-3", "instance": "frb50-23-3", "paper_context": "MIP, 1150 vars, density 0.00174, optimal yes; QUBO, 1150 vars, density 0.124, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.00173913", "feasible": "", "file": "frb50-23-3.lp", "formulation": "MIP", "num_constraints": "81068", "num_vars": "1150", "obj_value": "50", "optimal": "yes", "problem_size": "9655.475131" }, { "coeff_range": "2", "density": "0.124229215", "feasible": "yes", "file": "frb50-23-3.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1150", "obj_value": "50", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/frb50-23-3.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/frb50-23-3.opt.sol", "source_path": "07-independentset/instances/frb50-23-3.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/frb50-23-3.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 51.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/frb53-24-1_summary.csv", "best_value": "51", "family": "", "format": ".gph", "id": "07-independentset:frb53-24-1", "instance": "frb53-24-1", "paper_context": "MIP, 1272 vars, density 0.00157, optimal no; QUBO, 1272 vars, density 0.118, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.001572327", "feasible": "", "file": "frb53-24-1.lp", "formulation": "MIP", "num_constraints": "94227", "num_vars": "1272", "obj_value": "52", "optimal": "no", "problem_size": "10947.91049" }, { "coeff_range": "2", "density": "0.117954172", "feasible": "yes", "file": "frb53-24-1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1272", "obj_value": "52", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/frb53-24-1.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/frb53-24-1.bst.sol", "source_path": "07-independentset/instances/frb53-24-1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/frb53-24-1.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 17:55:06", "best_numeric": 56.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/frb59-26-2_summary.csv", "best_value": "56.0", "family": "", "format": ".gph", "id": "07-independentset:frb59-26-2", "instance": "frb59-26-2", "paper_context": "MIP, 1534 vars, density 0.0013, optimal no; QUBO, 1534 vars, density 0.108, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.001303781", "feasible": "", "file": "frb59-26-2.lp", "formulation": "MIP", "num_constraints": "126163", "num_vars": "1534", "obj_value": "58", "optimal": "no", "problem_size": "13911.6513" }, { "coeff_range": "2", "density": "0.108461836", "feasible": "yes", "file": "frb59-26-2.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1534", "obj_value": "58", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/frb59-26-2.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/frb59-26-2.bst.sol", "source_path": "07-independentset/instances/frb59-26-2.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/frb59-26-2.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:02:44", "best_numeric": 44.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv", "best_value": "44.0", "family": "", "format": ".gph", "id": "07-independentset:gen200_p0-9_44", "instance": "gen200_p0-9_44", "paper_context": "MIP, 200 vars, density 0.01, optimal yes; QUBO, 200 vars, density 0.109, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.01", "feasible": "", "file": "gen200_p0-9_44.lp", "formulation": "MIP", "num_constraints": "1990", "num_vars": "200", "obj_value": "94", "optimal": "yes", "problem_size": "630.8724118" }, { "coeff_range": "2", "density": "0.108955224", "feasible": "yes", "file": "gen200_p0-9_44.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "200", "obj_value": "94", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/gen200_p0-9_44.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/gen200_p0-9_44.opt.sol", "source_path": "07-independentset/instances/gen200_p0-9_44.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/gen200_p0-9_44.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:02:47", "best_numeric": 40.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/hamming10-4_summary.csv", "best_value": "40.0", "family": "", "format": ".gph", "id": "07-independentset:hamming10-4", "instance": "hamming10-4", "paper_context": "MIP, 1024 vars, density 0.00195, optimal no; QUBO, 1024 vars, density 0.173, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.001953125", "feasible": "", "file": "hamming10-4.lp", "formulation": "MIP", "num_constraints": "89600", "num_vars": "1024", "obj_value": "44", "optimal": "no", "problem_size": "9578.64291" }, { "coeff_range": "2", "density": "0.172682927", "feasible": "yes", "file": "hamming10-4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1024", "obj_value": "44", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/hamming10-4.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/hamming10-4.bst.sol", "source_path": "07-independentset/instances/hamming10-4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/hamming10-4.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:13", "best_numeric": 2.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/hamming6-2_summary.csv", "best_value": "2.0", "family": "", "format": ".gph", "id": "07-independentset:hamming6-2", "instance": "hamming6-2", "paper_context": "MIP, 64 vars, density 0.0312, optimal yes; QUBO, 64 vars, density 0.908, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.03125", "feasible": "", "file": "hamming6-2.lp", "formulation": "MIP", "num_constraints": "1824", "num_vars": "64", "obj_value": "2", "optimal": "yes", "problem_size": "341.6665041" }, { "coeff_range": "2", "density": "0.907692308", "feasible": "yes", "file": "hamming6-2.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "64", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/hamming6-2.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/hamming6-2.opt.sol", "source_path": "07-independentset/instances/hamming6-2.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/hamming6-2.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:16", "best_numeric": 12.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/hamming6-4_summary.csv", "best_value": "12.0", "family": "", "format": ".gph", "id": "07-independentset:hamming6-4", "instance": "hamming6-4", "paper_context": "MIP, 64 vars, density 0.0312, optimal yes; QUBO, 64 vars, density 0.369, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.03125", "feasible": "", "file": "hamming6-4.lp", "formulation": "MIP", "num_constraints": "704", "num_vars": "64", "obj_value": "12", "optimal": "yes", "problem_size": "212.2639866" }, { "coeff_range": "2", "density": "0.369230769", "feasible": "yes", "file": "hamming6-4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "64", "obj_value": "12", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/hamming6-4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/hamming6-4.opt.sol", "source_path": "07-independentset/instances/hamming6-4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/hamming6-4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:20", "best_numeric": 13.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/ibm32_summary.csv", "best_value": "13.0", "family": "", "format": ".gph", "id": "07-independentset:ibm32", "instance": "ibm32", "paper_context": "MIP, 32 vars, density 0.0625, optimal yes; QUBO, 32 vars, density 0.231, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.0625", "feasible": "", "file": "ibm32.lp", "formulation": "MIP", "num_constraints": "90", "num_vars": "32", "obj_value": "40", "optimal": "yes", "problem_size": "53.66563146" }, { "coeff_range": "2", "density": "0.231060606", "feasible": "yes", "file": "ibm32.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "32", "obj_value": "40", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/ibm32.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/ibm32.opt.sol", "source_path": "07-independentset/instances/ibm32.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/ibm32.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:21", "best_numeric": 6.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv", "best_value": "6.0", "family": "", "format": ".gph", "id": "07-independentset:insecta-ant-colony1-day38", "instance": "insecta-ant-colony1-day38", "paper_context": "MIP, 56 vars, density 0.0357, optimal yes; QUBO, 56 vars, density 0.746, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.035714286", "feasible": "", "file": "insecta-ant-colony1-day38.lp", "formulation": "MIP", "num_constraints": "1134", "num_vars": "56", "obj_value": "88", "optimal": "yes", "problem_size": "252" }, { "coeff_range": "2", "density": "0.745614035", "feasible": "yes", "file": "insecta-ant-colony1-day38.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "56", "obj_value": "88", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/insecta-ant-colony1-day38.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/insecta-ant-colony1-day38.opt.sol", "source_path": "07-independentset/instances/insecta-ant-colony1-day38.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/insecta-ant-colony1-day38.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:23", "best_numeric": 9.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv", "best_value": "9.0", "family": "", "format": ".gph", "id": "07-independentset:insecta-ant-colony3-day09", "instance": "insecta-ant-colony3-day09", "paper_context": "MIP, 160 vars, density 0.0125, optimal yes; QUBO, 160 vars, density 0.702, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.0125", "feasible": "", "file": "insecta-ant-colony3-day09.lp", "formulation": "MIP", "num_constraints": "8883", "num_vars": "160", "obj_value": "6", "optimal": "yes", "problem_size": "1192.174484" }, { "coeff_range": "2", "density": "0.702096273", "feasible": "yes", "file": "insecta-ant-colony3-day09.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "160", "obj_value": "6", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/insecta-ant-colony3-day09.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/insecta-ant-colony3-day09.opt.sol", "source_path": "07-independentset/instances/insecta-ant-colony3-day09.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/insecta-ant-colony3-day09.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:26", "best_numeric": 15.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/johnson16-2-4_summary.csv", "best_value": "15.0", "family": "", "format": ".gph", "id": "07-independentset:johnson16-2-4", "instance": "johnson16-2-4", "paper_context": "MIP, 120 vars, density 0.0167, optimal yes; QUBO, 120 vars, density 0.769, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.016666667", "feasible": "", "file": "johnson16-2-4.lp", "formulation": "MIP", "num_constraints": "5460", "num_vars": "120", "obj_value": "15", "optimal": "yes", "problem_size": "809.4442538" }, { "coeff_range": "2", "density": "0.768595041", "feasible": "yes", "file": "johnson16-2-4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "120", "obj_value": "15", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/johnson16-2-4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/johnson16-2-4.opt.sol", "source_path": "07-independentset/instances/johnson16-2-4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/johnson16-2-4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:29", "best_numeric": 7.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/johnson8-2-4_summary.csv", "best_value": "7.0", "family": "", "format": ".gph", "id": "07-independentset:johnson8-2-4", "instance": "johnson8-2-4", "paper_context": "MIP, 28 vars, density 0.0714, optimal yes; QUBO, 28 vars, density 0.586, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.071428571", "feasible": "", "file": "johnson8-2-4.lp", "formulation": "MIP", "num_constraints": "210", "num_vars": "28", "obj_value": "7", "optimal": "yes", "problem_size": "76.68115805" }, { "coeff_range": "2", "density": "0.586206897", "feasible": "yes", "file": "johnson8-2-4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "28", "obj_value": "7", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/johnson8-2-4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/johnson8-2-4.opt.sol", "source_path": "07-independentset/instances/johnson8-2-4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/johnson8-2-4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:32", "best_numeric": 5.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/johnson8-4-4_summary.csv", "best_value": "5.0", "family": "", "format": ".gph", "id": "07-independentset:johnson8-4-4", "instance": "johnson8-4-4", "paper_context": "MIP, 70 vars, density 0.0286, optimal yes; QUBO, 70 vars, density 0.775, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.028571429", "feasible": "", "file": "johnson8-4-4.lp", "formulation": "MIP", "num_constraints": "1855", "num_vars": "70", "obj_value": "5", "optimal": "yes", "problem_size": "360.3470549" }, { "coeff_range": "2", "density": "0.774647887", "feasible": "yes", "file": "johnson8-4-4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "70", "obj_value": "5", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/johnson8-4-4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/johnson8-4-4.opt.sol", "source_path": "07-independentset/instances/johnson8-4-4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/johnson8-4-4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:34", "best_numeric": 20.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/karate/karate_summary.csv", "best_value": "20.0", "family": "", "format": ".gph", "id": "07-independentset:karate", "instance": "karate", "paper_context": "MIP, 34 vars, density 0.0588, optimal yes; QUBO, 34 vars, density 0.188, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.058823529", "feasible": "", "file": "karate.lp", "formulation": "MIP", "num_constraints": "78", "num_vars": "34", "obj_value": "9", "optimal": "yes", "problem_size": "51.49757276" }, { "coeff_range": "2", "density": "0.188235294", "feasible": "yes", "file": "karate.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "34", "obj_value": "9", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/karate.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/karate.opt.sol", "source_path": "07-independentset/instances/karate.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/karate.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:10:38", "best_numeric": 11.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller4/keller4_summary.csv", "best_value": "11.0", "family": "", "format": ".gph", "id": "07-independentset:keller4", "instance": "keller4", "paper_context": "MIP, 171 vars, density 0.0117, optimal yes; QUBO, 171 vars, density 0.358, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.011695906", "feasible": "", "file": "keller4.lp", "formulation": "MIP", "num_constraints": "5100", "num_vars": "171", "obj_value": "20", "optimal": "yes", "problem_size": "933.862945" }, { "coeff_range": "2", "density": "0.358425133", "feasible": "yes", "file": "keller4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "171", "obj_value": "20", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/keller4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/keller4.opt.sol", "source_path": "07-independentset/instances/keller4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/keller4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 59.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller6/keller6_summary.csv", "best_value": "59", "family": "", "format": ".gph", "id": "07-independentset:keller6", "instance": "keller6", "paper_context": "MIP, 3361 vars, density 0.000595, optimal no; QUBO, 3361 vars, density 0.182, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.000595061", "feasible": "", "file": "keller6.lp", "formulation": "MIP", "num_constraints": "1026582", "num_vars": "3361", "obj_value": "11", "optimal": "no", "problem_size": "58739.61272" }, { "coeff_range": "2", "density": "0.182295927", "feasible": "yes", "file": "keller6.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3361", "obj_value": "11", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/keller6.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/keller6.bst.sol", "source_path": "07-independentset/instances/keller6.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/keller6.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 18:44:07", "best_numeric": 4.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv", "best_value": "4.0", "family": "", "format": ".gph", "id": "07-independentset:mammalia-kangaroo-interactions", "instance": "mammalia-kangaroo-interactions", "paper_context": "MIP, 17 vars, density 0.118, optimal yes; QUBO, 17 vars, density 0.706, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.117647059", "feasible": "", "file": "mammalia-kangaroo-interactions.lp", "formulation": "MIP", "num_constraints": "91", "num_vars": "17", "obj_value": "59", "optimal": "yes", "problem_size": "39.33192088" }, { "coeff_range": "2", "density": "0.705882353", "feasible": "yes", "file": "mammalia-kangaroo-interactions.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "17", "obj_value": "59", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/mammalia-kangaroo-interactions.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/mammalia-kangaroo-interactions.opt.sol", "source_path": "07-independentset/instances/mammalia-kangaroo-interactions.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/mammalia-kangaroo-interactions.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 4, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 12.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/p_hat1500-1_summary.csv", "best_value": "12", "family": "", "format": ".gph", "id": "07-independentset:p_hat1500-1", "instance": "p_hat1500-1", "paper_context": "MIP, 1500 vars, density 0.00133, optimal yes; QUBO, 1500 vars, density 0.747, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.001333333", "feasible": "", "file": "p_hat1500-1.lp", "formulation": "MIP", "num_constraints": "839327", "num_vars": "1500", "obj_value": "4", "optimal": "yes", "problem_size": "35482.25613" }, { "coeff_range": "2", "density": "0.746903842", "feasible": "yes", "file": "p_hat1500-1.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1500", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/p_hat1500-1.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/p_hat1500-1.opt.sol", "source_path": "07-independentset/instances/p_hat1500-1.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/p_hat1500-1.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 19:14:03", "best_numeric": 94.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/p_hat1500-3_summary.csv", "best_value": "94.0", "family": "", "format": ".gph", "id": "07-independentset:p_hat1500-3", "instance": "p_hat1500-3", "paper_context": "MIP, 1500 vars, density 0.00133, optimal yes; QUBO, 1500 vars, density 0.247, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.001333333", "feasible": "", "file": "p_hat1500-3.lp", "formulation": "MIP", "num_constraints": "277006", "num_vars": "1500", "obj_value": "12", "optimal": "yes", "problem_size": "20384.03787" }, { "coeff_range": "2", "density": "0.247395958", "feasible": "yes", "file": "p_hat1500-3.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1500", "obj_value": "12", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/p_hat1500-3.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/p_hat1500-3.opt.sol", "source_path": "07-independentset/instances/p_hat1500-3.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/p_hat1500-3.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 19:18:47", "best_numeric": 16.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv", "best_value": "16.0", "family": "", "format": ".gph", "id": "07-independentset:sloane_1dc_128", "instance": "sloane_1dc_128", "paper_context": "MIP, 128 vars, density 0.0156, optimal yes; QUBO, 128 vars, density 0.194, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.015625", "feasible": "", "file": "sloane_1dc_128.lp", "formulation": "MIP", "num_constraints": "1471", "num_vars": "128", "obj_value": "117", "optimal": "yes", "problem_size": "433.9216519" }, { "coeff_range": "2", "density": "0.193677326", "feasible": "yes", "file": "sloane_1dc_128.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "128", "obj_value": "117", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/sloane_1dc_128.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/sloane_1dc_128.opt.sol", "source_path": "07-independentset/instances/sloane_1dc_128.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/sloane_1dc_128.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 19:18:49", "best_numeric": 10.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv", "best_value": "10.0", "family": "", "format": ".gph", "id": "07-independentset:sloane_1dc_64", "instance": "sloane_1dc_64", "paper_context": "MIP, 64 vars, density 0.0312, optimal yes; QUBO, 64 vars, density 0.292, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.03125", "feasible": "", "file": "sloane_1dc_64.lp", "formulation": "MIP", "num_constraints": "543", "num_vars": "64", "obj_value": "10", "optimal": "yes", "problem_size": "186.4188832" }, { "coeff_range": "2", "density": "0.291826923", "feasible": "yes", "file": "sloane_1dc_64.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "64", "obj_value": "10", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/sloane_1dc_64.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/sloane_1dc_64.opt.sol", "source_path": "07-independentset/instances/sloane_1dc_64.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/sloane_1dc_64.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 19:18:52", "best_numeric": 18.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv", "best_value": "18.0", "family": "", "format": ".gph", "id": "07-independentset:sloane_1zc_128", "instance": "sloane_1zc_128", "paper_context": "MIP, 128 vars, density 0.0156, optimal yes; QUBO, 128 vars, density 0.151, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.015625", "feasible": "", "file": "sloane_1zc_128.lp", "formulation": "MIP", "num_constraints": "1120", "num_vars": "128", "obj_value": "16", "optimal": "yes", "problem_size": "378.6291061" }, { "coeff_range": "2", "density": "0.151162791", "feasible": "yes", "file": "sloane_1zc_128.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "128", "obj_value": "16", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/sloane_1zc_128.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/sloane_1zc_128.opt.sol", "source_path": "07-independentset/instances/sloane_1zc_128.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/sloane_1zc_128.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 19:18:55", "best_numeric": 5.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv", "best_value": "5.0", "family": "", "format": ".gph", "id": "07-independentset:sloane_2dc_128", "instance": "sloane_2dc_128", "paper_context": "MIP, 128 vars, density 0.0156, optimal yes; QUBO, 128 vars, density 0.642, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.015625", "feasible": "", "file": "sloane_2dc_128.lp", "formulation": "MIP", "num_constraints": "5173", "num_vars": "128", "obj_value": "18", "optimal": "yes", "problem_size": "813.7223114" }, { "coeff_range": "2", "density": "0.642078488", "feasible": "yes", "file": "sloane_2dc_128.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "128", "obj_value": "18", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/sloane_2dc_128.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/sloane_2dc_128.opt.sol", "source_path": "07-independentset/instances/sloane_2dc_128.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/sloane_2dc_128.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "2025-07-15 19:18:58", "best_numeric": 282.0, "best_submission": "20250715_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/socfb-haverford76_summary.csv", "best_value": "282.0", "family": "", "format": ".gph", "id": "07-independentset:socfb-haverford76", "instance": "socfb-haverford76", "paper_context": "MIP, 1446 vars, density 0.00138, optimal no; QUBO, 1446 vars, density 0.0583, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.001383126", "feasible": "", "file": "socfb-haverford76.lp", "formulation": "MIP", "num_constraints": "59589", "num_vars": "1446", "obj_value": "5", "optimal": "no", "problem_size": "9282.547818" }, { "coeff_range": "2", "density": "0.058340765", "feasible": "yes", "file": "socfb-haverford76.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "1446", "obj_value": "5", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/socfb-haverford76.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/socfb-haverford76.bst.sol", "source_path": "07-independentset/instances/socfb-haverford76.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/socfb-haverford76.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 499.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/socfb-trinity100_summary.csv", "best_value": "499", "family": "", "format": ".gph", "id": "07-independentset:socfb-trinity100", "instance": "socfb-trinity100", "paper_context": "MIP, 2613 vars, density 0.000765, optimal no; QUBO, 2613 vars, density 0.0336, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.000765404", "feasible": "", "file": "socfb-trinity100.lp", "formulation": "MIP", "num_constraints": "111996", "num_vars": "2613", "obj_value": "282", "optimal": "no", "problem_size": "17106.88598" }, { "coeff_range": "2", "density": "0.033558592", "feasible": "yes", "file": "socfb-trinity100.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2613", "obj_value": "282", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/socfb-trinity100.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/socfb-trinity100.bst.sol", "source_path": "07-independentset/instances/socfb-trinity100.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/socfb-trinity100.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 24.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/sorrell4_summary.csv", "best_value": "24", "family": "", "format": ".gph", "id": "07-independentset:sorrell4", "instance": "sorrell4", "paper_context": "MIP, 2048 vars, density 0.000977, optimal yes; QUBO, 2048 vars, density 0.241, optimal yes", "paper_metrics": [ { "coeff_range": "1", "density": "0.000976563", "feasible": "", "file": "sorrell4.lp", "formulation": "MIP", "num_constraints": "504451", "num_vars": "2048", "obj_value": "499", "optimal": "yes", "problem_size": "32142.11642" }, { "coeff_range": "2", "density": "0.241399673", "feasible": "yes", "file": "sorrell4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2048", "obj_value": "499", "optimal": "yes", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/sorrell4.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/sorrell4.opt.sol", "source_path": "07-independentset/instances/sorrell4.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/sorrell4.gph", "status": "optimal", "status_label": "Optimal", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "15. Jul. 2025", "best_numeric": 189.0, "best_submission": "20250715_Abs2_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/sorrell7_summary.csv", "best_value": "189", "family": "", "format": ".gph", "id": "07-independentset:sorrell7", "instance": "sorrell7", "paper_context": "MIP, 2048 vars, density 0.000977, optimal no; QUBO, 2048 vars, density 0.0198, optimal no", "paper_metrics": [ { "coeff_range": "1", "density": "0.000976563", "feasible": "", "file": "sorrell7.lp", "formulation": "MIP", "num_constraints": "39424", "num_vars": "2048", "obj_value": "24", "optimal": "no", "problem_size": "8985.563533" }, { "coeff_range": "2", "density": "0.019765739", "feasible": "yes", "file": "sorrell7.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "2048", "obj_value": "24", "optimal": "no", "problem_size": "" } ], "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "problem_why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.", "solution_path": "07-independentset/solutions/sorrell7.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions/sorrell7.bst.sol", "source_path": "07-independentset/instances/sorrell7.gph", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances/sorrell7.gph", "status": "best_known", "status_label": "Best known", "submission_count": 2, "why_care": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points." }, { "best_date": "06. Dec. 2024", "best_numeric": 65500.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network05/network05_summary.csv", "best_value": "65500.0", "family": "", "format": "", "id": "08-network:network05", "instance": "network05", "paper_context": "MIP, 101 vars, density 0.0335, optimal yes; QUBO, 3640 vars, density 0.0527, optimal yes", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.033511043", "feasible": "", "file": "network05.lp", "formulation": "MIP", "num_constraints": "130", "num_vars": "101", "obj_value": "65500", "optimal": "yes", "problem_size": "114.5862121" }, { "coeff_range": "5.00E+18", "density": "0.05271013", "feasible": "yes", "file": "network05.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "3640", "obj_value": "65500", "optimal": "yes", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network05.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network05.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 101000.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network06/network06_summary.csv", "best_value": "101000.0", "family": "", "format": "", "id": "08-network:network06", "instance": "network06", "paper_context": "MIP, 181 vars, density 0.0202, optimal yes; QUBO, 6650 vars, density 0.036, optimal yes", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.02015828", "feasible": "", "file": "network06.lp", "formulation": "MIP", "num_constraints": "222", "num_vars": "181", "obj_value": "101000", "optimal": "yes", "problem_size": "200.4544836" }, { "coeff_range": "7.26E+18", "density": "0.035978987", "feasible": "yes", "file": "network06.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "6650", "obj_value": "101000", "optimal": "yes", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network06.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network06.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 142400.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network07/network07_summary.csv", "best_value": "142400.0", "family": "", "format": "", "id": "08-network:network07", "instance": "network07", "paper_context": "MIP, 295 vars, density 0.013, optimal yes; QUBO, 10982 vars, density 0.0262, optimal yes", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.013016949", "feasible": "", "file": "network07.lp", "formulation": "MIP", "num_constraints": "350", "num_vars": "295", "obj_value": "142400", "optimal": "yes", "problem_size": "321.3253803" }, { "coeff_range": "9.98E+18", "density": "0.026172499", "feasible": "yes", "file": "network07.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "10982", "obj_value": "142400", "optimal": "yes", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network07.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network07.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 170231.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network08/network08_summary.csv", "best_value": "170231.0", "family": "", "format": "", "id": "08-network:network08", "instance": "network08", "paper_context": "MIP, 449 vars, density 0.00887, optimal yes; QUBO, 16876 vars, density 0.0199, optimal yes", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.008874422", "feasible": "", "file": "network08.lp", "formulation": "MIP", "num_constraints": "520", "num_vars": "449", "obj_value": "170231", "optimal": "yes", "problem_size": "483.1976821" }, { "coeff_range": "1.31E+19", "density": "0.019913765", "feasible": "yes", "file": "network08.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "16876", "obj_value": "170231", "optimal": "yes", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network08.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network08.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 196750.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network09/network09_summary.csv", "best_value": "196750.0", "family": "", "format": "", "id": "08-network:network09", "instance": "network09", "paper_context": "MIP, 649 vars, density 0.00631, optimal yes; QUBO, 24572 vars, density 0.0157, optimal yes", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.006313653", "feasible": "", "file": "network09.lp", "formulation": "MIP", "num_constraints": "738", "num_vars": "649", "obj_value": "196750", "optimal": "yes", "problem_size": "692.0708056" }, { "coeff_range": "1.68E+19", "density": "0.015668782", "feasible": "yes", "file": "network09.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "24572", "obj_value": "196750", "optimal": "yes", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network09.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network09.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 210800.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network10/network10_summary.csv", "best_value": "210800.0", "family": "", "format": "", "id": "08-network:network10", "instance": "network10", "paper_context": "MIP, 901 vars, density 0.00465, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.004648301", "feasible": "", "file": "network10.lp", "formulation": "MIP", "num_constraints": "1010", "num_vars": "901", "obj_value": "210800", "optimal": "yes", "problem_size": "953.9444428" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network10.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "210800", "optimal": "yes", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network10.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network10.opt.sol", "source_path": "", "source_url": "", "status": "optimal", "status_label": "Optimal", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 240818.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network11/network11_summary.csv", "best_value": "240818.0", "family": "", "format": "", "id": "08-network:network11", "instance": "network11", "paper_context": "MIP, 1211 vars, density 0.00352, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.003519649", "feasible": "", "file": "network11.lp", "formulation": "MIP", "num_constraints": "1342", "num_vars": "1211", "obj_value": "238334", "optimal": "no", "problem_size": "1274.818418" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network11.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "238334", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network11.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network11.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 285643.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network12/network12_summary.csv", "best_value": "285643.0", "family": "", "format": "", "id": "08-network:network12", "instance": "network12", "paper_context": "MIP, 1585 vars, density 0.00273, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.002728163", "feasible": "", "file": "network12.lp", "formulation": "MIP", "num_constraints": "1740", "num_vars": "1585", "obj_value": "276474", "optimal": "no", "problem_size": "1660.692627" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network12.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "276474", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network12.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network12.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 313000.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network13/network13_summary.csv", "best_value": "313000.0", "family": "", "format": "", "id": "08-network:network13", "instance": "network13", "paper_context": "MIP, 2029 vars, density 0.00216, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.002156959", "feasible": "", "file": "network13.lp", "formulation": "MIP", "num_constraints": "2210", "num_vars": "2029", "obj_value": "304116", "optimal": "no", "problem_size": "2117.567" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network13.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "304116", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network13.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network13.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 367899.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network14/network14_summary.csv", "best_value": "367899.0", "family": "", "format": "", "id": "08-network:network14", "instance": "network14", "paper_context": "MIP, 2549 vars, density 0.00173, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.001734531", "feasible": "", "file": "network14.lp", "formulation": "MIP", "num_constraints": "2758", "num_vars": "2549", "obj_value": "350173", "optimal": "no", "problem_size": "2651.441495" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network14.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "350173", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network14.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network14.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 397000.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network15/network15_summary.csv", "best_value": "397000.0", "family": "", "format": "", "id": "08-network:network15", "instance": "network15", "paper_context": "MIP, 3151 vars, density 0.00142, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.00141548", "feasible": "", "file": "network15.lp", "formulation": "MIP", "num_constraints": "3390", "num_vars": "3151", "obj_value": "383000", "optimal": "no", "problem_size": "3268.31608" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network15.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "383000", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network15.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network15.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 430000.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network16/network16_summary.csv", "best_value": "430000.0", "family": "", "format": "", "id": "08-network:network16", "instance": "network16", "paper_context": "MIP, 3841 vars, density 0.00117, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.00117005", "feasible": "", "file": "network16.lp", "formulation": "MIP", "num_constraints": "4112", "num_vars": "3841", "obj_value": "409067", "optimal": "no", "problem_size": "3974.190735" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network16.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "409067", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network16.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network16.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 488699.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network17/network17_summary.csv", "best_value": "488699.0", "family": "", "format": "", "id": "08-network:network17", "instance": "network17", "paper_context": "MIP, 4625 vars, density 0.000978, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000978192", "feasible": "", "file": "network17.lp", "formulation": "MIP", "num_constraints": "4930", "num_vars": "4625", "obj_value": "460182", "optimal": "no", "problem_size": "4775.065445" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network17.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "460182", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network17.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network17.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 517398.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network18/network18_summary.csv", "best_value": "517398.0", "family": "", "format": "", "id": "08-network:network18", "instance": "network18", "paper_context": "MIP, 5509 vars, density 0.000826, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000826061", "feasible": "", "file": "network18.lp", "formulation": "MIP", "num_constraints": "5850", "num_vars": "5509", "obj_value": "481950", "optimal": "no", "problem_size": "5676.940197" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network18.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "481950", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network18.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network18.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 565570.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network19/network19_summary.csv", "best_value": "565570.0", "family": "", "format": "", "id": "08-network:network19", "instance": "network19", "paper_context": "MIP, 6499 vars, density 0.000704, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000703891", "feasible": "", "file": "network19.lp", "formulation": "MIP", "num_constraints": "6878", "num_vars": "6499", "obj_value": "514625", "optimal": "no", "problem_size": "6685.814984" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network19.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "514625", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network19.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network19.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 570974.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network20/network20_summary.csv", "best_value": "570974.0", "family": "", "format": "", "id": "08-network:network20", "instance": "network20", "paper_context": "MIP, 7601 vars, density 0.000605, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000604659", "feasible": "", "file": "network20.lp", "formulation": "MIP", "num_constraints": "8020", "num_vars": "7601", "obj_value": "548536", "optimal": "no", "problem_size": "7807.689799" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network20.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "548536", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network20.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network20.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 641249.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network21/network21_summary.csv", "best_value": "641249.0", "family": "", "format": "", "id": "08-network:network21", "instance": "network21", "paper_context": "MIP, 8821 vars, density 0.000523, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000523227", "feasible": "", "file": "network21.lp", "formulation": "MIP", "num_constraints": "9282", "num_vars": "8821", "obj_value": "593000", "optimal": "no", "problem_size": "9048.564638" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network21.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "593000", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network21.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network21.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 709597.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network22/network22_summary.csv", "best_value": "709597.0", "family": "", "format": "", "id": "08-network:network22", "instance": "network22", "paper_context": "MIP, 10165 vars, density 0.000456, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000455779", "feasible": "", "file": "network22.lp", "formulation": "MIP", "num_constraints": "10670", "num_vars": "10165", "obj_value": "647594", "optimal": "no", "problem_size": "10414.4395" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network22.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "647594", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network22.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network22.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 749923.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network23/network23_summary.csv", "best_value": "749923.0", "family": "", "format": "", "id": "08-network:network23", "instance": "network23", "paper_context": "MIP, 11639 vars, density 0.000399, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.000399438", "feasible": "", "file": "network23.lp", "formulation": "MIP", "num_constraints": "12190", "num_vars": "11639", "obj_value": "686453", "optimal": "no", "problem_size": "11911.31437" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network23.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "686453", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network23.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network23.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "06. Dec. 2024", "best_numeric": 779410.0, "best_submission": "20250102_Gurobi_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network24/network24_summary.csv", "best_value": "779410.0", "family": "", "format": "", "id": "08-network:network24", "instance": "network24", "paper_context": "MIP, 13249 vars, density 0.000352, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "1000001", "density": "0.00035201", "feasible": "", "file": "network24.lp", "formulation": "MIP", "num_constraints": "13848", "num_vars": "13249", "obj_value": "663688", "optimal": "no", "problem_size": "13545.18926" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "network24.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "663688", "optimal": "no", "problem_size": "" } ], "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "problem_why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.", "solution_path": "08-network/solutions/network24.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions/network24.bst.sol", "source_path": "", "source_url": "", "status": "best_known", "status_label": "Best known", "submission_count": 1, "why_care": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-01", "instance": "XSH-n20-k4-01", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "332", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-01.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "646", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "20300000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-01.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "646", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-01.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-01.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-01.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-01.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-02", "instance": "XSH-n20-k4-02", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4521 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "289", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-02.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "650", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "12500000000", "density": "0.01173804", "feasible": "yes", "file": "XSH-n20-k4-02.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4521", "obj_value": "650", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-02.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-02.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-02.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-02.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-03", "instance": "XSH-n20-k4-03", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4974 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "380", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-03.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "508", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "19200000000", "density": "0.01165821", "feasible": "yes", "file": "XSH-n20-k4-03.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4974", "obj_value": "508", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-03.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-03.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-03.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-03.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-04", "instance": "XSH-n20-k4-04", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4977 vars, density 0.0116, optimal yes", "paper_metrics": [ { "coeff_range": "400", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-04.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "776", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "34300000000", "density": "0.01164852", "feasible": "yes", "file": "XSH-n20-k4-04.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4977", "obj_value": "776", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-04.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-04.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-04.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-04.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-05", "instance": "XSH-n20-k4-05", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4973 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "368", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-05.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "702", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "31800000000", "density": "0.01166144", "feasible": "yes", "file": "XSH-n20-k4-05.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4973", "obj_value": "702", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-05.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-05.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-05.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-05.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-06", "instance": "XSH-n20-k4-06", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "293", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-06.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "690", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "17000000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-06.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "690", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-06.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-06.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-06.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-06.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-07", "instance": "XSH-n20-k4-07", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "310", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-07.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "730", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "22000000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-07.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "730", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-07.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-07.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-07.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-07.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-08", "instance": "XSH-n20-k4-08", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4522 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "278", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-08.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "718", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "10600000000", "density": "0.01173441", "feasible": "yes", "file": "XSH-n20-k4-08.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4522", "obj_value": "718", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-08.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-08.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-08.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-08.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-09", "instance": "XSH-n20-k4-09", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4522 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "278", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-09.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "707", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "10600000000", "density": "0.01173441", "feasible": "yes", "file": "XSH-n20-k4-09.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4522", "obj_value": "707", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-09.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-09.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-09.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-09.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-10", "instance": "XSH-n20-k4-10", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "338", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-10.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "737", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "26200000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-10.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "737", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-10.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-10.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-10.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-10.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-11", "instance": "XSH-n20-k4-11", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "351", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-11.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "914", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "35500000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-11.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "914", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-11.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-11.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-11.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-11.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-12", "instance": "XSH-n20-k4-12", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "345", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-12.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "709", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "33200000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-12.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "709", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-12.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-12.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-12.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-12.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-13", "instance": "XSH-n20-k4-13", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4523 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "290", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-13.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "628", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "11900000000", "density": "0.01173079", "feasible": "yes", "file": "XSH-n20-k4-13.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4523", "obj_value": "628", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-13.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-13.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-13.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-13.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-14", "instance": "XSH-n20-k4-14", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4971 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "368", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-14.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "696", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "35600000000", "density": "0.01166792", "feasible": "yes", "file": "XSH-n20-k4-14.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4971", "obj_value": "696", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-14.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-14.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-14.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-14.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-15", "instance": "XSH-n20-k4-15", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4970 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "357", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-15.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "780", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "35400000000", "density": "0.01167115", "feasible": "yes", "file": "XSH-n20-k4-15.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4970", "obj_value": "780", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-15.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-15.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-15.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-15.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-16", "instance": "XSH-n20-k4-16", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "326", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-16.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "830", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "23700000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-16.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "830", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-16.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-16.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-16.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-16.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-17", "instance": "XSH-n20-k4-17", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "340", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-17.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "605", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "30200000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-17.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "605", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-17.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-17.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-17.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-17.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-18", "instance": "XSH-n20-k4-18", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4970 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "354", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-18.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "997", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "41300000000", "density": "0.01167115", "feasible": "yes", "file": "XSH-n20-k4-18.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4970", "obj_value": "997", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-18.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-18.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-18.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-18.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-19", "instance": "XSH-n20-k4-19", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4972 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "365", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-19.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "976", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "41100000000", "density": "0.01166468", "feasible": "yes", "file": "XSH-n20-k4-19.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4972", "obj_value": "976", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-19.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-19.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-19.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-19.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-20", "instance": "XSH-n20-k4-20", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4971 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "373", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-20.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "648", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "31100000000", "density": "0.01166792", "feasible": "yes", "file": "XSH-n20-k4-20.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4971", "obj_value": "648", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-20.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-20.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-20.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-20.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-21", "instance": "XSH-n20-k4-21", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4975 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "371", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-21.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "842", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "26100000000", "density": "0.01165498", "feasible": "yes", "file": "XSH-n20-k4-21.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4975", "obj_value": "842", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-21.bst.sol", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-21.bst.sol", "source_path": "09-routing/instances/XSH-n20-k4-21.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-21.vrp", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-22", "instance": "XSH-n20-k4-22", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "351", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-22.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "760", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "39300000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-22.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "760", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-22.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-22.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-22.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-22.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-23", "instance": "XSH-n20-k4-23", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4970 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "358", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-23.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "851", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "38200000000", "density": "0.01167115", "feasible": "yes", "file": "XSH-n20-k4-23.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4970", "obj_value": "851", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-23.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-23.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-23.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-23.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-24", "instance": "XSH-n20-k4-24", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4524 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "304", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-24.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "725", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "14800000000", "density": "0.01172717", "feasible": "yes", "file": "XSH-n20-k4-24.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4524", "obj_value": "725", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-24.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-24.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-24.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-24.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-25", "instance": "XSH-n20-k4-25", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "333", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-25.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "462", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "19300000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-25.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "462", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-25.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-25.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-25.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-25.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-26", "instance": "XSH-n20-k4-26", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4977 vars, density 0.0116, optimal yes", "paper_metrics": [ { "coeff_range": "399", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-26.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "688", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "40600000000", "density": "0.01164852", "feasible": "yes", "file": "XSH-n20-k4-26.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4977", "obj_value": "688", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-26.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-26.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-26.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-26.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-27", "instance": "XSH-n20-k4-27", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "338", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-27.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "540", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "23800000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-27.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "540", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-27.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-27.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-27.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-27.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-28", "instance": "XSH-n20-k4-28", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4525 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "305", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-28.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "669", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "19000000000", "density": "0.01172355", "feasible": "yes", "file": "XSH-n20-k4-28.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4525", "obj_value": "669", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-28.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-28.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-28.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-28.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-29", "instance": "XSH-n20-k4-29", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "318", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-29.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "658", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "22400000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-29.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "658", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-29.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-29.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-29.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-29.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-30", "instance": "XSH-n20-k4-30", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4970 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "359", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-30.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "685", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "31600000000", "density": "0.01167115", "feasible": "yes", "file": "XSH-n20-k4-30.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4970", "obj_value": "685", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-30.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-30.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-30.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-30.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-31", "instance": "XSH-n20-k4-31", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4971 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "357", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-31.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "445", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "21200000000", "density": "0.01166792", "feasible": "yes", "file": "XSH-n20-k4-31.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4971", "obj_value": "445", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-31.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-31.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-31.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-31.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-32", "instance": "XSH-n20-k4-32", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4524 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "297", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-32.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "882", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "13200000000", "density": "0.01172717", "feasible": "yes", "file": "XSH-n20-k4-32.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4524", "obj_value": "882", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-32.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-32.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-32.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-32.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-33", "instance": "XSH-n20-k4-33", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "353", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-33.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "568", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "28400000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-33.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "568", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-33.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-33.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-33.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-33.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-34", "instance": "XSH-n20-k4-34", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4974 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "359", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-34.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "891", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "48200000000", "density": "0.01165821", "feasible": "yes", "file": "XSH-n20-k4-34.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4974", "obj_value": "891", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-34.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-34.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-34.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-34.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-35", "instance": "XSH-n20-k4-35", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4976 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "380", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-35.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "707", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "38500000000", "density": "0.01165175", "feasible": "yes", "file": "XSH-n20-k4-35.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4976", "obj_value": "707", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-35.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-35.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-35.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-35.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-36", "instance": "XSH-n20-k4-36", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "322", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-36.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "610", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "22400000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-36.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "610", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-36.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-36.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-36.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-36.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-37", "instance": "XSH-n20-k4-37", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "338", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-37.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "650", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "29900000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-37.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "650", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-37.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-37.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-37.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-37.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-38", "instance": "XSH-n20-k4-38", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "322", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-38.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "991", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "30400000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-38.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "991", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-38.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-38.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-38.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-38.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-39", "instance": "XSH-n20-k4-39", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "334", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-39.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "717", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "29100000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-39.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "717", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-39.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-39.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-39.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-39.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-40", "instance": "XSH-n20-k4-40", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "335", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-40.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "700", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "29100000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-40.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "700", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-40.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-40.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-40.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-40.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-41", "instance": "XSH-n20-k4-41", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "344", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-41.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "736", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "30600000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-41.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "736", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-41.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-41.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-41.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-41.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-42", "instance": "XSH-n20-k4-42", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "331", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-42.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "998", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "27600000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-42.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "998", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-42.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-42.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-42.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-42.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-43", "instance": "XSH-n20-k4-43", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "341", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-43.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "465", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "20500000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-43.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "465", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-43.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-43.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-43.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-43.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-44", "instance": "XSH-n20-k4-44", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "334", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-44.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "973", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "27600000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-44.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "973", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-44.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-44.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-44.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-44.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-45", "instance": "XSH-n20-k4-45", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4971 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "377", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-45.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "1071", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "44200000000", "density": "0.01166792", "feasible": "yes", "file": "XSH-n20-k4-45.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4971", "obj_value": "1071", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-45.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-45.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-45.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-45.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-46", "instance": "XSH-n20-k4-46", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4524 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "312", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-46.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "812", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "14000000000", "density": "0.01172717", "feasible": "yes", "file": "XSH-n20-k4-46.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4524", "obj_value": "812", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-46.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-46.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-46.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-46.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-47", "instance": "XSH-n20-k4-47", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4972 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "363", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-47.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "583", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "29700000000", "density": "0.01166468", "feasible": "yes", "file": "XSH-n20-k4-47.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4972", "obj_value": "583", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-47.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-47.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-47.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-47.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-48", "instance": "XSH-n20-k4-48", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4526 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "316", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-48.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "544", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "15700000000", "density": "0.01171993", "feasible": "yes", "file": "XSH-n20-k4-48.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4526", "obj_value": "544", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-48.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-48.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-48.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-48.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-49", "instance": "XSH-n20-k4-49", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "326", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-49.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "1045", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "27800000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-49.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "1045", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-49.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-49.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-49.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-49.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-50", "instance": "XSH-n20-k4-50", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "344", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-50.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "627", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "30600000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-50.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "627", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-50.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-50.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-50.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-50.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-51", "instance": "XSH-n20-k4-51", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4527 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "323", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-51.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "491", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "18200000000", "density": "0.01171631", "feasible": "yes", "file": "XSH-n20-k4-51.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4527", "obj_value": "491", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-51.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-51.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-51.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-51.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-52", "instance": "XSH-n20-k4-52", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4525 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "304", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-52.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "622", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "13400000000", "density": "0.01172355", "feasible": "yes", "file": "XSH-n20-k4-52.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4525", "obj_value": "622", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-52.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-52.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-52.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-52.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-53", "instance": "XSH-n20-k4-53", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4974 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "379", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-53.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "967", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "45300000000", "density": "0.01165821", "feasible": "yes", "file": "XSH-n20-k4-53.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4974", "obj_value": "967", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-53.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-53.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-53.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-53.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-54", "instance": "XSH-n20-k4-54", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4525 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "299", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-54.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "791", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "14800000000", "density": "0.01172355", "feasible": "yes", "file": "XSH-n20-k4-54.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4525", "obj_value": "791", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-54.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-54.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-54.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-54.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".vrp", "id": "09-routing:XSH-n20-k4-55", "instance": "XSH-n20-k4-55", "paper_context": "MIP, 441 vars, density 0.0116, optimal yes; QUBO, 4974 vars, density 0.0117, optimal yes", "paper_metrics": [ { "coeff_range": "384", "density": "0.011558523", "feasible": "", "file": "XSH-n20-k4-55.lp", "formulation": "MIP", "num_constraints": "483", "num_vars": "441", "obj_value": "617", "optimal": "yes", "problem_size": "461.5224805" }, { "coeff_range": "38600000000", "density": "0.01165821", "feasible": "yes", "file": "XSH-n20-k4-55.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "4974", "obj_value": "617", "optimal": "yes", "problem_size": "" } ], "problem_dir": "09-routing", "problem_number": "09", "problem_title": "Vehicle Routing", "problem_why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.", "solution_path": "09-routing/solutions/XSH-n20-k4-55.opt.sol", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions/XSH-n20-k4-55.opt.sol", "source_path": "09-routing/instances/XSH-n20-k4-55.vrp", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances/XSH-n20-k4-55.vrp", "status": "optimal", "status_label": "Optimal", "submission_count": 0, "why_care": "A logistics benchmark for route construction with tight capacity and service-window constraints." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_1000000_16", "instance": "topology_1000000_16", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_1000000_16.bst.gph.xz", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_1000000_16.bst.gph.xz", "source_path": "10-topology/instances/topology_1000000_16.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_1000000_16.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_1000000_32", "instance": "topology_1000000_32", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_1000000_32.bst.gph.xz", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_1000000_32.bst.gph.xz", "source_path": "10-topology/instances/topology_1000000_32.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_1000000_32.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_100000_8", "instance": "topology_100000_8", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_100000_8.bst.gph.xz", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_100000_8.bst.gph.xz", "source_path": "10-topology/instances/topology_100000_8.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_100000_8.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_1024_4", "instance": "topology_1024_4", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_1024_4.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_1024_4.bst.gph", "source_path": "10-topology/instances/topology_1024_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_1024_4.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/topology_15_3_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_15_3", "instance": "topology_15_3", "paper_context": "MIP, 22261 vars, density 0.000209, optimal yes; QUBO, 45079 vars, density 0.00219, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.000208645", "feasible": "", "file": "topology_15_3.lp", "formulation": "MIP", "num_constraints": "23850", "num_vars": "22261", "obj_value": "3", "optimal": "yes", "problem_size": "23041.80657" }, { "coeff_range": "77900", "density": "0.002189792", "feasible": "yes", "file": "topology_15_3.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "45079", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_15_3.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_15_3.opt.gph", "source_path": "10-topology/instances/topology_15_3.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_15_3.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 2.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/topology_15_4_summary.csv", "best_value": "2.0", "family": "", "format": ".dat", "id": "10-topology:topology_15_4", "instance": "topology_15_4", "paper_context": "MIP, 22261 vars, density 0.000209, optimal yes; QUBO, 45094 vars, density 0.00219, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "0.000208645", "feasible": "", "file": "topology_15_4.lp", "formulation": "MIP", "num_constraints": "23850", "num_vars": "22261", "obj_value": "2", "optimal": "yes", "problem_size": "23041.80657" }, { "coeff_range": "77900", "density": "0.002188586", "feasible": "yes", "file": "topology_15_4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "45094", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_15_4.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_15_4.opt.gph", "source_path": "10-topology/instances/topology_15_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_15_4.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_1726_30", "instance": "topology_1726_30", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_1726_30.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_1726_30.bst.gph", "source_path": "10-topology/instances/topology_1726_30.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_1726_30.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/topology_20_3_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_20_3", "instance": "topology_20_3", "paper_context": "MIP, 72581 vars, density 6.53e-05, optimal yes; QUBO, 146535 vars, density 0.00122, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "6.53E-05", "feasible": "", "file": "topology_20_3.lp", "formulation": "MIP", "num_constraints": "76400", "num_vars": "72581", "obj_value": "3", "optimal": "yes", "problem_size": "74466.02178" }, { "coeff_range": "244000", "density": "0.001222812", "feasible": "yes", "file": "topology_20_3.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "146535", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_20_3.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_20_3.opt.gph", "source_path": "10-topology/instances/topology_20_3.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_20_3.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/topology_20_4_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_20_4", "instance": "topology_20_4", "paper_context": "MIP, 72581 vars, density 6.53e-05, optimal yes; QUBO, 146555 vars, density 0.00122, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "6.53E-05", "feasible": "", "file": "topology_20_4.lp", "formulation": "MIP", "num_constraints": "76400", "num_vars": "72581", "obj_value": "3", "optimal": "yes", "problem_size": "74466.02178" }, { "coeff_range": "244000", "density": "0.001222519", "feasible": "yes", "file": "topology_20_4.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "146555", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_20_4.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_20_4.opt.gph", "source_path": "10-topology/instances/topology_20_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_20_4.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 2.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/topology_20_5_summary.csv", "best_value": "2.0", "family": "", "format": ".dat", "id": "10-topology:topology_20_5", "instance": "topology_20_5", "paper_context": "MIP, 72581 vars, density 6.53e-05, optimal yes; QUBO, 146555 vars, density 0.00122, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "6.53E-05", "feasible": "", "file": "topology_20_5.lp", "formulation": "MIP", "num_constraints": "76400", "num_vars": "72581", "obj_value": "2", "optimal": "yes", "problem_size": "74466.02178" }, { "coeff_range": "244000", "density": "0.001222519", "feasible": "yes", "file": "topology_20_5.qs", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "146555", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_20_5.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_20_5.opt.gph", "source_path": "10-topology/instances/topology_20_5.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_20_5.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 4.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/topology_25_3_summary.csv", "best_value": "4.0", "family": "", "format": ".dat", "id": "10-topology:topology_25_3", "instance": "topology_25_3", "paper_context": "MIP, 180601 vars, density 2.65e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "2.65E-05", "feasible": "", "file": "topology_25_3.lp", "formulation": "MIP", "num_constraints": "188125", "num_vars": "180601", "obj_value": "4", "optimal": "yes", "problem_size": "184324.6135" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_25_3.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "4", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_25_3.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_25_3.opt.gph", "source_path": "10-topology/instances/topology_25_3.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_25_3.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/topology_25_4_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_25_4", "instance": "topology_25_4", "paper_context": "MIP, 180601 vars, density 2.65e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "2.65E-05", "feasible": "", "file": "topology_25_4.lp", "formulation": "MIP", "num_constraints": "188125", "num_vars": "180601", "obj_value": "3", "optimal": "yes", "problem_size": "184324.6135" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_25_4.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_25_4.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_25_4.opt.gph", "source_path": "10-topology/instances/topology_25_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_25_4.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/topology_25_5_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_25_5", "instance": "topology_25_5", "paper_context": "MIP, 180601 vars, density 2.65e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "2.65E-05", "feasible": "", "file": "topology_25_5.lp", "formulation": "MIP", "num_constraints": "188125", "num_vars": "180601", "obj_value": "3", "optimal": "yes", "problem_size": "184324.6135" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_25_5.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_25_5.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_25_5.opt.gph", "source_path": "10-topology/instances/topology_25_5.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_25_5.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 2.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/topology_25_6_summary.csv", "best_value": "2.0", "family": "", "format": ".dat", "id": "10-topology:topology_25_6", "instance": "topology_25_6", "paper_context": "MIP, 180601 vars, density 2.65e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "2.65E-05", "feasible": "", "file": "topology_25_6.lp", "formulation": "MIP", "num_constraints": "188125", "num_vars": "180601", "obj_value": "2", "optimal": "yes", "problem_size": "184324.6135" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_25_6.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "2", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_25_6.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_25_6.opt.gph", "source_path": "10-topology/instances/topology_25_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_25_6.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Linear_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/topology_30_4_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_30_4", "instance": "topology_30_4", "paper_context": "MIP, 379321 vars, density 1.27e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "1.27E-05", "feasible": "", "file": "topology_30_4.lp", "formulation": "MIP", "num_constraints": "392400", "num_vars": "379321", "obj_value": "3", "optimal": "yes", "problem_size": "385805.0808" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_30_4.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_30_4.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_30_4.opt.gph", "source_path": "10-topology/instances/topology_30_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_30_4.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/topology_30_5_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_30_5", "instance": "topology_30_5", "paper_context": "MIP, 379321 vars, density 1.27e-05, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "1.27E-05", "feasible": "", "file": "topology_30_5.lp", "formulation": "MIP", "num_constraints": "392400", "num_vars": "379321", "obj_value": "3", "optimal": "yes", "problem_size": "385805.0808" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_30_5.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_30_5.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_30_5.opt.gph", "source_path": "10-topology/instances/topology_30_5.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_30_5.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/topology_30_6_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_30_6", "instance": "topology_30_6", "paper_context": "MIP, 379321 vars, density 1.27e-05, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "1.27E-05", "feasible": "", "file": "topology_30_6.lp", "formulation": "MIP", "num_constraints": "392400", "num_vars": "379321", "obj_value": "3", "optimal": "no", "problem_size": "385805.0808" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_30_6.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "no", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_30_6.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_30_6.bst.gph", "source_path": "10-topology/instances/topology_30_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_30_6.dat", "status": "best_known", "status_label": "Best known", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 4.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/topology_35_5_summary.csv", "best_value": "4.0", "family": "", "format": ".dat", "id": "10-topology:topology_35_5", "instance": "topology_35_5", "paper_context": "MIP, 709241 vars, density 6.84e-06, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "6.84E-06", "feasible": "", "file": "topology_35_5.lp", "formulation": "MIP", "num_constraints": "730100", "num_vars": "709241", "obj_value": "4", "optimal": "no", "problem_size": "719594.9236" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_35_5.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "4", "optimal": "no", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_35_5.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_35_5.bst.gph", "source_path": "10-topology/instances/topology_35_5.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_35_5.dat", "status": "best_known", "status_label": "Best known", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 3.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/topology_35_6_summary.csv", "best_value": "3.0", "family": "", "format": ".dat", "id": "10-topology:topology_35_6", "instance": "topology_35_6", "paper_context": "MIP, 709241 vars, density 6.84e-06, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "6.84E-06", "feasible": "", "file": "topology_35_6.lp", "formulation": "MIP", "num_constraints": "730100", "num_vars": "709241", "obj_value": "3", "optimal": "no", "problem_size": "719594.9236" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_35_6.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "no", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_35_6.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_35_6.bst.gph", "source_path": "10-topology/instances/topology_35_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_35_6.dat", "status": "best_known", "status_label": "Best known", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 5.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/topology_40_6_summary.csv", "best_value": "5.0", "family": "", "format": ".dat", "id": "10-topology:topology_40_6", "instance": "topology_40_6", "paper_context": "MIP, 1218361 vars, density 4e-06, optimal yes; QUBO, n/a vars, optimal yes", "paper_metrics": [ { "coeff_range": "2", "density": "4.00E-06", "feasible": "", "file": "topology_40_6.lp", "formulation": "MIP", "num_constraints": "1249600", "num_vars": "1218361", "obj_value": "3", "optimal": "yes", "problem_size": "1233881.642" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_40_6.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "3", "optimal": "yes", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_40_6.opt.gph", "solution_status": "optimal", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_40_6.opt.gph", "source_path": "10-topology/instances/topology_40_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_40_6.dat", "status": "optimal", "status_label": "Optimal", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_4855_15", "instance": "topology_4855_15", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_4855_15.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_4855_15.bst.gph", "source_path": "10-topology/instances/topology_4855_15.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_4855_15.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "06. Dec. 2024", "best_numeric": 5.0, "best_submission": "20241206_Gurobi-Seidel-Quadratic_Schicker", "best_submitter": "Maximilian Schicker", "best_summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/topology_50_4_summary.csv", "best_value": "5.0", "family": "", "format": ".dat", "id": "10-topology:topology_50_4", "instance": "topology_50_4", "paper_context": "MIP, 3003701 vars, density 1.63e-06, optimal no; QUBO, n/a vars, optimal no", "paper_metrics": [ { "coeff_range": "2", "density": "1.63E-06", "feasible": "", "file": "topology_50_4.lp", "formulation": "MIP", "num_constraints": "3065000", "num_vars": "3003701", "obj_value": "5", "optimal": "no", "problem_size": "3034195.703" }, { "coeff_range": "n/a", "density": "n/a", "feasible": "n/a", "file": "topology_50_4.lp", "formulation": "QUBO", "num_constraints": "n/a", "num_vars": "n/a", "obj_value": "5", "optimal": "no", "problem_size": "" } ], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_50_4.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_50_4.bst.gph", "source_path": "10-topology/instances/topology_50_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_50_4.dat", "status": "best_known", "status_label": "Best known", "submission_count": 3, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_512_4", "instance": "topology_512_4", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_512_4.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_512_4.bst.gph", "source_path": "10-topology/instances/topology_512_4.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_512_4.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_512_6", "instance": "topology_512_6", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_512_6.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_512_6.bst.gph", "source_path": "10-topology/instances/topology_512_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_512_6.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_65536_6", "instance": "topology_65536_6", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_65536_6.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_65536_6.bst.gph", "source_path": "10-topology/instances/topology_65536_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_65536_6.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." }, { "best_date": "", "best_numeric": null, "best_submission": "", "best_submitter": "", "best_summary_url": "", "best_value": "", "family": "", "format": ".dat", "id": "10-topology:topology_9344_6", "instance": "topology_9344_6", "paper_context": "", "paper_metrics": [], "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "problem_why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.", "solution_path": "10-topology/solutions/topology_9344_6.bst.gph", "solution_status": "best_known", "solution_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions/topology_9344_6.bst.gph", "source_path": "10-topology/instances/topology_9344_6.dat", "source_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances/topology_9344_6.dat", "status": "best_known", "status_label": "Best known", "submission_count": 0, "why_care": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove." } ], "leaderboard": [ { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "minimize", "instance": "ms_03_050_002", "modeling": "QUBO", "numeric_objective": -201117.0, "objective": "-201117", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "https://arvak.io", "runtime": "0.38", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/ms_03_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_050_002", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "0.251919", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_002/ms_03_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:08", "date_key": "2024-12-23T09:32:08", "direction": "minimize", "instance": "ms_03_050_002", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.16", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_002/ms_03_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_050_005", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.240276", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_005/ms_03_050_005_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:08", "date_key": "2024-12-23T09:32:08", "direction": "minimize", "instance": "ms_03_050_005", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.01", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/ms_03_050_005_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_050_007", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.219634", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_007/ms_03_050_007_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:08", "date_key": "2024-12-23T09:32:08", "direction": "minimize", "instance": "ms_03_050_007", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.17", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/ms_03_050_007_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_050_009", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.247072", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_009/ms_03_050_009_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:08", "date_key": "2024-12-23T09:32:08", "direction": "minimize", "instance": "ms_03_050_009", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.02", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/ms_03_050_009_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_100_001", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.258647", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_001/ms_03_100_001_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:38", "date_key": "2024-12-23T09:32:38", "direction": "minimize", "instance": "ms_03_100_001", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.23", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/ms_03_100_001_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_100_012", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.267623", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_012/ms_03_100_012_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:38", "date_key": "2024-12-23T09:32:38", "direction": "minimize", "instance": "ms_03_100_012", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.16", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/ms_03_100_012_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_100_019", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.259412", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_019/ms_03_100_019_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:38", "date_key": "2024-12-23T09:32:38", "direction": "minimize", "instance": "ms_03_100_019", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.23", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/ms_03_100_019_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_100_022", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.260394", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_022/ms_03_100_022_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:32:38", "date_key": "2024-12-23T09:32:38", "direction": "minimize", "instance": "ms_03_100_022", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.12", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/ms_03_100_022_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_200_050", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.246465", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_050/ms_03_200_050_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:08", "date_key": "2024-12-23T09:33:08", "direction": "minimize", "instance": "ms_03_200_050", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.15", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/ms_03_200_050_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_200_068", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.267825", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_068/ms_03_200_068_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:08", "date_key": "2024-12-23T09:33:08", "direction": "minimize", "instance": "ms_03_200_068", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.15", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/ms_03_200_068_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_200_161", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.246673", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_161/ms_03_200_161_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:08", "date_key": "2024-12-23T09:33:08", "direction": "minimize", "instance": "ms_03_200_161", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.12", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/ms_03_200_161_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_03_200_177", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.251363", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_177/ms_03_200_177_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:08", "date_key": "2024-12-23T09:33:08", "direction": "minimize", "instance": "ms_03_200_177", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.17", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/ms_03_200_177_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_050_001", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.231479", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_001/ms_04_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:38", "date_key": "2024-12-23T09:33:38", "direction": "minimize", "instance": "ms_04_050_001", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "2.84", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/ms_04_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_050_003", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.530695", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_003/ms_04_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:38", "date_key": "2024-12-23T09:33:38", "direction": "minimize", "instance": "ms_04_050_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.98", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/ms_04_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_050_004", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.638373", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_004/ms_04_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:38", "date_key": "2024-12-23T09:33:38", "direction": "minimize", "instance": "ms_04_050_004", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1.1", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/ms_04_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_050_005", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.323827", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_005/ms_04_050_005_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:33:38", "date_key": "2024-12-23T09:33:38", "direction": "minimize", "instance": "ms_04_050_005", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.5", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/ms_04_050_005_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_100_003", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.407428", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_003/ms_04_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:08", "date_key": "2024-12-23T09:34:08", "direction": "minimize", "instance": "ms_04_100_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1.0", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/ms_04_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_100_009", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "1.079545", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_009/ms_04_100_009_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:08", "date_key": "2024-12-23T09:34:08", "direction": "minimize", "instance": "ms_04_100_009", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.68", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/ms_04_100_009_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_100_013", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.236793", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_013/ms_04_100_013_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:08", "date_key": "2024-12-23T09:34:08", "direction": "minimize", "instance": "ms_04_100_013", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.89", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/ms_04_100_013_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_100_015", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.368127", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_015/ms_04_100_015_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:08", "date_key": "2024-12-23T09:34:08", "direction": "minimize", "instance": "ms_04_100_015", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1.14", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/ms_04_100_015_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_200_030", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.61052", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_030/ms_04_200_030_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:38", "date_key": "2024-12-23T09:34:38", "direction": "minimize", "instance": "ms_04_200_030", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.9", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/ms_04_200_030_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_200_150", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.505015", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_150/ms_04_200_150_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:38", "date_key": "2024-12-23T09:34:38", "direction": "minimize", "instance": "ms_04_200_150", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.87", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/ms_04_200_150_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_200_174", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "1.879598", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_174/ms_04_200_174_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:38", "date_key": "2024-12-23T09:34:38", "direction": "minimize", "instance": "ms_04_200_174", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.31", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/ms_04_200_174_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_04_200_176", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "0.386963", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_176/ms_04_200_176_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:34:38", "date_key": "2024-12-23T09:34:38", "direction": "minimize", "instance": "ms_04_200_176", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.96", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/ms_04_200_176_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_050_001", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "9.60591", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_001/ms_05_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:08", "date_key": "2024-12-23T09:35:08", "direction": "minimize", "instance": "ms_05_050_001", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.7", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/ms_05_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_050_002", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "31.750981", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_002/ms_05_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:08", "date_key": "2024-12-23T09:35:08", "direction": "minimize", "instance": "ms_05_050_002", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.66", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/ms_05_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_050_003", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "5.849204", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_003/ms_05_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:08", "date_key": "2024-12-23T09:35:08", "direction": "minimize", "instance": "ms_05_050_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.8", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/ms_05_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_050_004", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "6.18652", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_004/ms_05_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:08", "date_key": "2024-12-23T09:35:08", "direction": "minimize", "instance": "ms_05_050_004", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.76", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/ms_05_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_100_003", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "7.774432", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_003/ms_05_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:38", "date_key": "2024-12-23T09:35:38", "direction": "minimize", "instance": "ms_05_100_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.69", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/ms_05_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_100_006", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "225.430747", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_006/ms_05_100_006_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:38", "date_key": "2024-12-23T09:35:38", "direction": "minimize", "instance": "ms_05_100_006", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.87", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/ms_05_100_006_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_100_013", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "160.121463", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_013/ms_05_100_013_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:38", "date_key": "2024-12-23T09:35:38", "direction": "minimize", "instance": "ms_05_100_013", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.65", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/ms_05_100_013_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_100_015", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "167.173741", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_015/ms_05_100_015_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:35:38", "date_key": "2024-12-23T09:35:38", "direction": "minimize", "instance": "ms_05_100_015", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.92", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/ms_05_100_015_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_200_070", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "47.028723", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_070/ms_05_200_070_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:08", "date_key": "2024-12-23T09:36:08", "direction": "minimize", "instance": "ms_05_200_070", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.9", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/ms_05_200_070_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_200_095", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "309.270877", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_095/ms_05_200_095_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:08", "date_key": "2024-12-23T09:36:08", "direction": "minimize", "instance": "ms_05_200_095", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1.07", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/ms_05_200_095_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_200_180", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "159.687087", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_180/ms_05_200_180_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:08", "date_key": "2024-12-23T09:36:08", "direction": "minimize", "instance": "ms_05_200_180", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1.04", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/ms_05_200_180_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_05_200_199", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "2.46601", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_199/ms_05_200_199_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:08", "date_key": "2024-12-23T09:36:08", "direction": "minimize", "instance": "ms_05_200_199", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.97", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/ms_05_200_199_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_050_001", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "3230.997628", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_001/ms_06_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:38", "date_key": "2024-12-23T09:36:38", "direction": "minimize", "instance": "ms_06_050_001", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "6.75", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/ms_06_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_050_002", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "62.551974", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_002/ms_06_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:38", "date_key": "2024-12-23T09:36:38", "direction": "minimize", "instance": "ms_06_050_002", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "14.01", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/ms_06_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_050_003", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "154.872018", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_003/ms_06_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:38", "date_key": "2024-12-23T09:36:38", "direction": "minimize", "instance": "ms_06_050_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "11.14", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/ms_06_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_050_004", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "31.489273", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_004/ms_06_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:36:38", "date_key": "2024-12-23T09:36:38", "direction": "minimize", "instance": "ms_06_050_004", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "26.61", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/ms_06_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:37:38", "date_key": "2024-12-23T09:37:38", "direction": "minimize", "instance": "ms_06_100_002", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "45.33", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/ms_06_100_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_100_002", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.110226", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_002/ms_06_100_002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:37:38", "date_key": "2024-12-23T09:37:38", "direction": "minimize", "instance": "ms_06_100_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "61.7", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/ms_06_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_100_003", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.103222", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_003/ms_06_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:38:08", "date_key": "2024-12-23T09:38:08", "direction": "minimize", "instance": "ms_06_100_005", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "70.29", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/ms_06_100_005_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_100_005", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "7200.102591", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_005/ms_06_100_005_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_100_010", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "2052.40022", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_010/ms_06_100_010_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:39:08", "date_key": "2024-12-23T09:39:08", "direction": "minimize", "instance": "ms_06_100_010", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "114.01", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/ms_06_100_010_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:41:39", "date_key": "2024-12-23T09:41:39", "direction": "minimize", "instance": "ms_06_200_077", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "15.49", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/ms_06_200_077_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_200_077", "modeling": "QUBO", "numeric_objective": 3.0, "objective": "3", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "7200.109388", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_077/ms_06_200_077_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:43:09", "date_key": "2024-12-23T09:43:09", "direction": "minimize", "instance": "ms_06_200_104", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "28.42", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/ms_06_200_104_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_200_104", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "7200.099811", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_104/ms_06_200_104_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:43:09", "date_key": "2024-12-23T09:43:09", "direction": "minimize", "instance": "ms_06_200_240", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "27.65", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/ms_06_200_240_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_200_240", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "7200.099547", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_240/ms_06_200_240_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_06_200_289", "modeling": "QUBO", "numeric_objective": 0.0, "objective": "0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using abs2", "runtime": "473.575552", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_289/ms_06_200_289_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:44:09", "date_key": "2024-12-23T09:44:09", "direction": "minimize", "instance": "ms_06_200_289", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "22.77", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/ms_06_200_289_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:45:39", "date_key": "2024-12-23T09:45:39", "direction": "minimize", "instance": "ms_07_050_001", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "206.56", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/ms_07_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_050_001", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.099805", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_001/ms_07_050_001_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:45:39", "date_key": "2024-12-23T09:45:39", "direction": "minimize", "instance": "ms_07_050_002", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "166.84", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/ms_07_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_050_002", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.101964", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_002/ms_07_050_002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:46:09", "date_key": "2024-12-23T09:46:09", "direction": "minimize", "instance": "ms_07_050_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "160.69", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/ms_07_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_050_003", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.108237", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_003/ms_07_050_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:48:40", "date_key": "2024-12-23T09:48:40", "direction": "minimize", "instance": "ms_07_050_004", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "246.32", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/ms_07_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_050_004", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.098002", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_004/ms_07_050_004_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:59:41", "date_key": "2024-12-23T09:59:41", "direction": "minimize", "instance": "ms_07_100_002", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1475.69", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/ms_07_100_002_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_100_002", "modeling": "QUBO", "numeric_objective": 7.0, "objective": "7", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.101912", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_002/ms_07_100_002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 09:59:41", "date_key": "2024-12-23T09:59:41", "direction": "minimize", "instance": "ms_07_100_003", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1139.69", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/ms_07_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_100_003", "modeling": "QUBO", "numeric_objective": 5.0, "objective": "5", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.100547", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_003/ms_07_100_003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 10:03:11", "date_key": "2024-12-23T10:03:11", "direction": "minimize", "instance": "ms_07_100_005", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "887.03", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/ms_07_100_005_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_100_005", "modeling": "QUBO", "numeric_objective": 12.0, "objective": "12", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.101031", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_005/ms_07_100_005_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 10:09:41", "date_key": "2024-12-23T10:09:41", "direction": "minimize", "instance": "ms_07_100_006", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "898.13", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/ms_07_100_006_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_100_006", "modeling": "QUBO", "numeric_objective": 4.0, "objective": "4", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.107245", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_006/ms_07_100_006_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 11:17:47", "date_key": "2024-12-23T11:17:47", "direction": "minimize", "instance": "ms_07_200_248", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "2329.87", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/ms_07_200_248_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_200_248", "modeling": "QUBO", "numeric_objective": 22.0, "objective": "22", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.101984", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_248/ms_07_200_248_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 11:24:47", "date_key": "2024-12-23T11:24:47", "direction": "minimize", "instance": "ms_07_200_370", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "2568.29", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/ms_07_200_370_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_200_370", "modeling": "QUBO", "numeric_objective": 19.0, "objective": "19", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.101658", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_370/ms_07_200_370_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 11:35:18", "date_key": "2024-12-23T11:35:18", "direction": "minimize", "instance": "ms_07_200_398", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "2479.56", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/ms_07_200_398_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_200_398", "modeling": "QUBO", "numeric_objective": 36.0, "objective": "36", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.100455", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_398/ms_07_200_398_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-23 12:02:21", "date_key": "2024-12-23T12:02:21", "direction": "minimize", "instance": "ms_07_200_500", "modeling": "Binary Linear Program", "numeric_objective": 0.0, "objective": "0.0", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "2753.22", "submission_set": "20241224_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/ms_07_200_500_summary.csv" }, { "algorithm": "Deterministic", "date": "22. Dec. 2024", "date_key": "2024-12-22T00:00:00", "direction": "minimize", "instance": "ms_07_200_500", "modeling": "QUBO", "numeric_objective": 26.0, "objective": "26", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "rank": 2, "reference": "See Models Directory using abs2", "runtime": "600.108209", "submission_set": "20241222_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_500/ms_07_200_500_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 10)", "modeling": "PUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "4820.06", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010/labs010_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 10)", "modeling": "PUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "1186.68", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010-without_calibration/labs010-without_calibration_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 12)", "modeling": "PUBO", "numeric_objective": 10.0, "objective": "10", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "5097.17", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012/labs012_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 12)", "modeling": "PUBO", "numeric_objective": 10.0, "objective": "10", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "2522.60", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012-without_calibration/labs012-without_calibration_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 6)", "modeling": "PUBO", "numeric_objective": 7.0, "objective": "7", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "341.376", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006/labs006_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 6)", "modeling": "PUBO", "numeric_objective": 7.0, "objective": "7", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "280.306", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006-without_calibration/labs006-without_calibration_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 8)", "modeling": "PUBO", "numeric_objective": 8.0, "objective": "8", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "913.034", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008/labs008_summary.csv" }, { "algorithm": "stochastic", "date": "Nov. 17, 2025", "date_key": "2026-02-09T00:00:00", "direction": "minimize", "instance": "LABS (N = 8)", "modeling": "PUBO", "numeric_objective": 8.0, "objective": "8", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "N/A", "runtime": "648.782", "submission_set": "20260209_QAOA_AQT", "submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008-without_calibration/labs008-without_calibration_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:53:53", "date_key": "2024-12-28T17:53:53", "direction": "minimize", "instance": "labs002", "modeling": "Integer Program", "numeric_objective": 1.0, "objective": "1.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.01", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs002/labs002_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs002", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.371176", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs002/labs002_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:54", "date_key": "2024-12-28T17:58:54", "direction": "minimize", "instance": "labs003", "modeling": "Integer Program", "numeric_objective": 1.0, "objective": "1.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.02", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs003/labs003_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs003", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.373337", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs003/labs003_summary.csv" }, { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "minimize", "instance": "labs003", "modeling": "QUBO", "numeric_objective": 1.0, "objective": "1", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "https://arvak.io", "runtime": "0.11", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260308_Arvak_Hinderink/labs003/labs003_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:54", "date_key": "2024-12-28T17:58:54", "direction": "minimize", "instance": "labs004", "modeling": "Integer Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.1", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs004/labs004_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs004", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.388622", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs004/labs004_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:50", "date_key": "2024-12-28T17:57:50", "direction": "minimize", "instance": "labs005", "modeling": "Integer Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs005/labs005_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs005", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.388686", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs005/labs005_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:50", "date_key": "2024-12-28T17:57:50", "direction": "minimize", "instance": "labs006", "modeling": "Integer Program", "numeric_objective": 7.0, "objective": "7.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.09", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs006/labs006_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs006", "modeling": "QUBO", "numeric_objective": 7.0, "objective": "7", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.367144", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs006/labs006_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:56:54", "date_key": "2024-12-28T17:56:54", "direction": "minimize", "instance": "labs007", "modeling": "Integer Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.07", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs007/labs007_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs007", "modeling": "QUBO", "numeric_objective": 3.0, "objective": "3", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.382743", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs007/labs007_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:56:54", "date_key": "2024-12-28T17:56:54", "direction": "minimize", "instance": "labs008", "modeling": "Integer Program", "numeric_objective": 8.0, "objective": "8.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.11", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs008/labs008_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs008", "modeling": "QUBO", "numeric_objective": 8.0, "objective": "8", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.271149", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs008/labs008_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:54", "date_key": "2024-12-28T17:58:54", "direction": "minimize", "instance": "labs009", "modeling": "Integer Program", "numeric_objective": 12.0, "objective": "12.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.19", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs009/labs009_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs009", "modeling": "QUBO", "numeric_objective": 12.0, "objective": "12", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.264882", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs009/labs009_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:54", "date_key": "2024-12-28T17:58:54", "direction": "minimize", "instance": "labs010", "modeling": "Integer Program", "numeric_objective": 13.0, "objective": "13.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.21", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs010/labs010_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs010", "modeling": "QUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.209115", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs010/labs010_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:54:10", "date_key": "2024-12-28T17:54:10", "direction": "minimize", "instance": "labs011", "modeling": "Integer Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.18", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs011/labs011_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs011", "modeling": "QUBO", "numeric_objective": 5.0, "objective": "5", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.190839", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs011/labs011_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:54:40", "date_key": "2024-12-28T17:54:40", "direction": "minimize", "instance": "labs012", "modeling": "Integer Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.32", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs012/labs012_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs012", "modeling": "QUBO", "numeric_objective": 10.0, "objective": "10", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.170356", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs012/labs012_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:54:52", "date_key": "2024-12-28T17:54:52", "direction": "minimize", "instance": "labs013", "modeling": "Integer Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.65", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs013/labs013_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs013", "modeling": "QUBO", "numeric_objective": 6.0, "objective": "6", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.164782", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs013/labs013_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:55:10", "date_key": "2024-12-28T17:55:10", "direction": "minimize", "instance": "labs014", "modeling": "Integer Program", "numeric_objective": 19.0, "objective": "19.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.76", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs014/labs014_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs014", "modeling": "QUBO", "numeric_objective": 19.0, "objective": "19", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.134173", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs014/labs014_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:55:40", "date_key": "2024-12-28T17:55:40", "direction": "minimize", "instance": "labs015", "modeling": "Integer Program", "numeric_objective": 15.0, "objective": "15.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.44", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs015/labs015_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs015", "modeling": "QUBO", "numeric_objective": 15.0, "objective": "15", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.419585", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs015/labs015_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:55:52", "date_key": "2024-12-28T17:55:52", "direction": "minimize", "instance": "labs016", "modeling": "Integer Program", "numeric_objective": 24.0, "objective": "24.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "0.88", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs016/labs016_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs016", "modeling": "QUBO", "numeric_objective": 24.0, "objective": "24", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.149242", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs016/labs016_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:56:10", "date_key": "2024-12-28T17:56:10", "direction": "minimize", "instance": "labs017", "modeling": "Integer Program", "numeric_objective": 32.0, "objective": "32.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "1.38", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs017/labs017_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs017", "modeling": "QUBO", "numeric_objective": 32.0, "objective": "32", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.233442", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs017/labs017_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:56:40", "date_key": "2024-12-28T17:56:40", "direction": "minimize", "instance": "labs018", "modeling": "Integer Program", "numeric_objective": 25.0, "objective": "25.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "1.2", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs018/labs018_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs018", "modeling": "QUBO", "numeric_objective": 25.0, "objective": "25", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.09804", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs018/labs018_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:56:53", "date_key": "2024-12-28T17:56:53", "direction": "minimize", "instance": "labs019", "modeling": "Integer Program", "numeric_objective": 29.0, "objective": "29.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "2.17", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs019/labs019_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs019", "modeling": "QUBO", "numeric_objective": 29.0, "objective": "29", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "1.423615", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs019/labs019_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:11", "date_key": "2024-12-28T17:57:11", "direction": "minimize", "instance": "labs020", "modeling": "Integer Program", "numeric_objective": 26.0, "objective": "26.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "2.26", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs020/labs020_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs020", "modeling": "QUBO", "numeric_objective": 26.0, "objective": "26", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7.998091", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs020/labs020_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:11", "date_key": "2024-12-28T17:57:11", "direction": "minimize", "instance": "labs021", "modeling": "Integer Program", "numeric_objective": 26.0, "objective": "26.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "2.97", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs021/labs021_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs021", "modeling": "QUBO", "numeric_objective": 26.0, "objective": "26", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "14.194171", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs021/labs021_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:11", "date_key": "2024-12-28T17:57:11", "direction": "minimize", "instance": "labs022", "modeling": "Integer Program", "numeric_objective": 39.0, "objective": "39.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "15.37", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs022/labs022_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs022", "modeling": "QUBO", "numeric_objective": 39.0, "objective": "39", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.326647", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs022/labs022_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:41", "date_key": "2024-12-28T17:57:41", "direction": "minimize", "instance": "labs023", "modeling": "Integer Program", "numeric_objective": 47.0, "objective": "47.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "22.63", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs023/labs023_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs023", "modeling": "QUBO", "numeric_objective": 47.0, "objective": "47", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "2.856399", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs023/labs023_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:41", "date_key": "2024-12-28T17:57:41", "direction": "minimize", "instance": "labs024", "modeling": "Integer Program", "numeric_objective": 36.0, "objective": "36.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "39.34", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs024/labs024_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs024", "modeling": "QUBO", "numeric_objective": 36.0, "objective": "36", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "6.124976", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs024/labs024_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:41", "date_key": "2024-12-28T17:57:41", "direction": "minimize", "instance": "labs025", "modeling": "Integer Program", "numeric_objective": 36.0, "objective": "36.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "54.91", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs025/labs025_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs025", "modeling": "QUBO", "numeric_objective": 36.0, "objective": "36", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "239.586121", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs025/labs025_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:53", "date_key": "2024-12-28T17:57:53", "direction": "minimize", "instance": "labs026", "modeling": "Integer Program", "numeric_objective": 45.0, "objective": "45.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "62.94", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs026/labs026_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs026", "modeling": "QUBO", "numeric_objective": 45.0, "objective": "45", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "1.331118", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs026/labs026_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:57:53", "date_key": "2024-12-28T17:57:53", "direction": "minimize", "instance": "labs027", "modeling": "Integer Program", "numeric_objective": 37.0, "objective": "37.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "84.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs027/labs027_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs027", "modeling": "QUBO", "numeric_objective": 53.0, "objective": "53", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.036593", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs027/labs027_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:11", "date_key": "2024-12-28T17:58:11", "direction": "minimize", "instance": "labs028", "modeling": "Integer Program", "numeric_objective": 50.0, "objective": "50.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "152.48", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs028/labs028_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs028", "modeling": "QUBO", "numeric_objective": 62.0, "objective": "62", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.030636", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs028/labs028_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:41", "date_key": "2024-12-28T17:58:41", "direction": "minimize", "instance": "labs029", "modeling": "Integer Program", "numeric_objective": 62.0, "objective": "62.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "484.7", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs029/labs029_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs029", "modeling": "QUBO", "numeric_objective": 66.0, "objective": "66", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.026511", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs029/labs029_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:58:41", "date_key": "2024-12-28T17:58:41", "direction": "minimize", "instance": "labs030", "modeling": "Integer Program", "numeric_objective": 59.0, "objective": "59.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "384.56", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs030/labs030_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs030", "modeling": "QUBO", "numeric_objective": 59.0, "objective": "59", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "592.741499", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs030/labs030_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:59:11", "date_key": "2024-12-28T17:59:11", "direction": "minimize", "instance": "labs031", "modeling": "Integer Program", "numeric_objective": 67.0, "objective": "67.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "866.08", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs031/labs031_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs031", "modeling": "QUBO", "numeric_objective": 71.0, "objective": "71", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.032277", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs031/labs031_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:59:11", "date_key": "2024-12-28T17:59:11", "direction": "minimize", "instance": "labs032", "modeling": "Integer Program", "numeric_objective": 64.0, "objective": "64.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "618.93", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs032/labs032_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs032", "modeling": "QUBO", "numeric_objective": 72.0, "objective": "72", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.038312", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs032/labs032_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:59:11", "date_key": "2024-12-28T17:59:11", "direction": "minimize", "instance": "labs033", "modeling": "Integer Program", "numeric_objective": 64.0, "objective": "64.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "884.42", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs033/labs033_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs033", "modeling": "QUBO", "numeric_objective": 80.0, "objective": "80", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.026566", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs033/labs033_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:59:11", "date_key": "2024-12-28T17:59:11", "direction": "minimize", "instance": "labs034", "modeling": "Integer Program", "numeric_objective": 65.0, "objective": "65.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "2149.32", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs034/labs034_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs034", "modeling": "QUBO", "numeric_objective": 89.0, "objective": "89", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.042606", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs034/labs034_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 17:59:11", "date_key": "2024-12-28T17:59:11", "direction": "minimize", "instance": "labs035", "modeling": "Integer Program", "numeric_objective": 73.0, "objective": "73.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "3305.28", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs035/labs035_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs035", "modeling": "QUBO", "numeric_objective": 85.0, "objective": "85", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.042891", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs035/labs035_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:00:07", "date_key": "2024-12-28T18:00:07", "direction": "minimize", "instance": "labs036", "modeling": "Integer Program", "numeric_objective": 82.0, "objective": "82.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "5610.1", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs036/labs036_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs036", "modeling": "QUBO", "numeric_objective": 98.0, "objective": "98", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.032561", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs036/labs036_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:00:52", "date_key": "2024-12-28T18:00:52", "direction": "minimize", "instance": "labs037", "modeling": "Integer Program", "numeric_objective": 86.0, "objective": "86.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs037/labs037_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs037", "modeling": "QUBO", "numeric_objective": 106.0, "objective": "106", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.028526", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs037/labs037_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:05:12", "date_key": "2024-12-28T18:05:12", "direction": "minimize", "instance": "labs038", "modeling": "Integer Program", "numeric_objective": 87.0, "objective": "87.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs038/labs038_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs038", "modeling": "QUBO", "numeric_objective": 127.0, "objective": "127", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.016813", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs038/labs038_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:06:52", "date_key": "2024-12-28T18:06:52", "direction": "minimize", "instance": "labs039", "modeling": "Integer Program", "numeric_objective": 99.0, "objective": "99.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.02", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs039/labs039_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs039", "modeling": "QUBO", "numeric_objective": 131.0, "objective": "131", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.033206", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs039/labs039_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:09:43", "date_key": "2024-12-28T18:09:43", "direction": "minimize", "instance": "labs040", "modeling": "Integer Program", "numeric_objective": 116.0, "objective": "116.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs040/labs040_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs040", "modeling": "QUBO", "numeric_objective": 136.0, "objective": "136", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.014499", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs040/labs040_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:13:43", "date_key": "2024-12-28T18:13:43", "direction": "minimize", "instance": "labs041", "modeling": "Integer Program", "numeric_objective": 112.0, "objective": "112.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.01", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs041/labs041_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs041", "modeling": "QUBO", "numeric_objective": 152.0, "objective": "152", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.028264", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs041/labs041_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:14:13", "date_key": "2024-12-28T18:14:13", "direction": "minimize", "instance": "labs042", "modeling": "Integer Program", "numeric_objective": 117.0, "objective": "117.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs042/labs042_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs042", "modeling": "QUBO", "numeric_objective": 149.0, "objective": "149", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.02493", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs042/labs042_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:35:17", "date_key": "2024-12-28T18:35:17", "direction": "minimize", "instance": "labs043", "modeling": "Integer Program", "numeric_objective": 137.0, "objective": "137.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs043/labs043_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs043", "modeling": "QUBO", "numeric_objective": 169.0, "objective": "169", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.023016", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs043/labs043_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 18:54:20", "date_key": "2024-12-28T18:54:20", "direction": "minimize", "instance": "labs044", "modeling": "Integer Program", "numeric_objective": 146.0, "objective": "146.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs044/labs044_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs044", "modeling": "QUBO", "numeric_objective": 166.0, "objective": "166", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.027297", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs044/labs044_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 19:33:55", "date_key": "2024-12-28T19:33:55", "direction": "minimize", "instance": "labs045", "modeling": "Integer Program", "numeric_objective": 154.0, "objective": "154.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.1", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs045/labs045_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs045", "modeling": "QUBO", "numeric_objective": 182.0, "objective": "182", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.03801", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs045/labs045_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:01:33", "date_key": "2024-12-28T20:01:33", "direction": "minimize", "instance": "labs046", "modeling": "Integer Program", "numeric_objective": 179.0, "objective": "179.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.22", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs046/labs046_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs046", "modeling": "QUBO", "numeric_objective": 203.0, "objective": "203", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.036122", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs046/labs046_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:05:54", "date_key": "2024-12-28T20:05:54", "direction": "minimize", "instance": "labs047", "modeling": "Integer Program", "numeric_objective": 175.0, "objective": "175.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.17", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs047/labs047_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs047", "modeling": "QUBO", "numeric_objective": 219.0, "objective": "219", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.032261", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs047/labs047_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs048", "modeling": "QUBO", "numeric_objective": 196.0, "objective": "196", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.038131", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs048/labs048_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:07:34", "date_key": "2024-12-28T20:07:34", "direction": "minimize", "instance": "labs048", "modeling": "Integer Program", "numeric_objective": 200.0, "objective": "200.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs048/labs048_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:10:04", "date_key": "2024-12-28T20:10:04", "direction": "minimize", "instance": "labs049", "modeling": "Integer Program", "numeric_objective": 216.0, "objective": "216.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs049/labs049_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs049", "modeling": "QUBO", "numeric_objective": 216.0, "objective": "216", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.033916", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs049/labs049_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:14:05", "date_key": "2024-12-28T20:14:05", "direction": "minimize", "instance": "labs050", "modeling": "Integer Program", "numeric_objective": 225.0, "objective": "225.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs050/labs050_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs050", "modeling": "QUBO", "numeric_objective": 265.0, "objective": "265", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.046166", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs050/labs050_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:14:35", "date_key": "2024-12-28T20:14:35", "direction": "minimize", "instance": "labs051", "modeling": "Integer Program", "numeric_objective": 245.0, "objective": "245.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs051/labs051_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs051", "modeling": "QUBO", "numeric_objective": 265.0, "objective": "265", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.046953", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs051/labs051_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:35:37", "date_key": "2024-12-28T20:35:37", "direction": "minimize", "instance": "labs052", "modeling": "Integer Program", "numeric_objective": 214.0, "objective": "214.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs052/labs052_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs052", "modeling": "QUBO", "numeric_objective": 254.0, "objective": "254", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.022491", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs052/labs052_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 20:54:43", "date_key": "2024-12-28T20:54:43", "direction": "minimize", "instance": "labs053", "modeling": "Integer Program", "numeric_objective": 270.0, "objective": "270.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.08", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs053/labs053_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs053", "modeling": "QUBO", "numeric_objective": 270.0, "objective": "270", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.029794", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs053/labs053_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs054", "modeling": "QUBO", "numeric_objective": 255.0, "objective": "255", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.033765", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs054/labs054_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 21:34:24", "date_key": "2024-12-28T21:34:24", "direction": "minimize", "instance": "labs054", "modeling": "Integer Program", "numeric_objective": 279.0, "objective": "279.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs054/labs054_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:01:56", "date_key": "2024-12-28T22:01:56", "direction": "minimize", "instance": "labs055", "modeling": "Integer Program", "numeric_objective": 271.0, "objective": "271.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.15", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs055/labs055_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs055", "modeling": "QUBO", "numeric_objective": 283.0, "objective": "283", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.038619", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs055/labs055_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:06:03", "date_key": "2024-12-28T22:06:03", "direction": "minimize", "instance": "labs056", "modeling": "Integer Program", "numeric_objective": 252.0, "objective": "252.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.23", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs056/labs056_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs056", "modeling": "QUBO", "numeric_objective": 276.0, "objective": "276", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.035261", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs056/labs056_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs057", "modeling": "QUBO", "numeric_objective": 320.0, "objective": "320", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.024312", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs057/labs057_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:07:56", "date_key": "2024-12-28T22:07:56", "direction": "minimize", "instance": "labs057", "modeling": "Integer Program", "numeric_objective": 328.0, "objective": "328.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs057/labs057_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs058", "modeling": "QUBO", "numeric_objective": 317.0, "objective": "317", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.03032", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs058/labs058_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:10:34", "date_key": "2024-12-28T22:10:34", "direction": "minimize", "instance": "labs058", "modeling": "Integer Program", "numeric_objective": 325.0, "objective": "325.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs058/labs058_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs059", "modeling": "QUBO", "numeric_objective": 333.0, "objective": "333", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.029999", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs059/labs059_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:14:35", "date_key": "2024-12-28T22:14:35", "direction": "minimize", "instance": "labs059", "modeling": "Integer Program", "numeric_objective": 345.0, "objective": "345.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.11", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs059/labs059_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:14:56", "date_key": "2024-12-28T22:14:56", "direction": "minimize", "instance": "labs060", "modeling": "Integer Program", "numeric_objective": 326.0, "objective": "326.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.43", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs060/labs060_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs060", "modeling": "QUBO", "numeric_objective": 366.0, "objective": "366", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.035827", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs060/labs060_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs061", "modeling": "QUBO", "numeric_objective": 346.0, "objective": "346", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.038152", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs061/labs061_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:35:56", "date_key": "2024-12-28T22:35:56", "direction": "minimize", "instance": "labs061", "modeling": "Integer Program", "numeric_objective": 374.0, "objective": "374.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.02", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs061/labs061_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 22:54:57", "date_key": "2024-12-28T22:54:57", "direction": "minimize", "instance": "labs062", "modeling": "Integer Program", "numeric_objective": 379.0, "objective": "379.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs062/labs062_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs062", "modeling": "QUBO", "numeric_objective": 379.0, "objective": "379", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.041961", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs062/labs062_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs063", "modeling": "QUBO", "numeric_objective": 387.0, "objective": "387", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.040333", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs063/labs063_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-28 23:34:55", "date_key": "2024-12-28T23:34:55", "direction": "minimize", "instance": "labs063", "modeling": "Integer Program", "numeric_objective": 419.0, "objective": "419.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.1", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs063/labs063_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs064", "modeling": "QUBO", "numeric_objective": 412.0, "objective": "412", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.033372", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs064/labs064_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:02:30", "date_key": "2024-12-29T00:02:30", "direction": "minimize", "instance": "labs064", "modeling": "Integer Program", "numeric_objective": 424.0, "objective": "424.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.11", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs064/labs064_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:06:31", "date_key": "2024-12-29T00:06:31", "direction": "minimize", "instance": "labs065", "modeling": "Integer Program", "numeric_objective": 368.0, "objective": "368.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs065/labs065_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs065", "modeling": "QUBO", "numeric_objective": 460.0, "objective": "460", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.046229", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs065/labs065_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs066", "modeling": "QUBO", "numeric_objective": 417.0, "objective": "417", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.049071", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs066/labs066_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:08:31", "date_key": "2024-12-29T00:08:31", "direction": "minimize", "instance": "labs066", "modeling": "Integer Program", "numeric_objective": 481.0, "objective": "481.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs066/labs066_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs067", "modeling": "QUBO", "numeric_objective": 457.0, "objective": "457", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.053484", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs067/labs067_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:10:56", "date_key": "2024-12-29T00:10:56", "direction": "minimize", "instance": "labs067", "modeling": "Integer Program", "numeric_objective": 465.0, "objective": "465.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs067/labs067_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs068", "modeling": "QUBO", "numeric_objective": 402.0, "objective": "402", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.063434", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs068/labs068_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:14:57", "date_key": "2024-12-29T00:14:57", "direction": "minimize", "instance": "labs068", "modeling": "Integer Program", "numeric_objective": 514.0, "objective": "514.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs068/labs068_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs069", "modeling": "QUBO", "numeric_objective": 446.0, "objective": "446", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.065684", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs069/labs069_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:15:02", "date_key": "2024-12-29T00:15:02", "direction": "minimize", "instance": "labs069", "modeling": "Integer Program", "numeric_objective": 538.0, "objective": "538.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs069/labs069_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs070", "modeling": "QUBO", "numeric_objective": 527.0, "objective": "527", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.055372", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs070/labs070_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:36:06", "date_key": "2024-12-29T00:36:06", "direction": "minimize", "instance": "labs070", "modeling": "Integer Program", "numeric_objective": 543.0, "objective": "543.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.18", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs070/labs070_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs071", "modeling": "QUBO", "numeric_objective": 499.0, "objective": "499", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.064044", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs071/labs071_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 00:55:09", "date_key": "2024-12-29T00:55:09", "direction": "minimize", "instance": "labs071", "modeling": "Integer Program", "numeric_objective": 547.0, "objective": "547.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs071/labs071_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 01:35:14", "date_key": "2024-12-29T01:35:14", "direction": "minimize", "instance": "labs072", "modeling": "Integer Program", "numeric_objective": 492.0, "objective": "492.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs072/labs072_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs072", "modeling": "QUBO", "numeric_objective": 516.0, "objective": "516", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.063074", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs072/labs072_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:02:47", "date_key": "2024-12-29T02:02:47", "direction": "minimize", "instance": "labs073", "modeling": "Integer Program", "numeric_objective": 548.0, "objective": "548.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.62", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs073/labs073_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs073", "modeling": "QUBO", "numeric_objective": 560.0, "objective": "560", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.074287", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs073/labs073_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs074", "modeling": "QUBO", "numeric_objective": 557.0, "objective": "557", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.070515", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs074/labs074_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:06:47", "date_key": "2024-12-29T02:06:47", "direction": "minimize", "instance": "labs074", "modeling": "Integer Program", "numeric_objective": 637.0, "objective": "637.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs074/labs074_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs075", "modeling": "QUBO", "numeric_objective": 553.0, "objective": "553", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.062822", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs075/labs075_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:08:47", "date_key": "2024-12-29T02:08:47", "direction": "minimize", "instance": "labs075", "modeling": "Integer Program", "numeric_objective": 585.0, "objective": "585.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.08", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs075/labs075_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:11:18", "date_key": "2024-12-29T02:11:18", "direction": "minimize", "instance": "labs076", "modeling": "Integer Program", "numeric_objective": 566.0, "objective": "566.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs076/labs076_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs076", "modeling": "QUBO", "numeric_objective": 602.0, "objective": "602", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.05874", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs076/labs076_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs077", "modeling": "QUBO", "numeric_objective": 610.0, "objective": "610", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.07046", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs077/labs077_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:15:18", "date_key": "2024-12-29T02:15:18", "direction": "minimize", "instance": "labs077", "modeling": "Integer Program", "numeric_objective": 654.0, "objective": "654.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.08", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs077/labs077_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs078", "modeling": "QUBO", "numeric_objective": 643.0, "objective": "643", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.085918", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs078/labs078_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:15:18", "date_key": "2024-12-29T02:15:18", "direction": "minimize", "instance": "labs078", "modeling": "Integer Program", "numeric_objective": 755.0, "objective": "755.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs078/labs078_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs079", "modeling": "QUBO", "numeric_objective": 611.0, "objective": "611", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.088588", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs079/labs079_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:36:20", "date_key": "2024-12-29T02:36:20", "direction": "minimize", "instance": "labs079", "modeling": "Integer Program", "numeric_objective": 671.0, "objective": "671.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.02", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs079/labs079_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs080", "modeling": "QUBO", "numeric_objective": 644.0, "objective": "644", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.091549", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs080/labs080_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 02:55:22", "date_key": "2024-12-29T02:55:22", "direction": "minimize", "instance": "labs080", "modeling": "Integer Program", "numeric_objective": 672.0, "objective": "672.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.09", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs080/labs080_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs081", "modeling": "QUBO", "numeric_objective": 616.0, "objective": "616", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.080491", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs081/labs081_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 03:35:18", "date_key": "2024-12-29T03:35:18", "direction": "minimize", "instance": "labs081", "modeling": "Integer Program", "numeric_objective": 840.0, "objective": "840.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs081/labs081_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs082", "modeling": "QUBO", "numeric_objective": 665.0, "objective": "665", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.096346", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs082/labs082_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:02:52", "date_key": "2024-12-29T04:02:52", "direction": "minimize", "instance": "labs082", "modeling": "Integer Program", "numeric_objective": 809.0, "objective": "809.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.09", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs082/labs082_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs083", "modeling": "QUBO", "numeric_objective": 701.0, "objective": "701", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.084329", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs083/labs083_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:06:50", "date_key": "2024-12-29T04:06:50", "direction": "minimize", "instance": "labs083", "modeling": "Integer Program", "numeric_objective": 749.0, "objective": "749.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs083/labs083_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs084", "modeling": "QUBO", "numeric_objective": 714.0, "objective": "714", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.08125", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs084/labs084_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:08:50", "date_key": "2024-12-29T04:08:50", "direction": "minimize", "instance": "labs084", "modeling": "Integer Program", "numeric_objective": 914.0, "objective": "914.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.09", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs084/labs084_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs085", "modeling": "QUBO", "numeric_objective": 786.0, "objective": "786", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.099192", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs085/labs085_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:11:20", "date_key": "2024-12-29T04:11:20", "direction": "minimize", "instance": "labs085", "modeling": "Integer Program", "numeric_objective": 862.0, "objective": "862.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.08", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs085/labs085_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs086", "modeling": "QUBO", "numeric_objective": 831.0, "objective": "831", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.101609", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs086/labs086_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:15:21", "date_key": "2024-12-29T04:15:21", "direction": "minimize", "instance": "labs086", "modeling": "Integer Program", "numeric_objective": 887.0, "objective": "887.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs086/labs086_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs087", "modeling": "QUBO", "numeric_objective": 815.0, "objective": "815", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.090492", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs087/labs087_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:15:24", "date_key": "2024-12-29T04:15:24", "direction": "minimize", "instance": "labs087", "modeling": "Integer Program", "numeric_objective": 863.0, "objective": "863.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs087/labs087_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs088", "modeling": "QUBO", "numeric_objective": 748.0, "objective": "748", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.141375", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs088/labs088_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:36:23", "date_key": "2024-12-29T04:36:23", "direction": "minimize", "instance": "labs088", "modeling": "Integer Program", "numeric_objective": 960.0, "objective": "960.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.12", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs088/labs088_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs089", "modeling": "QUBO", "numeric_objective": 844.0, "objective": "844", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.116488", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs089/labs089_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 04:55:24", "date_key": "2024-12-29T04:55:24", "direction": "minimize", "instance": "labs089", "modeling": "Integer Program", "numeric_objective": 1080.0, "objective": "1080.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs089/labs089_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs090", "modeling": "QUBO", "numeric_objective": 829.0, "objective": "829", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.142236", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs090/labs090_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 05:35:21", "date_key": "2024-12-29T05:35:21", "direction": "minimize", "instance": "labs090", "modeling": "Integer Program", "numeric_objective": 1037.0, "objective": "1037.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs090/labs090_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs091", "modeling": "QUBO", "numeric_objective": 913.0, "objective": "913", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.129078", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs091/labs091_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:02:56", "date_key": "2024-12-29T06:02:56", "direction": "minimize", "instance": "labs091", "modeling": "Integer Program", "numeric_objective": 1025.0, "objective": "1025.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs091/labs091_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs092", "modeling": "QUBO", "numeric_objective": 818.0, "objective": "818", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.180133", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs092/labs092_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:06:53", "date_key": "2024-12-29T06:06:53", "direction": "minimize", "instance": "labs092", "modeling": "Integer Program", "numeric_objective": 1010.0, "objective": "1010.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs092/labs092_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs093", "modeling": "QUBO", "numeric_objective": 898.0, "objective": "898", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.156733", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs093/labs093_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:08:52", "date_key": "2024-12-29T06:08:52", "direction": "minimize", "instance": "labs093", "modeling": "Integer Program", "numeric_objective": 1082.0, "objective": "1082.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs093/labs093_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs094", "modeling": "QUBO", "numeric_objective": 931.0, "objective": "931", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.116894", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs094/labs094_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:11:21", "date_key": "2024-12-29T06:11:21", "direction": "minimize", "instance": "labs094", "modeling": "Integer Program", "numeric_objective": 1003.0, "objective": "1003.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs094/labs094_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs095", "modeling": "QUBO", "numeric_objective": 967.0, "objective": "967", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.157069", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs095/labs095_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:15:22", "date_key": "2024-12-29T06:15:22", "direction": "minimize", "instance": "labs095", "modeling": "Integer Program", "numeric_objective": 1103.0, "objective": "1103.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs095/labs095_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs096", "modeling": "QUBO", "numeric_objective": 1012.0, "objective": "1012", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.200288", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs096/labs096_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:15:25", "date_key": "2024-12-29T06:15:25", "direction": "minimize", "instance": "labs096", "modeling": "Integer Program", "numeric_objective": 1504.0, "objective": "1504.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs096/labs096_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs097", "modeling": "QUBO", "numeric_objective": 988.0, "objective": "988", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.207158", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs097/labs097_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:36:24", "date_key": "2024-12-29T06:36:24", "direction": "minimize", "instance": "labs097", "modeling": "Integer Program", "numeric_objective": 1588.0, "objective": "1588.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs097/labs097_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs098", "modeling": "QUBO", "numeric_objective": 1049.0, "objective": "1049", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.221728", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs098/labs098_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 06:55:26", "date_key": "2024-12-29T06:55:26", "direction": "minimize", "instance": "labs098", "modeling": "Integer Program", "numeric_objective": 1585.0, "objective": "1585.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs098/labs098_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs099", "modeling": "QUBO", "numeric_objective": 1009.0, "objective": "1009", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.185881", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs099/labs099_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 07:35:22", "date_key": "2024-12-29T07:35:22", "direction": "minimize", "instance": "labs099", "modeling": "Integer Program", "numeric_objective": 1797.0, "objective": "1797.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.14", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs099/labs099_summary.csv" }, { "algorithm": "Deterministic", "date": "21. Feb. 2025", "date_key": "2025-02-21T00:00:00", "direction": "minimize", "instance": "labs100", "modeling": "QUBO", "numeric_objective": 1050.0, "objective": "1050", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "600.165987", "submission_set": "20250221_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs100/labs100_summary.csv" }, { "algorithm": "Deterministic", "date": "2024-12-29 08:02:58", "date_key": "2024-12-29T08:02:58", "direction": "minimize", "instance": "labs100", "modeling": "Integer Program", "numeric_objective": 1902.0, "objective": "1902.0", "problem_dir": "02-labs", "problem_title": "LABS", "rank": 2, "reference": "See Models Directory (integer) using Gurobi 11.0.0", "runtime": "7200.19", "submission_set": "20241229_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs100/labs100_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:38", "date_key": "2026-01-10T20:51:38", "direction": "minimize", "instance": "B3_3_1", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/B3_3_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:04", "date_key": "2026-01-10T20:52:04", "direction": "minimize", "instance": "B3_3_10", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/B3_3_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:41", "date_key": "2026-01-10T20:51:41", "direction": "minimize", "instance": "B3_3_2", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/B3_3_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:44", "date_key": "2026-01-10T20:51:44", "direction": "minimize", "instance": "B3_3_3", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/B3_3_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:47", "date_key": "2026-01-10T20:51:47", "direction": "minimize", "instance": "B3_3_4", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/B3_3_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:50", "date_key": "2026-01-10T20:51:50", "direction": "minimize", "instance": "B3_3_5", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/B3_3_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:53", "date_key": "2026-01-10T20:51:53", "direction": "minimize", "instance": "B3_3_6", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/B3_3_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:56", "date_key": "2026-01-10T20:51:56", "direction": "minimize", "instance": "B3_3_7", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/B3_3_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:51:58", "date_key": "2026-01-10T20:51:58", "direction": "minimize", "instance": "B3_3_8", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/B3_3_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:01", "date_key": "2026-01-10T20:52:01", "direction": "minimize", "instance": "B3_3_9", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/B3_3_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:26", "date_key": "2026-01-10T05:44:26", "direction": "minimize", "instance": "B3_9_1", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/B3_9_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:51", "date_key": "2026-01-10T05:44:51", "direction": "minimize", "instance": "B3_9_10", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/B3_9_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:28", "date_key": "2026-01-10T05:44:28", "direction": "minimize", "instance": "B3_9_2", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/B3_9_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:31", "date_key": "2026-01-10T05:44:31", "direction": "minimize", "instance": "B3_9_3", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/B3_9_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:34", "date_key": "2026-01-10T05:44:34", "direction": "minimize", "instance": "B3_9_4", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/B3_9_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:37", "date_key": "2026-01-10T05:44:37", "direction": "minimize", "instance": "B3_9_5", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/B3_9_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:40", "date_key": "2026-01-10T05:44:40", "direction": "minimize", "instance": "B3_9_6", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/B3_9_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:44", "date_key": "2026-01-10T05:44:44", "direction": "minimize", "instance": "B3_9_7", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/B3_9_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:46", "date_key": "2026-01-10T05:44:46", "direction": "minimize", "instance": "B3_9_8", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/B3_9_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:50", "date_key": "2026-01-10T05:44:50", "direction": "minimize", "instance": "B3_9_9", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/B3_9_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:53", "date_key": "2026-01-10T05:44:53", "direction": "minimize", "instance": "B4_16_1", "modeling": "Binary Linear Program", "numeric_objective": 9.0, "objective": "9.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.03", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/B4_16_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:20", "date_key": "2026-01-10T05:45:20", "direction": "minimize", "instance": "B4_16_10", "modeling": "Binary Linear Program", "numeric_objective": 9.0, "objective": "9.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/B4_16_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:55", "date_key": "2026-01-10T05:44:55", "direction": "minimize", "instance": "B4_16_2", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.14", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/B4_16_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:44:58", "date_key": "2026-01-10T05:44:58", "direction": "minimize", "instance": "B4_16_3", "modeling": "Binary Linear Program", "numeric_objective": 8.0, "objective": "8.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/B4_16_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:02", "date_key": "2026-01-10T05:45:02", "direction": "minimize", "instance": "B4_16_4", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.06", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/B4_16_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:04", "date_key": "2026-01-10T05:45:04", "direction": "minimize", "instance": "B4_16_5", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.17", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/B4_16_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:08", "date_key": "2026-01-10T05:45:08", "direction": "minimize", "instance": "B4_16_6", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.12", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/B4_16_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:11", "date_key": "2026-01-10T05:45:11", "direction": "minimize", "instance": "B4_16_7", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.15", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/B4_16_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:14", "date_key": "2026-01-10T05:45:14", "direction": "minimize", "instance": "B4_16_8", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.15", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/B4_16_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:17", "date_key": "2026-01-10T05:45:17", "direction": "minimize", "instance": "B4_16_9", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.07", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/B4_16_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:07", "date_key": "2026-01-10T20:52:07", "direction": "minimize", "instance": "B4_4_1", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/B4_4_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:34", "date_key": "2026-01-10T20:52:34", "direction": "minimize", "instance": "B4_4_10", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/B4_4_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:10", "date_key": "2026-01-10T20:52:10", "direction": "minimize", "instance": "B4_4_2", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/B4_4_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:13", "date_key": "2026-01-10T20:52:13", "direction": "minimize", "instance": "B4_4_3", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/B4_4_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:16", "date_key": "2026-01-10T20:52:16", "direction": "minimize", "instance": "B4_4_4", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/B4_4_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:19", "date_key": "2026-01-10T20:52:19", "direction": "minimize", "instance": "B4_4_5", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/B4_4_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:22", "date_key": "2026-01-10T20:52:22", "direction": "minimize", "instance": "B4_4_6", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/B4_4_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:25", "date_key": "2026-01-10T20:52:25", "direction": "minimize", "instance": "B4_4_7", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/B4_4_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:28", "date_key": "2026-01-10T20:52:28", "direction": "minimize", "instance": "B4_4_8", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/B4_4_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:31", "date_key": "2026-01-10T20:52:31", "direction": "minimize", "instance": "B4_4_9", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/B4_4_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:45:22", "date_key": "2026-01-10T05:45:22", "direction": "minimize", "instance": "B5_25_1", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "51.3", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/B5_25_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 10:27:24", "date_key": "2026-01-10T10:27:24", "direction": "minimize", "instance": "B5_25_10", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.03", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/B5_25_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 05:46:14", "date_key": "2026-01-10T05:46:14", "direction": "minimize", "instance": "B5_25_2", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.04", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/B5_25_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 07:08:58", "date_key": "2026-01-10T07:08:58", "direction": "minimize", "instance": "B5_25_3", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "77.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/B5_25_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 07:10:17", "date_key": "2026-01-10T07:10:17", "direction": "minimize", "instance": "B5_25_4", "modeling": "Binary Linear Program", "numeric_objective": 13.0, "objective": "13.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "2626.14", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/B5_25_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 07:49:45", "date_key": "2026-01-10T07:49:45", "direction": "minimize", "instance": "B5_25_5", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/B5_25_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 07:54:10", "date_key": "2026-01-10T07:54:10", "direction": "minimize", "instance": "B5_25_6", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/B5_25_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 09:55:08", "date_key": "2026-01-10T09:55:08", "direction": "minimize", "instance": "B5_25_7", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "1761.27", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/B5_25_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 10:01:09", "date_key": "2026-01-10T10:01:09", "direction": "minimize", "instance": "B5_25_8", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "2237.82", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/B5_25_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 10:24:33", "date_key": "2026-01-10T10:24:33", "direction": "minimize", "instance": "B5_25_9", "modeling": "Binary Linear Program", "numeric_objective": 14.0, "objective": "14.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "168.78", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/B5_25_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:37", "date_key": "2026-01-10T20:52:37", "direction": "minimize", "instance": "B5_5_1", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/B5_5_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:01", "date_key": "2026-01-10T20:53:01", "direction": "minimize", "instance": "B5_5_10", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/B5_5_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:40", "date_key": "2026-01-10T20:52:40", "direction": "minimize", "instance": "B5_5_2", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/B5_5_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:43", "date_key": "2026-01-10T20:52:43", "direction": "minimize", "instance": "B5_5_3", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/B5_5_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:46", "date_key": "2026-01-10T20:52:46", "direction": "minimize", "instance": "B5_5_4", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/B5_5_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:49", "date_key": "2026-01-10T20:52:49", "direction": "minimize", "instance": "B5_5_5", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/B5_5_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:52", "date_key": "2026-01-10T20:52:52", "direction": "minimize", "instance": "B5_5_6", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/B5_5_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:55", "date_key": "2026-01-10T20:52:55", "direction": "minimize", "instance": "B5_5_7", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/B5_5_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:58", "date_key": "2026-01-10T20:52:58", "direction": "minimize", "instance": "B5_5_8", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/B5_5_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:52:58", "date_key": "2026-01-10T20:52:58", "direction": "minimize", "instance": "B5_5_9", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/B5_5_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 10:38:31", "date_key": "2026-01-10T10:38:31", "direction": "minimize", "instance": "B6_36_1", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.04", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/B6_36_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:39:55", "date_key": "2026-01-10T20:39:55", "direction": "minimize", "instance": "B6_36_10", "modeling": "Binary Linear Program", "numeric_objective": 20.0, "objective": "20.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.04", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/B6_36_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 12:32:16", "date_key": "2026-01-10T12:32:16", "direction": "minimize", "instance": "B6_36_2", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.03", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/B6_36_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 12:42:07", "date_key": "2026-01-10T12:42:07", "direction": "minimize", "instance": "B6_36_3", "modeling": "Binary Linear Program", "numeric_objective": 21.0, "objective": "21.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/B6_36_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 14:34:41", "date_key": "2026-01-10T14:34:41", "direction": "minimize", "instance": "B6_36_4", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.05", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/B6_36_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 14:43:56", "date_key": "2026-01-10T14:43:56", "direction": "minimize", "instance": "B6_36_5", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/B6_36_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 16:36:20", "date_key": "2026-01-10T16:36:20", "direction": "minimize", "instance": "B6_36_6", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.05", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/B6_36_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 16:46:23", "date_key": "2026-01-10T16:46:23", "direction": "minimize", "instance": "B6_36_7", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.03", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/B6_36_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 18:38:04", "date_key": "2026-01-10T18:38:04", "direction": "minimize", "instance": "B6_36_8", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.03", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/B6_36_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 18:48:52", "date_key": "2026-01-10T18:48:52", "direction": "minimize", "instance": "B6_36_9", "modeling": "Binary Linear Program", "numeric_objective": 22.0, "objective": "22.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "7200.03", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/B6_36_9_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:04", "date_key": "2026-01-10T20:53:04", "direction": "minimize", "instance": "B6_6_1", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.02", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/B6_6_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:28", "date_key": "2026-01-10T20:53:28", "direction": "minimize", "instance": "B6_6_10", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/B6_6_10_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:07", "date_key": "2026-01-10T20:53:07", "direction": "minimize", "instance": "B6_6_2", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/B6_6_2_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:10", "date_key": "2026-01-10T20:53:10", "direction": "minimize", "instance": "B6_6_3", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/B6_6_3_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:13", "date_key": "2026-01-10T20:53:13", "direction": "minimize", "instance": "B6_6_4", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/B6_6_4_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:16", "date_key": "2026-01-10T20:53:16", "direction": "minimize", "instance": "B6_6_5", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/B6_6_5_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:19", "date_key": "2026-01-10T20:53:19", "direction": "minimize", "instance": "B6_6_6", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/B6_6_6_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:22", "date_key": "2026-01-10T20:53:22", "direction": "minimize", "instance": "B6_6_7", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/B6_6_7_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:25", "date_key": "2026-01-10T20:53:25", "direction": "minimize", "instance": "B6_6_8", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/B6_6_8_summary.csv" }, { "algorithm": "Deterministic", "date": "2026-01-10 20:53:28", "date_key": "2026-01-10T20:53:28", "direction": "minimize", "instance": "B6_6_9", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "rank": 1, "reference": "See Models Directory using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20260111_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/B6_6_9_summary.csv" }, { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "minimize", "instance": "po_a010_t10_orig", "modeling": "QUBO", "numeric_objective": -0.030604, "objective": "-0.030604", "problem_dir": "06-portfolio", "problem_title": "Portfolio Optimization", "rank": 1, "reference": "https://arvak.io", "runtime": "0.24", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/po_a010_t10_orig_summary.csv" }, { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "minimize", "instance": "po_a010_t15_orig", "modeling": "QUBO", "numeric_objective": -0.007064, "objective": "-0.007064", "problem_dir": "06-portfolio", "problem_title": "Portfolio Optimization", "rank": 1, "reference": "https://arvak.io", "runtime": "0.17", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/po_a010_t15_orig_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "C125-9", "modeling": "QUBO", "numeric_objective": 34.0, "objective": "34", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.084357", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C125-9/C125-9_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 15:45:47", "date_key": "2025-07-15T15:45:47", "direction": "maximize", "instance": "C125-9", "modeling": "Binary Linear Program", "numeric_objective": 34.0, "objective": "34.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.97", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/C125-9_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "C4000-5", "modeling": "QUBO", "numeric_objective": 18.0, "objective": "18", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.104349", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/C4000-5_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 15:45:49", "date_key": "2025-07-15T15:45:49", "direction": "maximize", "instance": "C4000-5", "modeling": "Binary Linear Program", "numeric_objective": 12.0, "objective": "12.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.12", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C4000-5/C4000-5_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "C500-9", "modeling": "QUBO", "numeric_objective": 57.0, "objective": "57", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.01296", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C500-9/C500-9_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 15:54:37", "date_key": "2025-07-15T15:54:37", "direction": "maximize", "instance": "C500-9", "modeling": "Binary Linear Program", "numeric_objective": 54.0, "objective": "54.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.06", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C500-9/C500-9_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "MANN-a9", "modeling": "QUBO", "numeric_objective": 3.0, "objective": "3", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.165682", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/MANN-a9/MANN-a9_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:02:39", "date_key": "2025-07-15T16:02:39", "direction": "maximize", "instance": "MANN-a9", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.06", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/MANN-a9_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "R_1000_005_1", "modeling": "QUBO", "numeric_objective": 115.0, "objective": "115", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.016193", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/R_1000_005_1_summary.csv" }, { "algorithm": "Deterministic", "date": "Jun 27, 25", "date_key": "2025-06-27T00:00:00", "direction": "maximize", "instance": "R_1000_005_1", "modeling": "QUBO", "numeric_objective": 111.0, "objective": "111", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/R_1000_005_1.ipynb", "runtime": "N/A", "submission_set": "20250627_Quicopt_Bode", "submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/R_1000_005_1/R_1000_005_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:02:41", "date_key": "2025-07-15T16:02:41", "direction": "maximize", "instance": "R_1000_005_1", "modeling": "Binary Linear Program", "numeric_objective": 108.0, "objective": "108.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 3, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.14", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/R_1000_005_1/R_1000_005_1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "R_500_005_1", "modeling": "QUBO", "numeric_objective": 90.0, "objective": "90", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.015039", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/R_500_005_1_summary.csv" }, { "algorithm": "Deterministic", "date": "Jun 27, 25", "date_key": "2025-06-27T00:00:00", "direction": "maximize", "instance": "R_500_005_1", "modeling": "QUBO", "numeric_objective": 89.0, "objective": "89", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/R_500_005_1.ipynb", "runtime": "N/A", "submission_set": "20250627_Quicopt_Bode", "submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/R_500_005_1/R_500_005_1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:09:33", "date_key": "2025-07-15T16:09:33", "direction": "maximize", "instance": "R_500_005_1", "modeling": "Binary Linear Program", "numeric_objective": 89.0, "objective": "89.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.03", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/R_500_005_1/R_500_005_1_summary.csv" }, { "algorithm": "Stochastic", "date": "15. Jan. 2025", "date_key": "2025-01-15T00:00:00", "direction": "maximize", "instance": "aves-sparrow-social", "modeling": "QUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See https://github.com/eggerdj/independent_set_benchmarking", "runtime": "252", "submission_set": "20250115_QAOA_Egger", "submitter": "Daniel Egger", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "algorithm": "Deterministic", "date": "Jun 2, 25", "date_key": "2025-06-27T00:00:00", "direction": "maximize", "instance": "aves-sparrow-social", "modeling": "QUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/aves-sparrow-social.ipynb", "runtime": "N/A", "submission_set": "20250627_Quicopt_Bode", "submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "aves-sparrow-social", "modeling": "QUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.104926", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:43:03", "date_key": "2025-07-15T16:43:03", "direction": "maximize", "instance": "aves-sparrow-social", "modeling": "Binary Linear Program", "numeric_objective": 13.0, "objective": "13.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.03", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "brock200-1", "modeling": "QUBO", "numeric_objective": 6.0, "objective": "6", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.05046", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-1/brock200-1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:43:06", "date_key": "2025-07-15T16:43:06", "direction": "maximize", "instance": "brock200-1", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "5.55", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/brock200-1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "brock200-2", "modeling": "QUBO", "numeric_objective": 12.0, "objective": "12", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.066278", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-2/brock200-2_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:43:13", "date_key": "2025-07-15T16:43:13", "direction": "maximize", "instance": "brock200-2", "modeling": "Binary Linear Program", "numeric_objective": 12.0, "objective": "12.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "5.98", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/brock200-2_summary.csv" }, { "algorithm": "Deterministic", "date": "Jun 27, 25", "date_key": "2025-06-27T00:00:00", "direction": "maximize", "instance": "brock200-2", "modeling": "QUBO", "numeric_objective": 10.0, "objective": "10", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 3, "reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/brock200_2.ipynb", "runtime": "N/A", "submission_set": "20250627_Quicopt_Bode", "submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/brock200-2/brock200-2_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "brock200-3", "modeling": "QUBO", "numeric_objective": 9.0, "objective": "9", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.053338", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-3/brock200-3_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:43:20", "date_key": "2025-07-15T16:43:20", "direction": "maximize", "instance": "brock200-3", "modeling": "Binary Linear Program", "numeric_objective": 9.0, "objective": "9.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7.57", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/brock200-3_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "brock200-4", "modeling": "QUBO", "numeric_objective": 8.0, "objective": "8", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.054376", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-4/brock200-4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:43:28", "date_key": "2025-07-15T16:43:28", "direction": "maximize", "instance": "brock200-4", "modeling": "Binary Linear Program", "numeric_objective": 8.0, "objective": "8.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "6.32", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/brock200-4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "brock400-1", "modeling": "QUBO", "numeric_objective": 27.0, "objective": "27", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "8.466471", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock400-1/brock400-1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 16:43:35", "date_key": "2025-07-15T16:43:35", "direction": "maximize", "instance": "brock400-1", "modeling": "Binary Linear Program", "numeric_objective": 27.0, "objective": "27.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.08", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/brock400-1_summary.csv" }, { "algorithm": "Deterministic", "date": "Jun 27, 25", "date_key": "2025-06-27T00:00:00", "direction": "maximize", "instance": "brock400-1", "modeling": "QUBO", "numeric_objective": 23.0, "objective": "23", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 3, "reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/brock400_1.ipynb", "runtime": "N/A", "submission_set": "20250627_Quicopt_Bode", "submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/brock400-1/brock400-1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "brock800-1", "modeling": "QUBO", "numeric_objective": 23.0, "objective": "23", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "1139.356846", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/brock800-1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:14:00", "date_key": "2025-07-15T17:14:00", "direction": "maximize", "instance": "brock800-1", "modeling": "Binary Linear Program", "numeric_objective": 20.0, "objective": "20.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.32", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock800-1/brock800-1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "c-fat200-1", "modeling": "QUBO", "numeric_objective": 18.0, "objective": "18", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.055902", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/c-fat200-1/c-fat200-1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:03", "date_key": "2025-07-15T17:28:03", "direction": "maximize", "instance": "c-fat200-1", "modeling": "Binary Linear Program", "numeric_objective": 18.0, "objective": "18.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.06", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/c-fat200-1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "chesapeake", "modeling": "QUBO", "numeric_objective": 17.0, "objective": "17", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.117324", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/chesapeake/chesapeake_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:06", "date_key": "2025-07-15T17:28:06", "direction": "maximize", "instance": "chesapeake", "modeling": "Binary Linear Program", "numeric_objective": 17.0, "objective": "17.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.02", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/chesapeake_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "es60fst01", "modeling": "QUBO", "numeric_objective": 60.0, "objective": "60", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.071935", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst01/es60fst01_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:09", "date_key": "2025-07-15T17:28:09", "direction": "maximize", "instance": "es60fst01", "modeling": "Binary Linear Program", "numeric_objective": 60.0, "objective": "60.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.04", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/es60fst01_summary.csv" }, { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "maximize", "instance": "es60fst01", "modeling": "QUBO", "numeric_objective": -27.0, "objective": "-27", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 3, "reference": "https://arvak.io", "runtime": "779", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/es60fst01/es60fst01_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "es60fst02", "modeling": "QUBO", "numeric_objective": 88.0, "objective": "88", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.1272", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst02/es60fst02_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:10", "date_key": "2025-07-15T17:28:10", "direction": "maximize", "instance": "es60fst02", "modeling": "Binary Linear Program", "numeric_objective": 88.0, "objective": "88.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.04", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/es60fst02_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "es60fst03", "modeling": "QUBO", "numeric_objective": 55.0, "objective": "55", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.080255", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst03/es60fst03_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:13", "date_key": "2025-07-15T17:28:13", "direction": "maximize", "instance": "es60fst03", "modeling": "Binary Linear Program", "numeric_objective": 55.0, "objective": "55.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.04", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/es60fst03_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "es60fst04", "modeling": "QUBO", "numeric_objective": 78.0, "objective": "78", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.136957", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst04/es60fst04_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:15", "date_key": "2025-07-15T17:28:15", "direction": "maximize", "instance": "es60fst04", "modeling": "Binary Linear Program", "numeric_objective": 78.0, "objective": "78.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.03", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/es60fst04_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "farm", "modeling": "QUBO", "numeric_objective": 10.0, "objective": "10", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.25367", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/farm/farm_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:16", "date_key": "2025-07-15T17:28:16", "direction": "maximize", "instance": "farm", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/farm/farm_summary.csv" }, { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "maximize", "instance": "farm", "modeling": "QUBO", "numeric_objective": -10.0, "objective": "-10", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 3, "reference": "https://arvak.io", "runtime": "0.4", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/farm/farm_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "football", "modeling": "QUBO", "numeric_objective": 16.0, "objective": "16", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.176563", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/football/football_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:19", "date_key": "2025-07-15T17:28:19", "direction": "maximize", "instance": "football", "modeling": "Binary Linear Program", "numeric_objective": 16.0, "objective": "16.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/football/football_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "frb100-40", "modeling": "QUBO", "numeric_objective": 93.0, "objective": "93", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.097143", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/frb100-40_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:28:22", "date_key": "2025-07-15T17:28:22", "direction": "maximize", "instance": "frb100-40", "modeling": "Binary Linear Program", "numeric_objective": 77.0, "objective": "77.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7205.13", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb100-40/frb100-40_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:42:04", "date_key": "2025-07-15T17:42:04", "direction": "maximize", "instance": "frb45-21-3", "modeling": "Binary Linear Program", "numeric_objective": 44.0, "objective": "44.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7201.46", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/frb45-21-3_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "frb45-21-3", "modeling": "QUBO", "numeric_objective": 43.0, "objective": "43", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.015991", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb45-21-3/frb45-21-3_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "frb50-23-3", "modeling": "QUBO", "numeric_objective": 49.0, "objective": "49", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.016719", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/frb50-23-3_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:45:56", "date_key": "2025-07-15T17:45:56", "direction": "maximize", "instance": "frb50-23-3", "modeling": "Binary Linear Program", "numeric_objective": 48.0, "objective": "48.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.17", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb50-23-3/frb50-23-3_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "frb53-24-1", "modeling": "QUBO", "numeric_objective": 51.0, "objective": "51", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.021163", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/frb53-24-1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:49:06", "date_key": "2025-07-15T17:49:06", "direction": "maximize", "instance": "frb53-24-1", "modeling": "Binary Linear Program", "numeric_objective": 50.0, "objective": "50.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.14", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb53-24-1/frb53-24-1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "frb59-26-2", "modeling": "QUBO", "numeric_objective": 56.0, "objective": "56", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.026409", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb59-26-2/frb59-26-2_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 17:55:06", "date_key": "2025-07-15T17:55:06", "direction": "maximize", "instance": "frb59-26-2", "modeling": "Binary Linear Program", "numeric_objective": 56.0, "objective": "56.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.83", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/frb59-26-2_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "gen200_p0-9_44", "modeling": "QUBO", "numeric_objective": 44.0, "objective": "44", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.077412", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:02:44", "date_key": "2025-07-15T18:02:44", "direction": "maximize", "instance": "gen200_p0-9_44", "modeling": "Binary Linear Program", "numeric_objective": 44.0, "objective": "44.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.1", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "hamming10-4", "modeling": "QUBO", "numeric_objective": 40.0, "objective": "40", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.015458", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming10-4/hamming10-4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:02:47", "date_key": "2025-07-15T18:02:47", "direction": "maximize", "instance": "hamming10-4", "modeling": "Binary Linear Program", "numeric_objective": 40.0, "objective": "40.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.16", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/hamming10-4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "hamming6-2", "modeling": "QUBO", "numeric_objective": 2.0, "objective": "2", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.0982", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming6-2/hamming6-2_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:13", "date_key": "2025-07-15T18:10:13", "direction": "maximize", "instance": "hamming6-2", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.03", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/hamming6-2_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "hamming6-4", "modeling": "QUBO", "numeric_objective": 12.0, "objective": "12", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.099993", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming6-4/hamming6-4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:16", "date_key": "2025-07-15T18:10:16", "direction": "maximize", "instance": "hamming6-4", "modeling": "Binary Linear Program", "numeric_objective": 12.0, "objective": "12.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.22", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/hamming6-4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "ibm32", "modeling": "QUBO", "numeric_objective": 13.0, "objective": "13", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.14448", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/ibm32/ibm32_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:20", "date_key": "2025-07-15T18:10:20", "direction": "maximize", "instance": "ibm32", "modeling": "Binary Linear Program", "numeric_objective": 13.0, "objective": "13.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.02", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/ibm32_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "insecta-ant-colony1-day38", "modeling": "QUBO", "numeric_objective": 6.0, "objective": "6", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.098633", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:21", "date_key": "2025-07-15T18:10:21", "direction": "maximize", "instance": "insecta-ant-colony1-day38", "modeling": "Binary Linear Program", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.03", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "insecta-ant-colony3-day09", "modeling": "QUBO", "numeric_objective": 9.0, "objective": "9", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.061239", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:23", "date_key": "2025-07-15T18:10:23", "direction": "maximize", "instance": "insecta-ant-colony3-day09", "modeling": "Binary Linear Program", "numeric_objective": 9.0, "objective": "9.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.23", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "johnson16-2-4", "modeling": "QUBO", "numeric_objective": 15.0, "objective": "15", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.087709", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson16-2-4/johnson16-2-4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:26", "date_key": "2025-07-15T18:10:26", "direction": "maximize", "instance": "johnson16-2-4", "modeling": "Binary Linear Program", "numeric_objective": 15.0, "objective": "15.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.06", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/johnson16-2-4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "johnson8-2-4", "modeling": "QUBO", "numeric_objective": 7.0, "objective": "7", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.279965", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson8-2-4/johnson8-2-4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:29", "date_key": "2025-07-15T18:10:29", "direction": "maximize", "instance": "johnson8-2-4", "modeling": "Binary Linear Program", "numeric_objective": 7.0, "objective": "7.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/johnson8-2-4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "johnson8-4-4", "modeling": "QUBO", "numeric_objective": 5.0, "objective": "5", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.108894", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson8-4-4/johnson8-4-4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:32", "date_key": "2025-07-15T18:10:32", "direction": "maximize", "instance": "johnson8-4-4", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.08", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/johnson8-4-4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "karate", "modeling": "QUBO", "numeric_objective": 20.0, "objective": "20", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.183669", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/karate/karate_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:34", "date_key": "2025-07-15T18:10:34", "direction": "maximize", "instance": "karate", "modeling": "Binary Linear Program", "numeric_objective": 20.0, "objective": "20.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.01", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/karate/karate_summary.csv" }, { "algorithm": "Stochastic", "date": "8. Mar. 2026", "date_key": "2026-03-08T00:00:00", "direction": "maximize", "instance": "karate", "modeling": "QUBO", "numeric_objective": -16.0, "objective": "-16", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 3, "reference": "https://arvak.io", "runtime": "0.6", "submission_set": "20260308_Arvak_Hinderink", "submitter": "Daniel Hinderink (hiq-lab)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/karate/karate_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "keller4", "modeling": "QUBO", "numeric_objective": 11.0, "objective": "11", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.070807", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller4/keller4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:38", "date_key": "2025-07-15T18:10:38", "direction": "maximize", "instance": "keller4", "modeling": "Binary Linear Program", "numeric_objective": 11.0, "objective": "11.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "1.66", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller4/keller4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "keller6", "modeling": "QUBO", "numeric_objective": 59.0, "objective": "59", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.056106", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller6/keller6_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:10:41", "date_key": "2025-07-15T18:10:41", "direction": "maximize", "instance": "keller6", "modeling": "Binary Linear Program", "numeric_objective": 41.0, "objective": "41.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.07", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller6/keller6_summary.csv" }, { "algorithm": "Stochastic", "date": "15. Jan. 2025", "date_key": "2025-01-15T00:00:00", "direction": "maximize", "instance": "mammalia-kangaroo-interactions", "modeling": "QUBO", "numeric_objective": 4.0, "objective": "4", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See https://github.com/eggerdj/independent_set_benchmarking", "runtime": "87", "submission_set": "20250115_QAOA_Egger", "submitter": "Daniel Egger", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "algorithm": "Deterministic", "date": "Jun 2, 25", "date_key": "2025-06-27T00:00:00", "direction": "maximize", "instance": "mammalia-kangaroo-interactions", "modeling": "QUBO", "numeric_objective": 4.0, "objective": "4", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/mammalia-kangaroo-interactions.ipynb", "runtime": "N/A", "submission_set": "20250627_Quicopt_Bode", "submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "mammalia-kangaroo-interactions", "modeling": "QUBO", "numeric_objective": 4.0, "objective": "4", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.152356", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:44:07", "date_key": "2025-07-15T18:44:07", "direction": "maximize", "instance": "mammalia-kangaroo-interactions", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.0", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "p_hat1500-1", "modeling": "QUBO", "numeric_objective": 12.0, "objective": "12", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "2.488459", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/p_hat1500-1_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 18:44:10", "date_key": "2025-07-15T18:44:10", "direction": "maximize", "instance": "p_hat1500-1", "modeling": "Binary Linear Program", "numeric_objective": 11.0, "objective": "11.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7201.43", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-1/p_hat1500-1_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "p_hat1500-3", "modeling": "QUBO", "numeric_objective": 94.0, "objective": "94", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.194412", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-3/p_hat1500-3_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:14:03", "date_key": "2025-07-15T19:14:03", "direction": "maximize", "instance": "p_hat1500-3", "modeling": "Binary Linear Program", "numeric_objective": 94.0, "objective": "94.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.84", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/p_hat1500-3_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "sloane_1dc_128", "modeling": "QUBO", "numeric_objective": 16.0, "objective": "16", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.084904", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:18:47", "date_key": "2025-07-15T19:18:47", "direction": "maximize", "instance": "sloane_1dc_128", "modeling": "Binary Linear Program", "numeric_objective": 16.0, "objective": "16.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.11", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "sloane_1dc_64", "modeling": "QUBO", "numeric_objective": 10.0, "objective": "10", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.127906", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:18:49", "date_key": "2025-07-15T19:18:49", "direction": "maximize", "instance": "sloane_1dc_64", "modeling": "Binary Linear Program", "numeric_objective": 10.0, "objective": "10.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.02", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "sloane_1zc_128", "modeling": "QUBO", "numeric_objective": 18.0, "objective": "18", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.086511", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:18:52", "date_key": "2025-07-15T19:18:52", "direction": "maximize", "instance": "sloane_1zc_128", "modeling": "Binary Linear Program", "numeric_objective": 18.0, "objective": "18.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.22", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "sloane_2dc_128", "modeling": "QUBO", "numeric_objective": 5.0, "objective": "5", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "0.087573", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:18:55", "date_key": "2025-07-15T19:18:55", "direction": "maximize", "instance": "sloane_2dc_128", "modeling": "Binary Linear Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "0.06", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "socfb-haverford76", "modeling": "QUBO", "numeric_objective": 282.0, "objective": "282", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.023676", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-haverford76/socfb-haverford76_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:18:58", "date_key": "2025-07-15T19:18:58", "direction": "maximize", "instance": "socfb-haverford76", "modeling": "Binary Linear Program", "numeric_objective": 282.0, "objective": "282.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "838.67", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/socfb-haverford76_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "socfb-trinity100", "modeling": "QUBO", "numeric_objective": 499.0, "objective": "499", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.057372", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/socfb-trinity100_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:28:32", "date_key": "2025-07-15T19:28:32", "direction": "maximize", "instance": "socfb-trinity100", "modeling": "Binary Linear Program", "numeric_objective": 498.0, "objective": "498.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.2", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-trinity100/socfb-trinity100_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "sorrell4", "modeling": "QUBO", "numeric_objective": 24.0, "objective": "24", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "1708.889542", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/sorrell4_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:32:59", "date_key": "2025-07-15T19:32:59", "direction": "maximize", "instance": "sorrell4", "modeling": "Binary Linear Program", "numeric_objective": 23.0, "objective": "23.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.22", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sorrell4/sorrell4_summary.csv" }, { "algorithm": "Deterministic", "date": "15. Jul. 2025", "date_key": "2025-07-15T00:00:00", "direction": "maximize", "instance": "sorrell7", "modeling": "QUBO", "numeric_objective": 189.0, "objective": "189", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 1, "reference": "See Models Directory (UQO) using abs2", "runtime": "7200.038177", "submission_set": "20250715_Abs2_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/sorrell7_summary.csv" }, { "algorithm": "Deterministic", "date": "2025-07-15 19:42:09", "date_key": "2025-07-15T19:42:09", "direction": "maximize", "instance": "sorrell7", "modeling": "Binary Linear Program", "numeric_objective": 185.0, "objective": "185.0", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "rank": 2, "reference": "See Models Directory (BLP) using Gurobi 12.0.1", "runtime": "7200.06", "submission_set": "20250715_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sorrell7/sorrell7_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network05", "modeling": "Integer Linear Program", "numeric_objective": 65500.0, "objective": "65500.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.14", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network05/network05_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network06", "modeling": "Integer Linear Program", "numeric_objective": 101000.0, "objective": "101000.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "0.51", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network06/network06_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network07", "modeling": "Integer Linear Program", "numeric_objective": 142400.0, "objective": "142400.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "1.61", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network07/network07_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network08", "modeling": "Integer Linear Program", "numeric_objective": 170231.0, "objective": "170231.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "21.77", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network08/network08_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network09", "modeling": "Integer Linear Program", "numeric_objective": 196750.0, "objective": "196750.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "620.56", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network09/network09_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network10", "modeling": "Integer Linear Program", "numeric_objective": 210800.0, "objective": "210800.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network10/network10_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network11", "modeling": "Integer Linear Program", "numeric_objective": 240818.0, "objective": "240818.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network11/network11_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network12", "modeling": "Integer Linear Program", "numeric_objective": 285643.0, "objective": "285643.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.08", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network12/network12_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network13", "modeling": "Integer Linear Program", "numeric_objective": 313000.0, "objective": "313000.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.08", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network13/network13_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network14", "modeling": "Integer Linear Program", "numeric_objective": 367899.0, "objective": "367899.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.42", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network14/network14_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network15", "modeling": "Integer Linear Program", "numeric_objective": 397000.0, "objective": "397000.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network15/network15_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network16", "modeling": "Integer Linear Program", "numeric_objective": 430000.0, "objective": "430000.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.11", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network16/network16_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network17", "modeling": "Integer Linear Program", "numeric_objective": 488699.0, "objective": "488699.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.12", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network17/network17_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network18", "modeling": "Integer Linear Program", "numeric_objective": 517398.0, "objective": "517398.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network18/network18_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network19", "modeling": "Integer Linear Program", "numeric_objective": 565570.0, "objective": "565570.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network19/network19_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network20", "modeling": "Integer Linear Program", "numeric_objective": 570974.0, "objective": "570974.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network20/network20_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network21", "modeling": "Integer Linear Program", "numeric_objective": 641249.0, "objective": "641249.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network21/network21_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network22", "modeling": "Integer Linear Program", "numeric_objective": 709597.0, "objective": "709597.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network22/network22_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network23", "modeling": "Integer Linear Program", "numeric_objective": 749923.0, "objective": "749923.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network23/network23_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "network24", "modeling": "Integer Linear Program", "numeric_objective": 779410.0, "objective": "779410.0", "problem_dir": "08-network", "problem_title": "Network Design", "rank": 1, "reference": "See Models Directory using Gurobi 11.0.0", "runtime": "7200.1", "submission_set": "20250102_Gurobi_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network24/network24_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_15_3", "modeling": "Flow MIP", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "94.05", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_3/topology_15_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_15_3", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "3.27", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_3/topology_15_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_15_3", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "2.68", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/topology_15_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_15_4", "modeling": "Flow MIP", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "9.05", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_4/topology_15_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_15_4", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "3.67", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_4/topology_15_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_15_4", "modeling": "Binary Quadratic Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "1.13", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/topology_15_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_3", "modeling": "Flow MIP", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "1424.35", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_3/topology_20_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_3", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "51.55", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_3/topology_20_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_3", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "61.94", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/topology_20_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_4", "modeling": "Flow MIP", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "1150.18", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_4/topology_20_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_4", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "3.84", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_4/topology_20_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_4", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "3.9", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/topology_20_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_5", "modeling": "Flow MIP", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "342.91", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_5/topology_20_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_5", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "16.13", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_5/topology_20_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_20_5", "modeling": "Binary Quadratic Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "14.34", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/topology_20_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_3", "modeling": "Flow MIP", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.66", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_3/topology_25_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_3", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "3325.17", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_3/topology_25_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_3", "modeling": "Binary Quadratic Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "3934.27", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/topology_25_3_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_4", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "497.25", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_4/topology_25_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_4", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "380.05", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/topology_25_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_4", "modeling": "Flow MIP", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.72", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_4/topology_25_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_5", "modeling": "Flow MIP", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.18", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_5/topology_25_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_5", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "210.11", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_5/topology_25_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_5", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "158.43", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/topology_25_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_6", "modeling": "Flow MIP", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "3101.31", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_6/topology_25_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_6", "modeling": "Binary Linear Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "94.05", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_6/topology_25_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_25_6", "modeling": "Binary Quadratic Program", "numeric_objective": 2.0, "objective": "2.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "36.82", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/topology_25_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_4", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "6487.33", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/topology_30_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_4", "modeling": "Binary Quadratic Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 2, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_4/topology_30_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_4", "modeling": "Flow MIP", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.48", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_4/topology_30_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_5", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "1009.57", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_5/topology_30_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_5", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "1209.86", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/topology_30_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_5", "modeling": "Flow MIP", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.26", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_5/topology_30_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_6", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "7200.39", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_6/topology_30_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_6", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "7200.31", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/topology_30_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_30_6", "modeling": "Flow MIP", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7201.86", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_6/topology_30_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_35_5", "modeling": "Binary Linear Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "7200.16", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_5/topology_35_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_35_5", "modeling": "Binary Quadratic Program", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "7200.03", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/topology_35_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_35_5", "modeling": "Flow MIP", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.09", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_5/topology_35_5_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_35_6", "modeling": "Binary Linear Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "7200.11", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_6/topology_35_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_35_6", "modeling": "Binary Quadratic Program", "numeric_objective": 3.0, "objective": "3.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/topology_35_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_35_6", "modeling": "Flow MIP", "numeric_objective": 4.0, "objective": "4.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.06", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_6/topology_35_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_40_6", "modeling": "Flow MIP", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.16", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_40_6/topology_40_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_40_6", "modeling": "Binary Quadratic Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "7200.05", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/topology_40_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_40_6", "modeling": "Binary Linear Program", "numeric_objective": 12.0, "objective": "12.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 3, "reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "runtime": "7200.04", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_40_6/topology_40_6_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_50_4", "modeling": "Binary Quadratic Program", "numeric_objective": 5.0, "objective": "5.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 1, "reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "runtime": "7200.07", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/topology_50_4_summary.csv" }, { "algorithm": "Deterministic", "date": "06. Dec. 2024", "date_key": "2024-12-06T00:00:00", "direction": "minimize", "instance": "topology_50_4", "modeling": "Flow MIP", "numeric_objective": 6.0, "objective": "6.0", "problem_dir": "10-topology", "problem_title": "Topology Design", "rank": 2, "reference": "See Models Directory (Flow) using Gurobi 11.0.0", "runtime": "7200.39", "submission_set": "20241206_Gurobi-Flow_Schicker", "submitter": "Maximilian Schicker", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_50_4/topology_50_4_summary.csv" } ], "problems": [ { "counts": { "instances": 156, "model_files": 481, "results": 121, "solution_files": 116, "submission_sets": 5 }, "description": "Multi-dimensional Subset Sum", "formulation": "MIP / QUBO", "instance_interest": "A compact feasibility benchmark for partitioning integer data across many simultaneous subset-sum constraints.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions" }, "minimize": true, "name": "01-marketsplit", "number": "01", "page": "problems/01-marketsplit/", "path": "01-marketsplit", "short": "Market Split", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit", "tags": [ "feasibility", "partitioning", "integer data" ], "title": "Market Split", "type": "Subset sum", "why_care": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes." }, { "counts": { "instances": 103, "model_files": 309, "results": 207, "solution_files": 100, "submission_sets": 5 }, "description": "Low Autocorrelation Binary Sequences", "formulation": "QUBO / Ising", "instance_interest": "A sequence-design benchmark where small objective changes can separate strong search methods from weak ones.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions" }, "minimize": true, "name": "02-labs", "number": "02", "page": "problems/02-labs/", "path": "02-labs", "short": "LABS", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs", "tags": [ "autocorrelation", "spin variables", "signal design" ], "title": "LABS", "type": "Binary sequences", "why_care": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows." }, { "counts": { "instances": 108, "model_files": 86, "results": 80, "solution_files": 9, "submission_sets": 3 }, "description": "Doubly Stochastic Matrix Decomposition", "formulation": "MIP", "instance_interest": "A decomposition benchmark that tests whether a method can find sparse convex combinations of permutation matrices.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions" }, "minimize": true, "name": "03-birkhoff", "number": "03", "page": "problems/03-birkhoff/", "path": "03-birkhoff", "short": "Birkhoff", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff", "tags": [ "assignment", "decomposition", "sparsity" ], "title": "Minimum Birkhoff Decomposition", "type": "Matrix decomposition", "why_care": "Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective." }, { "counts": { "instances": 190, "model_files": 78, "results": 0, "solution_files": 44, "submission_sets": 0 }, "description": "VLSI Design / Wire Routing", "formulation": "MIP", "instance_interest": "A routing benchmark for packing disjoint connection structures through constrained grid geometry.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner/solutions" }, "minimize": true, "name": "04-steiner", "number": "04", "page": "problems/04-steiner/", "path": "04-steiner", "short": "Steiner Packing", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/04-steiner", "tags": [ "VLSI", "routing", "packing" ], "title": "Steiner Tree Packing", "type": "Network design", "why_care": "Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts." }, { "counts": { "instances": 249, "model_files": 254, "results": 0, "solution_files": 401, "submission_sets": 1 }, "description": "Constraint Satisfaction Problem", "formulation": "CSP / MIP", "instance_interest": "A real-world-like scheduling benchmark where feasibility under many interacting constraints is the central challenge.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/README.md", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/submissions" }, "minimize": true, "name": "05-sports", "number": "05", "page": "problems/05-sports/", "path": "05-sports", "short": "Sports Scheduling", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports", "tags": [ "timetabling", "feasibility", "RobinX" ], "title": "Sports Tournament Scheduling", "type": "Scheduling", "why_care": "Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty." }, { "counts": { "instances": 32, "model_files": 267, "results": 2, "solution_files": 35, "submission_sets": 3 }, "description": "Multi-period with Transaction Costs & Short Selling", "formulation": "QUBO / BQP", "instance_interest": "A finance benchmark for balancing risk, returns, transaction costs, and time-linked binary decisions.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/README.md", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions" }, "minimize": true, "name": "06-portfolio", "number": "06", "page": "problems/06-portfolio/", "path": "06-portfolio", "short": "Portfolio", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio", "tags": [ "risk", "transaction costs", "time series" ], "title": "Portfolio Optimization", "type": "Finance", "why_care": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model." }, { "counts": { "instances": 50, "model_files": 162, "results": 111, "solution_files": 51, "submission_sets": 5 }, "description": "Unweighted MIS", "formulation": "QUBO / MIP", "instance_interest": "A graph benchmark that tests maximum-cardinality search on sparse and dense structures with known comparison points.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions" }, "minimize": false, "name": "07-independentset", "number": "07", "page": "problems/07-independentset/", "path": "07-independentset", "short": "MIS", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset", "tags": [ "graphs", "stable set", "maximum cardinality" ], "title": "Maximum Independent Set", "type": "Graph optimization", "why_care": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs." }, { "counts": { "instances": 20, "model_files": 26, "results": 20, "solution_files": 22, "submission_sets": 1 }, "description": "Telecommunications Network Planning", "formulation": "MIP", "instance_interest": "A flow-routing benchmark for constructing sparse directed networks under traffic and degree constraints.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions" }, "minimize": true, "name": "08-network", "number": "08", "page": "problems/08-network/", "path": "08-network", "short": "Network Design", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network", "tags": [ "flows", "degree constraints", "routing" ], "title": "Network Design", "type": "Telecommunications", "why_care": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion." }, { "counts": { "instances": 55, "model_files": 61, "results": 0, "solution_files": 56, "submission_sets": 0 }, "description": "VRP: TSP + Time Window + Knapsack", "formulation": "MIP", "instance_interest": "A logistics benchmark for route construction with tight capacity and service-window constraints.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing/solutions" }, "minimize": true, "name": "09-routing", "number": "09", "page": "problems/09-routing/", "path": "09-routing", "short": "Vehicle Routing", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/09-routing", "tags": [ "VRP", "time windows", "capacity" ], "title": "Vehicle Routing", "type": "Logistics", "why_care": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications." }, { "counts": { "instances": 26, "model_files": 66, "results": 48, "solution_files": 27, "submission_sets": 3 }, "description": "Graph Golf / Node-Degree-Diameter Problem", "formulation": "Graph search / MIP", "instance_interest": "A graph-design benchmark where a small diameter improvement can be meaningful and hard to prove.", "links": { "README.md": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/README.md", "check": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/check", "instances": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/instances", "models": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/models", "solutions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/solutions", "submissions": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions" }, "minimize": true, "name": "10-topology", "number": "10", "page": "problems/10-topology/", "path": "10-topology", "short": "Topology", "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology", "tags": [ "diameter", "degree bound", "graph golf" ], "title": "Topology Design", "type": "Graph design", "why_care": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture." } ], "ref": "aef5d804c0b60d38f3d197278abbf909b88ac6aa", "repo_url": "https://github.com/bernalde/QOBLIB", "results": [ { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "34", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "191", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Stochastic", "Best Objective Value": "-16", "CPU Runtime": "0.6", "Coefficients Range": "{-1; 2}", "Coefficients Type": "Integer", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro (statevector simulation)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "karate", "QPU Runtime": "N/A", "Reference": "https://arvak.io", "Remarks": "5.7x qubit compression. Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "0.6", "Workflow": "PCE dense: 34 vars -> 6 qubits. COBYLA + statevector sim (2048 shots/eval)." }, "id": "07-independentset/submissions/20260308_Arvak_Hinderink/karate/karate_summary.csv:1", "instance": "karate", "instance_dir": "karate", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20260308_Arvak_Hinderink/karate/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/karate/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "07-independentset/submissions/20260308_Arvak_Hinderink/karate/karate_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/karate/karate_summary.csv" }, { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "17", "# Continuous Variables": "0", "# Decision Variables": "17", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "95", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Stochastic", "Best Objective Value": "-10", "CPU Runtime": "0.4", "Coefficients Range": "{-1; 2}", "Coefficients Type": "Integer", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro (statevector simulation)", "Modeling Approach": "QUBO", "Optimality Bound": "-10", "Other HW Runtime": "N/A", "Problem": "farm", "QPU Runtime": "N/A", "Reference": "https://arvak.io", "Remarks": "Optimal solution verified by brute-force. 3.4x qubit compression. Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "0.4", "Workflow": "PCE dense: 17 vars -> 5 qubits. COBYLA + statevector sim (2048 shots/eval)." }, "id": "07-independentset/submissions/20260308_Arvak_Hinderink/farm/farm_summary.csv:1", "instance": "farm", "instance_dir": "farm", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20260308_Arvak_Hinderink/farm/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/farm/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "07-independentset/submissions/20260308_Arvak_Hinderink/farm/farm_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/farm/farm_summary.csv" }, { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "123", "# Continuous Variables": "0", "# Decision Variables": "123", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "441", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Stochastic", "Best Objective Value": "-27", "CPU Runtime": "10", "Coefficients Range": "{-1; 2}", "Coefficients Type": "Integer", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro and IBM Quantum ibm_torino (Heron r2 156q)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "es60fst01", "QPU Runtime": "669", "Reference": "https://arvak.io", "Remarks": "Runtime in seconds. 123 of 156 qubits used. Compiled with Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "779", "Workflow": "1) QUBO loaded from .qs file. 2) QAOA p=1 circuit built from QUBO terms. 3) COBYLA optimizer (23 iterations) on IBM QPU. 4) Final 4096-shot sampling." }, "id": "07-independentset/submissions/20260308_Arvak_Hinderink/es60fst01/es60fst01_summary.csv:1", "instance": "es60fst01", "instance_dir": "es60fst01", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20260308_Arvak_Hinderink/es60fst01/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/es60fst01/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "07-independentset/submissions/20260308_Arvak_Hinderink/es60fst01/es60fst01_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink/es60fst01/es60fst01_summary.csv" }, { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "10", "# Continuous Variables": "0", "# Decision Variables": "10", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "100", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Stochastic", "Best Objective Value": "-0.007064", "CPU Runtime": "0.17", "Coefficients Range": "{-0.005; 0.001}", "Coefficients Type": "Continuous", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro (statevector simulation)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "po_a010_t15_orig", "QPU Runtime": "N/A", "Reference": "https://arvak.io", "Remarks": "2.5x qubit compression. Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "0.17", "Workflow": "PCE dense: 10 vars -> 4 qubits. COBYLA + statevector sim (2048 shots/eval)." }, "id": "06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/po_a010_t15_orig_summary.csv:1", "instance": "po_a010_t15_orig", "instance_dir": "po_a010_t15_orig", "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "readme_path": "06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/po_a010_t15_orig_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t15_orig/po_a010_t15_orig_summary.csv" }, { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "10", "# Continuous Variables": "0", "# Decision Variables": "10", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "100", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Stochastic", "Best Objective Value": "-0.030604", "CPU Runtime": "0.24", "Coefficients Range": "{-0.01; 0.001}", "Coefficients Type": "Continuous", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro (statevector simulation)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "po_a010_t10_orig", "QPU Runtime": "N/A", "Reference": "https://arvak.io", "Remarks": "2.5x qubit compression. Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "0.24", "Workflow": "PCE dense: 10 vars -> 4 qubits. COBYLA + statevector sim (2048 shots/eval)." }, "id": "06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/po_a010_t10_orig_summary.csv:1", "instance": "po_a010_t10_orig", "instance_dir": "po_a010_t10_orig", "problem_dir": "06-portfolio", "problem_number": "06", "problem_title": "Portfolio Optimization", "readme_path": "06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/po_a010_t10_orig_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink/po_a010_t10_orig/po_a010_t10_orig_summary.csv" }, { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "6", "# Continuous Variables": "0", "# Decision Variables": "6", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "21", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Stochastic", "Best Objective Value": "1", "CPU Runtime": "0.11", "Coefficients Range": "{-8; 12}", "Coefficients Type": "Integer", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro (statevector simulation)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs003", "QPU Runtime": "N/A", "Reference": "https://arvak.io", "Remarks": "QUBO objective: -4 + offset 5 = LABS energy 1. 2.0x qubit compression via PCE. Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "0.11", "Workflow": "PCE dense: 6 QUBO vars -> 3 qubits via parity masks. COBYLA + statevector sim (2048 shots/eval). Solution converted back to 3 original LABS variables." }, "id": "02-labs/submissions/20260308_Arvak_Hinderink/labs003/labs003_summary.csv:1", "instance": "labs003", "instance_dir": "labs003", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260308_Arvak_Hinderink/labs003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260308_Arvak_Hinderink/labs003/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "02-labs/submissions/20260308_Arvak_Hinderink/labs003/labs003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260308_Arvak_Hinderink/labs003/labs003_summary.csv" }, { "date_key": "2026-03-08T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "20", "# Feasible Runs": "0", "# Integer Variables": "0", "# Non-Zero Coefficients": "211", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Stochastic", "Best Objective Value": "-201117", "CPU Runtime": "0.38", "Coefficients Range": "{-202539; 50000}", "Coefficients Type": "Integer", "Date": "8. Mar. 2026", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M3 Pro (statevector simulation)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_050_002", "QPU Runtime": "N/A", "Reference": "https://arvak.io", "Remarks": "INFEASIBLE \u2014 all 3 rows violated. PCE compression (20->5 qubits) cannot reach any feasible solution; the encoding image contains 0 feasible points out of 32. Withdrawn. Arvak v1.9.3.", "Submitter": "Daniel Hinderink (hiq-lab)", "Success Threshold": "0", "Total Runtime": "0.38", "Workflow": "PCE dense: 20 vars -> 5 qubits. COBYLA + statevector sim (2048 shots/eval)." }, "id": "01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/ms_03_050_002_summary.csv:1", "instance": "ms_03_050_002", "instance_dir": "ms_03_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/README.md", "submission_set": "20260308_Arvak_Hinderink", "summary_csv": "01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/ms_03_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20260308_Arvak_Hinderink/ms_03_050_002/ms_03_050_002_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "8", "# Continuous Variables": "0", "# Decision Variables": "8", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "34", "# Runs": "25", "# Successful Runs": "25", "Algorithm Type": "stochastic", "Best Objective Value": "8", "CPU Runtime": "0.03295", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 8)", "QPU Runtime": "906.245", "Reference": "N/A", "Remarks": "with calibration; ground state probability: 5.18%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "913.034", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs008/labs008_summary.csv:1", "instance": "LABS (N = 8)", "instance_dir": "labs008", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs008/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs008/labs008_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008/labs008_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "8", "# Continuous Variables": "0", "# Decision Variables": "8", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "34", "# Runs": "25", "# Successful Runs": "25", "Algorithm Type": "stochastic", "Best Objective Value": "8", "CPU Runtime": "0.03295", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 8)", "QPU Runtime": "641.974", "Reference": "N/A", "Remarks": "without calibration; ground state probability: 6.72%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "648.782", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs008-without_calibration/labs008-without_calibration_summary.csv:1", "instance": "LABS (N = 8)", "instance_dir": "labs008-without_calibration", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs008-without_calibration/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008-without_calibration/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs008-without_calibration/labs008-without_calibration_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs008-without_calibration/labs008-without_calibration_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "6", "# Continuous Variables": "0", "# Decision Variables": "6", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "13", "# Runs": "25", "# Successful Runs": "25", "Algorithm Type": "stochastic", "Best Objective Value": "7", "CPU Runtime": "0.13686", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 6)", "QPU Runtime": "334.491", "Reference": "N/A", "Remarks": "with calibration; ground state probability: 79.98%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "341.376", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs006/labs006_summary.csv:1", "instance": "LABS (N = 6)", "instance_dir": "labs006", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs006/labs006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006/labs006_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "6", "# Continuous Variables": "0", "# Decision Variables": "6", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "13", "# Runs": "25", "# Successful Runs": "25", "Algorithm Type": "stochastic", "Best Objective Value": "7", "CPU Runtime": "0.13686", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 6)", "QPU Runtime": "273.605", "Reference": "N/A", "Remarks": "without calibration; ground state probability: 25.22%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "280.306", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs006-without_calibration/labs006-without_calibration_summary.csv:1", "instance": "LABS (N = 6)", "instance_dir": "labs006-without_calibration", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs006-without_calibration/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006-without_calibration/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs006-without_calibration/labs006-without_calibration_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs006-without_calibration/labs006-without_calibration_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "12", "# Continuous Variables": "0", "# Decision Variables": "12", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "125", "# Runs": "25", "# Successful Runs": "16", "Algorithm Type": "stochastic", "Best Objective Value": "10", "CPU Runtime": "0.06368", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 12)", "QPU Runtime": "5090.35", "Reference": "N/A", "Remarks": "with calibration; ground state probability: 0.58%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "5097.17", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs012/labs012_summary.csv:1", "instance": "LABS (N = 12)", "instance_dir": "labs012", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs012/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs012/labs012_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012/labs012_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "12", "# Continuous Variables": "0", "# Decision Variables": "12", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "125", "# Runs": "25", "# Successful Runs": "13", "Algorithm Type": "stochastic", "Best Objective Value": "10", "CPU Runtime": "0.06368", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 12)", "QPU Runtime": "2515.93", "Reference": "N/A", "Remarks": "without calibration; ground state probability: 0.34%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "2522.60", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs012-without_calibration/labs012-without_calibration_summary.csv:1", "instance": "LABS (N = 12)", "instance_dir": "labs012-without_calibration", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs012-without_calibration/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012-without_calibration/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs012-without_calibration/labs012-without_calibration_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs012-without_calibration/labs012-without_calibration_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "10", "# Continuous Variables": "0", "# Decision Variables": "10", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "70", "# Runs": "25", "# Successful Runs": "25", "Algorithm Type": "stochastic", "Best Objective Value": "13", "CPU Runtime": "0.05946", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 10)", "QPU Runtime": "4812.99", "Reference": "N/A", "Remarks": "with calibration; ground state probability: 3.5%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "4820.06", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs010/labs010_summary.csv:1", "instance": "LABS (N = 10)", "instance_dir": "labs010", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs010/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs010/labs010_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010/labs010_summary.csv" }, { "date_key": "2026-02-09T00:00:00", "fields": { "# Binary Variables": "10", "# Continuous Variables": "0", "# Decision Variables": "10", "# Feasible Runs": "25", "# Integer Variables": "0", "# Non-Zero Coefficients": "70", "# Runs": "25", "# Successful Runs": "25", "Algorithm Type": "stochastic", "Best Objective Value": "13", "CPU Runtime": "0.05946", "Coefficients Range": "{1,2}", "Coefficients Type": "integer", "Date": "Nov. 17, 2025", "GPU Runtime": "N/A", "Hardware Specifications": "CPU: HPC University of Innsbruck (Leo 5), QPU: AQT IBEX", "Modeling Approach": "PUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "LABS (N = 10)", "QPU Runtime": "1179.95", "Reference": "N/A", "Remarks": "without calibration; ground state probability: 3.82%", "Submitter": "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)", "Success Threshold": "0", "Total Runtime": "1186.68", "Workflow": "QAOA with p = 1 (200 shots per run)" }, "id": "02-labs/submissions/20260209_QAOA_AQT/labs010-without_calibration/labs010-without_calibration_summary.csv:1", "instance": "LABS (N = 10)", "instance_dir": "labs010-without_calibration", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/labs010-without_calibration/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010-without_calibration/README.md", "submission_set": "20260209_QAOA_AQT", "summary_csv": "02-labs/submissions/20260209_QAOA_AQT/labs010-without_calibration/labs010-without_calibration_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/labs010-without_calibration/labs010-without_calibration_summary.csv" }, { "date_key": "2026-01-10T20:53:28", "fields": { "# Binary Variables": "90", "# Continuous Variables": "0", "# Decision Variables": "180", "# Feasible Runs": "1", "# Integer Variables": "90", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:28", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/B6_6_9_summary.csv:1", "instance": "B6_6_9", "instance_dir": "B6_6_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/B6_6_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_9/B6_6_9_summary.csv" }, { "date_key": "2026-01-10T20:53:28", "fields": { "# Binary Variables": "84", "# Continuous Variables": "0", "# Decision Variables": "168", "# Feasible Runs": "1", "# Integer Variables": "84", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:28", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/B6_6_10_summary.csv:1", "instance": "B6_6_10", "instance_dir": "B6_6_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/B6_6_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_10/B6_6_10_summary.csv" }, { "date_key": "2026-01-10T20:53:25", "fields": { "# Binary Variables": "25", "# Continuous Variables": "0", "# Decision Variables": "51", "# Feasible Runs": "1", "# Integer Variables": "26", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:25", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/B6_6_8_summary.csv:1", "instance": "B6_6_8", "instance_dir": "B6_6_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/B6_6_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_8/B6_6_8_summary.csv" }, { "date_key": "2026-01-10T20:53:22", "fields": { "# Binary Variables": "126", "# Continuous Variables": "0", "# Decision Variables": "252", "# Feasible Runs": "1", "# Integer Variables": "126", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:22", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/B6_6_7_summary.csv:1", "instance": "B6_6_7", "instance_dir": "B6_6_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/B6_6_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_7/B6_6_7_summary.csv" }, { "date_key": "2026-01-10T20:53:19", "fields": { "# Binary Variables": "39", "# Continuous Variables": "0", "# Decision Variables": "78", "# Feasible Runs": "1", "# Integer Variables": "39", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:19", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/B6_6_6_summary.csv:1", "instance": "B6_6_6", "instance_dir": "B6_6_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/B6_6_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_6/B6_6_6_summary.csv" }, { "date_key": "2026-01-10T20:53:16", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "80", "# Feasible Runs": "1", "# Integer Variables": "40", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:16", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/B6_6_5_summary.csv:1", "instance": "B6_6_5", "instance_dir": "B6_6_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/B6_6_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_5/B6_6_5_summary.csv" }, { "date_key": "2026-01-10T20:53:13", "fields": { "# Binary Variables": "57", "# Continuous Variables": "0", "# Decision Variables": "114", "# Feasible Runs": "1", "# Integer Variables": "57", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:13", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/B6_6_4_summary.csv:1", "instance": "B6_6_4", "instance_dir": "B6_6_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/B6_6_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_4/B6_6_4_summary.csv" }, { "date_key": "2026-01-10T20:53:10", "fields": { "# Binary Variables": "56", "# Continuous Variables": "0", "# Decision Variables": "112", "# Feasible Runs": "1", "# Integer Variables": "56", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:10", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/B6_6_3_summary.csv:1", "instance": "B6_6_3", "instance_dir": "B6_6_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/B6_6_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_3/B6_6_3_summary.csv" }, { "date_key": "2026-01-10T20:53:07", "fields": { "# Binary Variables": "102", "# Continuous Variables": "0", "# Decision Variables": "205", "# Feasible Runs": "1", "# Integer Variables": "103", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:07", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/B6_6_2_summary.csv:1", "instance": "B6_6_2", "instance_dir": "B6_6_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/B6_6_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_2/B6_6_2_summary.csv" }, { "date_key": "2026-01-10T20:53:04", "fields": { "# Binary Variables": "116", "# Continuous Variables": "0", "# Decision Variables": "232", "# Feasible Runs": "1", "# Integer Variables": "116", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:04", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "B6_6_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/B6_6_1_summary.csv:1", "instance": "B6_6_1", "instance_dir": "B6_6_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/B6_6_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_6_1/B6_6_1_summary.csv" }, { "date_key": "2026-01-10T20:53:01", "fields": { "# Binary Variables": "19", "# Continuous Variables": "0", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "21", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:53:01", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/B5_5_10_summary.csv:1", "instance": "B5_5_10", "instance_dir": "B5_5_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/B5_5_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_10/B5_5_10_summary.csv" }, { "date_key": "2026-01-10T20:52:58", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "240", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:58", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B5_5_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/B5_5_9_summary.csv:1", "instance": "B5_5_9", "instance_dir": "B5_5_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/B5_5_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_9/B5_5_9_summary.csv" }, { "date_key": "2026-01-10T20:52:58", "fields": { "# Binary Variables": "37", "# Continuous Variables": "0", "# Decision Variables": "75", "# Feasible Runs": "1", "# Integer Variables": "38", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:58", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/B5_5_8_summary.csv:1", "instance": "B5_5_8", "instance_dir": "B5_5_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/B5_5_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_8/B5_5_8_summary.csv" }, { "date_key": "2026-01-10T20:52:55", "fields": { "# Binary Variables": "13", "# Continuous Variables": "0", "# Decision Variables": "27", "# Feasible Runs": "1", "# Integer Variables": "14", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:55", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/B5_5_7_summary.csv:1", "instance": "B5_5_7", "instance_dir": "B5_5_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/B5_5_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_7/B5_5_7_summary.csv" }, { "date_key": "2026-01-10T20:52:52", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "20", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:52", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/B5_5_6_summary.csv:1", "instance": "B5_5_6", "instance_dir": "B5_5_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/B5_5_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_6/B5_5_6_summary.csv" }, { "date_key": "2026-01-10T20:52:49", "fields": { "# Binary Variables": "15", "# Continuous Variables": "0", "# Decision Variables": "31", "# Feasible Runs": "1", "# Integer Variables": "16", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:49", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/B5_5_5_summary.csv:1", "instance": "B5_5_5", "instance_dir": "B5_5_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/B5_5_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_5/B5_5_5_summary.csv" }, { "date_key": "2026-01-10T20:52:46", "fields": { "# Binary Variables": "4", "# Continuous Variables": "0", "# Decision Variables": "6", "# Feasible Runs": "1", "# Integer Variables": "2", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:46", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/B5_5_4_summary.csv:1", "instance": "B5_5_4", "instance_dir": "B5_5_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/B5_5_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_4/B5_5_4_summary.csv" }, { "date_key": "2026-01-10T20:52:43", "fields": { "# Binary Variables": "13", "# Continuous Variables": "0", "# Decision Variables": "24", "# Feasible Runs": "1", "# Integer Variables": "11", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:43", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/B5_5_3_summary.csv:1", "instance": "B5_5_3", "instance_dir": "B5_5_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/B5_5_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_3/B5_5_3_summary.csv" }, { "date_key": "2026-01-10T20:52:40", "fields": { "# Binary Variables": "19", "# Continuous Variables": "0", "# Decision Variables": "39", "# Feasible Runs": "1", "# Integer Variables": "20", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:40", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/B5_5_2_summary.csv:1", "instance": "B5_5_2", "instance_dir": "B5_5_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/B5_5_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_2/B5_5_2_summary.csv" }, { "date_key": "2026-01-10T20:52:37", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "20", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:37", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B5_5_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/B5_5_1_summary.csv:1", "instance": "B5_5_1", "instance_dir": "B5_5_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/B5_5_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_5_1/B5_5_1_summary.csv" }, { "date_key": "2026-01-10T20:52:34", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:34", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/B4_4_10_summary.csv:1", "instance": "B4_4_10", "instance_dir": "B4_4_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/B4_4_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_10/B4_4_10_summary.csv" }, { "date_key": "2026-01-10T20:52:31", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:31", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/B4_4_9_summary.csv:1", "instance": "B4_4_9", "instance_dir": "B4_4_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/B4_4_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_9/B4_4_9_summary.csv" }, { "date_key": "2026-01-10T20:52:28", "fields": { "# Binary Variables": "4", "# Continuous Variables": "0", "# Decision Variables": "6", "# Feasible Runs": "1", "# Integer Variables": "2", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:28", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/B4_4_8_summary.csv:1", "instance": "B4_4_8", "instance_dir": "B4_4_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/B4_4_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_8/B4_4_8_summary.csv" }, { "date_key": "2026-01-10T20:52:25", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:25", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/B4_4_7_summary.csv:1", "instance": "B4_4_7", "instance_dir": "B4_4_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/B4_4_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_7/B4_4_7_summary.csv" }, { "date_key": "2026-01-10T20:52:22", "fields": { "# Binary Variables": "12", "# Continuous Variables": "0", "# Decision Variables": "25", "# Feasible Runs": "1", "# Integer Variables": "13", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:22", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/B4_4_6_summary.csv:1", "instance": "B4_4_6", "instance_dir": "B4_4_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/B4_4_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_6/B4_4_6_summary.csv" }, { "date_key": "2026-01-10T20:52:19", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:19", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/B4_4_5_summary.csv:1", "instance": "B4_4_5", "instance_dir": "B4_4_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/B4_4_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_5/B4_4_5_summary.csv" }, { "date_key": "2026-01-10T20:52:16", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:16", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B4_4_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/B4_4_4_summary.csv:1", "instance": "B4_4_4", "instance_dir": "B4_4_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/B4_4_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_4/B4_4_4_summary.csv" }, { "date_key": "2026-01-10T20:52:13", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:13", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B4_4_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/B4_4_3_summary.csv:1", "instance": "B4_4_3", "instance_dir": "B4_4_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/B4_4_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_3/B4_4_3_summary.csv" }, { "date_key": "2026-01-10T20:52:10", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:10", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/B4_4_2_summary.csv:1", "instance": "B4_4_2", "instance_dir": "B4_4_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/B4_4_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_2/B4_4_2_summary.csv" }, { "date_key": "2026-01-10T20:52:07", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:07", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B4_4_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/B4_4_1_summary.csv:1", "instance": "B4_4_1", "instance_dir": "B4_4_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/B4_4_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_4_1/B4_4_1_summary.csv" }, { "date_key": "2026-01-10T20:52:04", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:04", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/B3_3_10_summary.csv:1", "instance": "B3_3_10", "instance_dir": "B3_3_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/B3_3_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_10/B3_3_10_summary.csv" }, { "date_key": "2026-01-10T20:52:01", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:52:01", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "B3_3_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/B3_3_9_summary.csv:1", "instance": "B3_3_9", "instance_dir": "B3_3_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/B3_3_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_9/B3_3_9_summary.csv" }, { "date_key": "2026-01-10T20:51:58", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:58", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/B3_3_8_summary.csv:1", "instance": "B3_3_8", "instance_dir": "B3_3_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/B3_3_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_8/B3_3_8_summary.csv" }, { "date_key": "2026-01-10T20:51:56", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:56", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "B3_3_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/B3_3_7_summary.csv:1", "instance": "B3_3_7", "instance_dir": "B3_3_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/B3_3_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_7/B3_3_7_summary.csv" }, { "date_key": "2026-01-10T20:51:53", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:53", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/B3_3_6_summary.csv:1", "instance": "B3_3_6", "instance_dir": "B3_3_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/B3_3_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_6/B3_3_6_summary.csv" }, { "date_key": "2026-01-10T20:51:50", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:50", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/B3_3_5_summary.csv:1", "instance": "B3_3_5", "instance_dir": "B3_3_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/B3_3_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_5/B3_3_5_summary.csv" }, { "date_key": "2026-01-10T20:51:47", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:47", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/B3_3_4_summary.csv:1", "instance": "B3_3_4", "instance_dir": "B3_3_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/B3_3_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_4/B3_3_4_summary.csv" }, { "date_key": "2026-01-10T20:51:44", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:44", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/B3_3_3_summary.csv:1", "instance": "B3_3_3", "instance_dir": "B3_3_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/B3_3_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_3/B3_3_3_summary.csv" }, { "date_key": "2026-01-10T20:51:41", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:41", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "B3_3_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/B3_3_2_summary.csv:1", "instance": "B3_3_2", "instance_dir": "B3_3_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/B3_3_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_2/B3_3_2_summary.csv" }, { "date_key": "2026-01-10T20:51:38", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:51:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "B3_3_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/B3_3_1_summary.csv:1", "instance": "B3_3_1", "instance_dir": "B3_3_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/B3_3_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_3_1/B3_3_1_summary.csv" }, { "date_key": "2026-01-10T20:39:55", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "20.0", "CPU Runtime": "10732.33", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 20:39:55", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "11.0", "Other HW Runtime": "N/A", "Problem": "B6_36_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/B6_36_10_summary.csv:1", "instance": "B6_36_10", "instance_dir": "B6_36_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/B6_36_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_10/B6_36_10_summary.csv" }, { "date_key": "2026-01-10T18:48:52", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10734.81", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 18:48:52", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "13.0", "Other HW Runtime": "N/A", "Problem": "B6_36_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/B6_36_9_summary.csv:1", "instance": "B6_36_9", "instance_dir": "B6_36_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/B6_36_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_9/B6_36_9_summary.csv" }, { "date_key": "2026-01-10T18:38:04", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10838.2", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 18:38:04", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B6_36_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/B6_36_8_summary.csv:1", "instance": "B6_36_8", "instance_dir": "B6_36_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/B6_36_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_8/B6_36_8_summary.csv" }, { "date_key": "2026-01-10T16:46:23", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10924.77", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 16:46:23", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "11.0", "Other HW Runtime": "N/A", "Problem": "B6_36_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/B6_36_7_summary.csv:1", "instance": "B6_36_7", "instance_dir": "B6_36_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/B6_36_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_7/B6_36_7_summary.csv" }, { "date_key": "2026-01-10T16:36:20", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10824.7", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 16:36:20", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B6_36_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/B6_36_6_summary.csv:1", "instance": "B6_36_6", "instance_dir": "B6_36_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/B6_36_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_6/B6_36_6_summary.csv" }, { "date_key": "2026-01-10T14:43:56", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10596.29", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 14:43:56", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B6_36_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/B6_36_5_summary.csv:1", "instance": "B6_36_5", "instance_dir": "B6_36_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/B6_36_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_5/B6_36_5_summary.csv" }, { "date_key": "2026-01-10T14:34:41", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10838.79", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 14:34:41", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B6_36_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/B6_36_4_summary.csv:1", "instance": "B6_36_4", "instance_dir": "B6_36_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/B6_36_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_4/B6_36_4_summary.csv" }, { "date_key": "2026-01-10T12:42:07", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "21.0", "CPU Runtime": "10333.97", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 12:42:07", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "11.0", "Other HW Runtime": "N/A", "Problem": "B6_36_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/B6_36_3_summary.csv:1", "instance": "B6_36_3", "instance_dir": "B6_36_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/B6_36_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_3/B6_36_3_summary.csv" }, { "date_key": "2026-01-10T12:32:16", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "11076.51", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 12:32:16", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B6_36_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/B6_36_2_summary.csv:1", "instance": "B6_36_2", "instance_dir": "B6_36_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/B6_36_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_2/B6_36_2_summary.csv" }, { "date_key": "2026-01-10T10:38:31", "fields": { "# Binary Variables": "720", "# Continuous Variables": "0", "# Decision Variables": "1440", "# Feasible Runs": "1", "# Integer Variables": "720", "# Non-Zero Coefficients": "6480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22.0", "CPU Runtime": "10691.92", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 10:38:31", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B6_36_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/B6_36_1_summary.csv:1", "instance": "B6_36_1", "instance_dir": "B6_36_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/B6_36_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B6_36_1/B6_36_1_summary.csv" }, { "date_key": "2026-01-10T10:27:24", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "6900.54", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 10:27:24", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B5_25_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/B5_25_10_summary.csv:1", "instance": "B5_25_10", "instance_dir": "B5_25_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/B5_25_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_10/B5_25_10_summary.csv" }, { "date_key": "2026-01-10T10:24:33", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "185.61", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 10:24:33", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "14.0", "Other HW Runtime": "N/A", "Problem": "B5_25_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "168.78", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/B5_25_9_summary.csv:1", "instance": "B5_25_9", "instance_dir": "B5_25_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/B5_25_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_9/B5_25_9_summary.csv" }, { "date_key": "2026-01-10T10:01:09", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "1972.76", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 10:01:09", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "14.0", "Other HW Runtime": "N/A", "Problem": "B5_25_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2237.82", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/B5_25_8_summary.csv:1", "instance": "B5_25_8", "instance_dir": "B5_25_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/B5_25_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_8/B5_25_8_summary.csv" }, { "date_key": "2026-01-10T09:55:08", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "1929.21", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 09:55:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "14.0", "Other HW Runtime": "N/A", "Problem": "B5_25_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1761.27", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/B5_25_7_summary.csv:1", "instance": "B5_25_7", "instance_dir": "B5_25_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/B5_25_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_7/B5_25_7_summary.csv" }, { "date_key": "2026-01-10T07:54:10", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "6932.67", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 07:54:10", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B5_25_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/B5_25_6_summary.csv:1", "instance": "B5_25_6", "instance_dir": "B5_25_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/B5_25_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_6/B5_25_6_summary.csv" }, { "date_key": "2026-01-10T07:49:45", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "7149.08", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 07:49:45", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "B5_25_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/B5_25_5_summary.csv:1", "instance": "B5_25_5", "instance_dir": "B5_25_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/B5_25_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_5/B5_25_5_summary.csv" }, { "date_key": "2026-01-10T07:10:17", "fields": { "# Binary Variables": "96", "# Continuous Variables": "0", "# Decision Variables": "192", "# Feasible Runs": "1", "# Integer Variables": "96", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13.0", "CPU Runtime": "2521.75", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 07:10:17", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "13.0", "Other HW Runtime": "N/A", "Problem": "B5_25_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2626.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/B5_25_4_summary.csv:1", "instance": "B5_25_4", "instance_dir": "B5_25_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/B5_25_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_4/B5_25_4_summary.csv" }, { "date_key": "2026-01-10T07:08:58", "fields": { "# Binary Variables": "96", "# Continuous Variables": "0", "# Decision Variables": "192", "# Feasible Runs": "1", "# Integer Variables": "96", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "82.07", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 07:08:58", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "14.0", "Other HW Runtime": "N/A", "Problem": "B5_25_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "77.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/B5_25_3_summary.csv:1", "instance": "B5_25_3", "instance_dir": "B5_25_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/B5_25_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_3/B5_25_3_summary.csv" }, { "date_key": "2026-01-10T05:46:14", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "7361.94", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:46:14", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "13.0", "Other HW Runtime": "N/A", "Problem": "B5_25_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/B5_25_2_summary.csv:1", "instance": "B5_25_2", "instance_dir": "B5_25_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/B5_25_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_2/B5_25_2_summary.csv" }, { "date_key": "2026-01-10T05:45:22", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "240", "# Feasible Runs": "1", "# Integer Variables": "120", "# Non-Zero Coefficients": "960", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "14.0", "CPU Runtime": "52.98", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:22", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "14.0", "Other HW Runtime": "N/A", "Problem": "B5_25_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "51.3", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/B5_25_1_summary.csv:1", "instance": "B5_25_1", "instance_dir": "B5_25_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/B5_25_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B5_25_1/B5_25_1_summary.csv" }, { "date_key": "2026-01-10T05:45:20", "fields": { "# Binary Variables": "18", "# Continuous Variables": "0", "# Decision Variables": "36", "# Feasible Runs": "1", "# Integer Variables": "18", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "9.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:20", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "9.0", "Other HW Runtime": "N/A", "Problem": "B4_16_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/B4_16_10_summary.csv:1", "instance": "B4_16_10", "instance_dir": "B4_16_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/B4_16_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_10/B4_16_10_summary.csv" }, { "date_key": "2026-01-10T05:45:17", "fields": { "# Binary Variables": "23", "# Continuous Variables": "0", "# Decision Variables": "47", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:17", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/B4_16_9_summary.csv:1", "instance": "B4_16_9", "instance_dir": "B4_16_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/B4_16_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_9/B4_16_9_summary.csv" }, { "date_key": "2026-01-10T05:45:14", "fields": { "# Binary Variables": "24", "# Continuous Variables": "0", "# Decision Variables": "48", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.03", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:14", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.15", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/B4_16_8_summary.csv:1", "instance": "B4_16_8", "instance_dir": "B4_16_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/B4_16_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_8/B4_16_8_summary.csv" }, { "date_key": "2026-01-10T05:45:11", "fields": { "# Binary Variables": "24", "# Continuous Variables": "0", "# Decision Variables": "48", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.03", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:11", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.15", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/B4_16_7_summary.csv:1", "instance": "B4_16_7", "instance_dir": "B4_16_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/B4_16_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_7/B4_16_7_summary.csv" }, { "date_key": "2026-01-10T05:45:08", "fields": { "# Binary Variables": "23", "# Continuous Variables": "0", "# Decision Variables": "47", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.12", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/B4_16_6_summary.csv:1", "instance": "B4_16_6", "instance_dir": "B4_16_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/B4_16_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_6/B4_16_6_summary.csv" }, { "date_key": "2026-01-10T05:45:04", "fields": { "# Binary Variables": "24", "# Continuous Variables": "0", "# Decision Variables": "48", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.02", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:04", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/B4_16_5_summary.csv:1", "instance": "B4_16_5", "instance_dir": "B4_16_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/B4_16_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_5/B4_16_5_summary.csv" }, { "date_key": "2026-01-10T05:45:02", "fields": { "# Binary Variables": "21", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:45:02", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/B4_16_4_summary.csv:1", "instance": "B4_16_4", "instance_dir": "B4_16_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/B4_16_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_4/B4_16_4_summary.csv" }, { "date_key": "2026-01-10T05:44:58", "fields": { "# Binary Variables": "18", "# Continuous Variables": "0", "# Decision Variables": "36", "# Feasible Runs": "1", "# Integer Variables": "18", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "8.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:58", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "8.0", "Other HW Runtime": "N/A", "Problem": "B4_16_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/B4_16_3_summary.csv:1", "instance": "B4_16_3", "instance_dir": "B4_16_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/B4_16_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_3/B4_16_3_summary.csv" }, { "date_key": "2026-01-10T05:44:55", "fields": { "# Binary Variables": "22", "# Continuous Variables": "0", "# Decision Variables": "46", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.03", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:55", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "B4_16_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/B4_16_2_summary.csv:1", "instance": "B4_16_2", "instance_dir": "B4_16_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/B4_16_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_2/B4_16_2_summary.csv" }, { "date_key": "2026-01-10T05:44:53", "fields": { "# Binary Variables": "22", "# Continuous Variables": "0", "# Decision Variables": "46", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "168", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "9.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 10000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:53", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "9.0", "Other HW Runtime": "N/A", "Problem": "B4_16_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/B4_16_1_summary.csv:1", "instance": "B4_16_1", "instance_dir": "B4_16_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/B4_16_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B4_16_1/B4_16_1_summary.csv" }, { "date_key": "2026-01-10T05:44:51", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:51", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B3_9_10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/B3_9_10_summary.csv:1", "instance": "B3_9_10", "instance_dir": "B3_9_10", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/B3_9_10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_10/B3_9_10_summary.csv" }, { "date_key": "2026-01-10T05:44:50", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:50", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B3_9_9", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/B3_9_9_summary.csv:1", "instance": "B3_9_9", "instance_dir": "B3_9_9", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/B3_9_9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_9/B3_9_9_summary.csv" }, { "date_key": "2026-01-10T05:44:46", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:46", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B3_9_8", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/B3_9_8_summary.csv:1", "instance": "B3_9_8", "instance_dir": "B3_9_8", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/B3_9_8_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_8/B3_9_8_summary.csv" }, { "date_key": "2026-01-10T05:44:44", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:44", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B3_9_7", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/B3_9_7_summary.csv:1", "instance": "B3_9_7", "instance_dir": "B3_9_7", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/B3_9_7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_7/B3_9_7_summary.csv" }, { "date_key": "2026-01-10T05:44:40", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:40", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B3_9_6", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/B3_9_6_summary.csv:1", "instance": "B3_9_6", "instance_dir": "B3_9_6", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/B3_9_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_6/B3_9_6_summary.csv" }, { "date_key": "2026-01-10T05:44:37", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:37", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "B3_9_5", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/B3_9_5_summary.csv:1", "instance": "B3_9_5", "instance_dir": "B3_9_5", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/B3_9_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_5/B3_9_5_summary.csv" }, { "date_key": "2026-01-10T05:44:34", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:34", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B3_9_4", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/B3_9_4_summary.csv:1", "instance": "B3_9_4", "instance_dir": "B3_9_4", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/B3_9_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_4/B3_9_4_summary.csv" }, { "date_key": "2026-01-10T05:44:31", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:31", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B3_9_3", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/B3_9_3_summary.csv:1", "instance": "B3_9_3", "instance_dir": "B3_9_3", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/B3_9_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_3/B3_9_3_summary.csv" }, { "date_key": "2026-01-10T05:44:28", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:28", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B3_9_2", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/B3_9_2_summary.csv:1", "instance": "B3_9_2", "instance_dir": "B3_9_2", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/B3_9_2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_2/B3_9_2_summary.csv" }, { "date_key": "2026-01-10T05:44:26", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "36", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2026-01-10 05:44:26", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "B3_9_1", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/B3_9_1_summary.csv:1", "instance": "B3_9_1", "instance_dir": "B3_9_1", "problem_dir": "03-birkhoff", "problem_number": "03", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/README.md", "submission_set": "20260111_Gurobi_Schicker", "summary_csv": "03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/B3_9_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker/B3_9_1/B3_9_1_summary.csv" }, { "date_key": "2025-07-15T19:42:09", "fields": { "# Binary Variables": "2024", "# Continuous Variables": "0", "# Decision Variables": "2024", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "78848", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "185.0", "CPU Runtime": "8569.33", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:42:09", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "268.0", "Other HW Runtime": "N/A", "Problem": "sorrell7", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/sorrell7/sorrell7_summary.csv:1", "instance": "sorrell7", "instance_dir": "sorrell7", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/sorrell7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sorrell7/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/sorrell7/sorrell7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sorrell7/sorrell7_summary.csv" }, { "date_key": "2025-07-15T19:32:59", "fields": { "# Binary Variables": "2048", "# Continuous Variables": "0", "# Decision Variables": "2048", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1008902", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "23.0", "CPU Runtime": "4702.21", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:32:59", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "32.0", "Other HW Runtime": "N/A", "Problem": "sorrell4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.22", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/sorrell4/sorrell4_summary.csv:1", "instance": "sorrell4", "instance_dir": "sorrell4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/sorrell4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sorrell4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/sorrell4/sorrell4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sorrell4/sorrell4_summary.csv" }, { "date_key": "2025-07-15T19:28:32", "fields": { "# Binary Variables": "2480", "# Continuous Variables": "0", "# Decision Variables": "2480", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "223992", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "498.0", "CPU Runtime": "2514.31", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:28:32", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "541.0", "Other HW Runtime": "N/A", "Problem": "socfb-trinity100", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.2", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/socfb-trinity100/socfb-trinity100_summary.csv:1", "instance": "socfb-trinity100", "instance_dir": "socfb-trinity100", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/socfb-trinity100/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-trinity100/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/socfb-trinity100/socfb-trinity100_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-trinity100/socfb-trinity100_summary.csv" }, { "date_key": "2025-07-15T19:18:58", "fields": { "# Binary Variables": "1392", "# Continuous Variables": "0", "# Decision Variables": "1392", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "119178", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "282.0", "CPU Runtime": "762.14", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:18:58", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "282.0", "Other HW Runtime": "N/A", "Problem": "socfb-haverford76", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "838.67", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/socfb-haverford76_summary.csv:1", "instance": "socfb-haverford76", "instance_dir": "socfb-haverford76", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/socfb-haverford76_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/socfb-haverford76/socfb-haverford76_summary.csv" }, { "date_key": "2025-07-15T19:18:55", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "10346", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.05", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:18:55", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "sloane_2dc_128", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv:1", "instance": "sloane_2dc_128", "instance_dir": "sloane_2dc_128", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv" }, { "date_key": "2025-07-15T19:18:52", "fields": { "# Binary Variables": "112", "# Continuous Variables": "0", "# Decision Variables": "112", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "2240", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "18.0", "CPU Runtime": "0.06", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:18:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "18.0", "Other HW Runtime": "N/A", "Problem": "sloane_1zc_128", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.22", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv:1", "instance": "sloane_1zc_128", "instance_dir": "sloane_1zc_128", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv" }, { "date_key": "2025-07-15T19:18:49", "fields": { "# Binary Variables": "44", "# Continuous Variables": "0", "# Decision Variables": "44", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1086", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:18:49", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "sloane_1dc_64", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv:1", "instance": "sloane_1dc_64", "instance_dir": "sloane_1dc_64", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv" }, { "date_key": "2025-07-15T19:18:47", "fields": { "# Binary Variables": "104", "# Continuous Variables": "0", "# Decision Variables": "104", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "2942", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "16.0", "CPU Runtime": "0.02", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:18:47", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "16.0", "Other HW Runtime": "N/A", "Problem": "sloane_1dc_128", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv:1", "instance": "sloane_1dc_128", "instance_dir": "sloane_1dc_128", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv" }, { "date_key": "2025-07-15T19:14:03", "fields": { "# Binary Variables": "1500", "# Continuous Variables": "0", "# Decision Variables": "1500", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "554012", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "94.0", "CPU Runtime": "3768.25", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 19:14:03", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "207.0", "Other HW Runtime": "N/A", "Problem": "p_hat1500-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.84", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/p_hat1500-3_summary.csv:1", "instance": "p_hat1500-3", "instance_dir": "p_hat1500-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/p_hat1500-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-3/p_hat1500-3_summary.csv" }, { "date_key": "2025-07-15T18:44:10", "fields": { "# Binary Variables": "1500", "# Continuous Variables": "0", "# Decision Variables": "1500", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1678654", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "11.0", "CPU Runtime": "8200.92", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:44:10", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "57.0", "Other HW Runtime": "N/A", "Problem": "p_hat1500-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7201.43", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-1/p_hat1500-1_summary.csv:1", "instance": "p_hat1500-1", "instance_dir": "p_hat1500-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-1/p_hat1500-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/p_hat1500-1/p_hat1500-1_summary.csv" }, { "date_key": "2025-07-15T18:44:07", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "17", "# Non-Zero Coefficients": "182", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:44:07", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "mammalia-kangaroo-interactions", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv:1", "instance": "mammalia-kangaroo-interactions", "instance_dir": "mammalia-kangaroo-interactions", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "date_key": "2025-07-15T18:10:41", "fields": { "# Binary Variables": "3361", "# Continuous Variables": "0", "# Decision Variables": "3361", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "2053164", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "41.0", "CPU Runtime": "10555.09", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "243.0", "Other HW Runtime": "N/A", "Problem": "keller6", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/keller6/keller6_summary.csv:1", "instance": "keller6", "instance_dir": "keller6", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/keller6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller6/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/keller6/keller6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller6/keller6_summary.csv" }, { "date_key": "2025-07-15T18:10:38", "fields": { "# Binary Variables": "171", "# Continuous Variables": "0", "# Decision Variables": "171", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "10200", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "11.0", "CPU Runtime": "1.4", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:38", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "11.0", "Other HW Runtime": "N/A", "Problem": "keller4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.66", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/keller4/keller4_summary.csv:1", "instance": "keller4", "instance_dir": "keller4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/keller4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/keller4/keller4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/keller4/keller4_summary.csv" }, { "date_key": "2025-07-15T18:10:34", "fields": { "# Binary Variables": "4", "# Continuous Variables": "0", "# Decision Variables": "4", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "156", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "20.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:34", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "20.0", "Other HW Runtime": "N/A", "Problem": "karate", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/karate/karate_summary.csv:1", "instance": "karate", "instance_dir": "karate", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/karate/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/karate/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/karate/karate_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/karate/karate_summary.csv" }, { "date_key": "2025-07-15T18:10:32", "fields": { "# Binary Variables": "70", "# Continuous Variables": "0", "# Decision Variables": "70", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "3710", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.04", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:32", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "johnson8-4-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/johnson8-4-4_summary.csv:1", "instance": "johnson8-4-4", "instance_dir": "johnson8-4-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/johnson8-4-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-4-4/johnson8-4-4_summary.csv" }, { "date_key": "2025-07-15T18:10:29", "fields": { "# Binary Variables": "28", "# Continuous Variables": "0", "# Decision Variables": "28", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "420", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "7.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:29", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "7.0", "Other HW Runtime": "N/A", "Problem": "johnson8-2-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/johnson8-2-4_summary.csv:1", "instance": "johnson8-2-4", "instance_dir": "johnson8-2-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/johnson8-2-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson8-2-4/johnson8-2-4_summary.csv" }, { "date_key": "2025-07-15T18:10:26", "fields": { "# Binary Variables": "120", "# Continuous Variables": "0", "# Decision Variables": "120", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "10920", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "15.0", "CPU Runtime": "0.06", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:26", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "15.0", "Other HW Runtime": "N/A", "Problem": "johnson16-2-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/johnson16-2-4_summary.csv:1", "instance": "johnson16-2-4", "instance_dir": "johnson16-2-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/johnson16-2-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/johnson16-2-4/johnson16-2-4_summary.csv" }, { "date_key": "2025-07-15T18:10:23", "fields": { "# Binary Variables": "160", "# Continuous Variables": "0", "# Decision Variables": "160", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "17766", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "9.0", "CPU Runtime": "0.2", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:23", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "9.0", "Other HW Runtime": "N/A", "Problem": "insecta-ant-colony3-day09", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.23", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv:1", "instance": "insecta-ant-colony3-day09", "instance_dir": "insecta-ant-colony3-day09", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv" }, { "date_key": "2025-07-15T18:10:21", "fields": { "# Binary Variables": "35", "# Continuous Variables": "0", "# Decision Variables": "35", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "2268", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:21", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "insecta-ant-colony1-day38", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv:1", "instance": "insecta-ant-colony1-day38", "instance_dir": "insecta-ant-colony1-day38", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv" }, { "date_key": "2025-07-15T18:10:20", "fields": { "# Binary Variables": "31", "# Continuous Variables": "0", "# Decision Variables": "31", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "180", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:20", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "13.0", "Other HW Runtime": "N/A", "Problem": "ibm32", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/ibm32_summary.csv:1", "instance": "ibm32", "instance_dir": "ibm32", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/ibm32_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/ibm32/ibm32_summary.csv" }, { "date_key": "2025-07-15T18:10:16", "fields": { "# Binary Variables": "64", "# Continuous Variables": "0", "# Decision Variables": "64", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1408", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12.0", "CPU Runtime": "0.08", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:16", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "hamming6-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.22", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/hamming6-4_summary.csv:1", "instance": "hamming6-4", "instance_dir": "hamming6-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/hamming6-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-4/hamming6-4_summary.csv" }, { "date_key": "2025-07-15T18:10:13", "fields": { "# Binary Variables": "64", "# Continuous Variables": "0", "# Decision Variables": "64", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "3648", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:10:13", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "hamming6-2", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/hamming6-2_summary.csv:1", "instance": "hamming6-2", "instance_dir": "hamming6-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/hamming6-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming6-2/hamming6-2_summary.csv" }, { "date_key": "2025-07-15T18:02:47", "fields": { "# Binary Variables": "1024", "# Continuous Variables": "0", "# Decision Variables": "1024", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "179200", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "40.0", "CPU Runtime": "9297.71", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:02:47", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "47.0", "Other HW Runtime": "N/A", "Problem": "hamming10-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.16", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/hamming10-4_summary.csv:1", "instance": "hamming10-4", "instance_dir": "hamming10-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/hamming10-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/hamming10-4/hamming10-4_summary.csv" }, { "date_key": "2025-07-15T18:02:44", "fields": { "# Binary Variables": "200", "# Continuous Variables": "0", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "3980", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "44.0", "CPU Runtime": "0.05", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 18:02:44", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "44.0", "Other HW Runtime": "N/A", "Problem": "gen200_p0-9_44", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv:1", "instance": "gen200_p0-9_44", "instance_dir": "gen200_p0-9_44", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv" }, { "date_key": "2025-07-15T17:55:06", "fields": { "# Binary Variables": "1534", "# Continuous Variables": "0", "# Decision Variables": "1534", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "252326", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "56.0", "CPU Runtime": "5256.17", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:55:06", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "59.0", "Other HW Runtime": "N/A", "Problem": "frb59-26-2", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.83", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/frb59-26-2_summary.csv:1", "instance": "frb59-26-2", "instance_dir": "frb59-26-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/frb59-26-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb59-26-2/frb59-26-2_summary.csv" }, { "date_key": "2025-07-15T17:49:06", "fields": { "# Binary Variables": "1272", "# Continuous Variables": "0", "# Decision Variables": "1272", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "188454", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "50.0", "CPU Runtime": "5941.22", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:49:06", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "53.0", "Other HW Runtime": "N/A", "Problem": "frb53-24-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/frb53-24-1/frb53-24-1_summary.csv:1", "instance": "frb53-24-1", "instance_dir": "frb53-24-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/frb53-24-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb53-24-1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/frb53-24-1/frb53-24-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb53-24-1/frb53-24-1_summary.csv" }, { "date_key": "2025-07-15T17:45:56", "fields": { "# Binary Variables": "1150", "# Continuous Variables": "0", "# Decision Variables": "1150", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "162136", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "48.0", "CPU Runtime": "4841.89", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:45:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "50.0", "Other HW Runtime": "N/A", "Problem": "frb50-23-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/frb50-23-3/frb50-23-3_summary.csv:1", "instance": "frb50-23-3", "instance_dir": "frb50-23-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/frb50-23-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb50-23-3/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/frb50-23-3/frb50-23-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb50-23-3/frb50-23-3_summary.csv" }, { "date_key": "2025-07-15T17:42:04", "fields": { "# Binary Variables": "945", "# Continuous Variables": "0", "# Decision Variables": "945", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "116490", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "44.0", "CPU Runtime": "5040.18", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:42:04", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "45.0", "Other HW Runtime": "N/A", "Problem": "frb45-21-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7201.46", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/frb45-21-3_summary.csv:1", "instance": "frb45-21-3", "instance_dir": "frb45-21-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/frb45-21-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb45-21-3/frb45-21-3_summary.csv" }, { "date_key": "2025-07-15T17:28:22", "fields": { "# Binary Variables": "4000", "# Continuous Variables": "0", "# Decision Variables": "4000", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1145548", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "77.0", "CPU Runtime": "3209.36", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:22", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "328.0", "Other HW Runtime": "N/A", "Problem": "frb100-40", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7205.13", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/frb100-40/frb100-40_summary.csv:1", "instance": "frb100-40", "instance_dir": "frb100-40", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/frb100-40/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb100-40/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/frb100-40/frb100-40_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/frb100-40/frb100-40_summary.csv" }, { "date_key": "2025-07-15T17:28:19", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "35", "# Non-Zero Coefficients": "236", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "16.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:19", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "16.0", "Other HW Runtime": "N/A", "Problem": "football", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/football/football_summary.csv:1", "instance": "football", "instance_dir": "football", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/football/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/football/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/football/football_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/football/football_summary.csv" }, { "date_key": "2025-07-15T17:28:16", "fields": { "# Binary Variables": "9", "# Continuous Variables": "0", "# Decision Variables": "9", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "78", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:16", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "farm", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/farm/farm_summary.csv:1", "instance": "farm", "instance_dir": "farm", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/farm/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/farm/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/farm/farm_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/farm/farm_summary.csv" }, { "date_key": "2025-07-15T17:28:15", "fields": { "# Binary Variables": "85", "# Continuous Variables": "0", "# Decision Variables": "85", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "476", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "78.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:15", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "78.0", "Other HW Runtime": "N/A", "Problem": "es60fst04", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/es60fst04_summary.csv:1", "instance": "es60fst04", "instance_dir": "es60fst04", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/es60fst04_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst04/es60fst04_summary.csv" }, { "date_key": "2025-07-15T17:28:13", "fields": { "# Binary Variables": "48", "# Continuous Variables": "0", "# Decision Variables": "48", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "284", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "55.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:13", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "55.0", "Other HW Runtime": "N/A", "Problem": "es60fst03", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/es60fst03_summary.csv:1", "instance": "es60fst03", "instance_dir": "es60fst03", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/es60fst03_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst03/es60fst03_summary.csv" }, { "date_key": "2025-07-15T17:28:10", "fields": { "# Binary Variables": "121", "# Continuous Variables": "0", "# Decision Variables": "121", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "88.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:10", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "88.0", "Other HW Runtime": "N/A", "Problem": "es60fst02", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/es60fst02_summary.csv:1", "instance": "es60fst02", "instance_dir": "es60fst02", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/es60fst02_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst02/es60fst02_summary.csv" }, { "date_key": "2025-07-15T17:28:09", "fields": { "# Binary Variables": "25", "# Continuous Variables": "0", "# Decision Variables": "25", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "318", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "60.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:09", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "60.0", "Other HW Runtime": "N/A", "Problem": "es60fst01", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/es60fst01_summary.csv:1", "instance": "es60fst01", "instance_dir": "es60fst01", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/es60fst01_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/es60fst01/es60fst01_summary.csv" }, { "date_key": "2025-07-15T17:28:06", "fields": { "# Binary Variables": "8", "# Continuous Variables": "0", "# Decision Variables": "8", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "340", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "17.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:06", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "17.0", "Other HW Runtime": "N/A", "Problem": "chesapeake", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/chesapeake_summary.csv:1", "instance": "chesapeake", "instance_dir": "chesapeake", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/chesapeake_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/chesapeake/chesapeake_summary.csv" }, { "date_key": "2025-07-15T17:28:03", "fields": { "# Binary Variables": "37", "# Continuous Variables": "0", "# Decision Variables": "37", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "3068", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "18.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:28:03", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "18.0", "Other HW Runtime": "N/A", "Problem": "c-fat200-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/c-fat200-1_summary.csv:1", "instance": "c-fat200-1", "instance_dir": "c-fat200-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/c-fat200-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/c-fat200-1/c-fat200-1_summary.csv" }, { "date_key": "2025-07-15T17:14:00", "fields": { "# Binary Variables": "800", "# Continuous Variables": "0", "# Decision Variables": "800", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "224190", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "20.0", "CPU Runtime": "3239.77", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 17:14:00", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "88.0", "Other HW Runtime": "N/A", "Problem": "brock800-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.32", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/brock800-1/brock800-1_summary.csv:1", "instance": "brock800-1", "instance_dir": "brock800-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/brock800-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock800-1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/brock800-1/brock800-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock800-1/brock800-1_summary.csv" }, { "date_key": "2025-07-15T16:43:35", "fields": { "# Binary Variables": "400", "# Continuous Variables": "0", "# Decision Variables": "400", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "40154", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "27.0", "CPU Runtime": "8685.99", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:43:35", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "31.0", "Other HW Runtime": "N/A", "Problem": "brock400-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/brock400-1_summary.csv:1", "instance": "brock400-1", "instance_dir": "brock400-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/brock400-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock400-1/brock400-1_summary.csv" }, { "date_key": "2025-07-15T16:43:28", "fields": { "# Binary Variables": "200", "# Continuous Variables": "0", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "26178", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "8.0", "CPU Runtime": "9.67", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:43:28", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "8.0", "Other HW Runtime": "N/A", "Problem": "brock200-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "6.32", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/brock200-4_summary.csv:1", "instance": "brock200-4", "instance_dir": "brock200-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/brock200-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-4/brock200-4_summary.csv" }, { "date_key": "2025-07-15T16:43:20", "fields": { "# Binary Variables": "200", "# Continuous Variables": "0", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "24096", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "9.0", "CPU Runtime": "11.33", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:43:20", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "9.0", "Other HW Runtime": "N/A", "Problem": "brock200-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7.57", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/brock200-3_summary.csv:1", "instance": "brock200-3", "instance_dir": "brock200-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/brock200-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-3/brock200-3_summary.csv" }, { "date_key": "2025-07-15T16:43:13", "fields": { "# Binary Variables": "200", "# Continuous Variables": "0", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "20048", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12.0", "CPU Runtime": "8.49", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:43:13", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "brock200-2", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "5.98", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/brock200-2_summary.csv:1", "instance": "brock200-2", "instance_dir": "brock200-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/brock200-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-2/brock200-2_summary.csv" }, { "date_key": "2025-07-15T16:43:06", "fields": { "# Binary Variables": "200", "# Continuous Variables": "0", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "29668", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "8.28", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:43:06", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "brock200-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "5.55", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/brock200-1_summary.csv:1", "instance": "brock200-1", "instance_dir": "brock200-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/brock200-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/brock200-1/brock200-1_summary.csv" }, { "date_key": "2025-07-15T16:43:03", "fields": { "# Binary Variables": "0", "# Continuous Variables": "0", "# Decision Variables": "0", "# Feasible Runs": "1", "# Integer Variables": "52", "# Non-Zero Coefficients": "908", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:43:03", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "13.0", "Other HW Runtime": "N/A", "Problem": "aves-sparrow-social", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv:1", "instance": "aves-sparrow-social", "instance_dir": "aves-sparrow-social", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "date_key": "2025-07-15T16:09:33", "fields": { "# Binary Variables": "500", "# Continuous Variables": "0", "# Decision Variables": "500", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "12512", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "89.0", "CPU Runtime": "9514.88", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:09:33", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "128.0", "Other HW Runtime": "N/A", "Problem": "R_500_005_1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/R_500_005_1/R_500_005_1_summary.csv:1", "instance": "R_500_005_1", "instance_dir": "R_500_005_1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/R_500_005_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/R_500_005_1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/R_500_005_1/R_500_005_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/R_500_005_1/R_500_005_1_summary.csv" }, { "date_key": "2025-07-15T16:02:41", "fields": { "# Binary Variables": "1000", "# Continuous Variables": "0", "# Decision Variables": "1000", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "49340", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "108.0", "CPU Runtime": "8824.04", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:02:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "252.0", "Other HW Runtime": "N/A", "Problem": "R_1000_005_1", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/R_1000_005_1/R_1000_005_1_summary.csv:1", "instance": "R_1000_005_1", "instance_dir": "R_1000_005_1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/R_1000_005_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/R_1000_005_1/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/R_1000_005_1/R_1000_005_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/R_1000_005_1/R_1000_005_1_summary.csv" }, { "date_key": "2025-07-15T16:02:39", "fields": { "# Binary Variables": "45", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1836", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 16:02:39", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "MANN-a9", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/MANN-a9_summary.csv:1", "instance": "MANN-a9", "instance_dir": "MANN-a9", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/MANN-a9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/MANN-a9/MANN-a9_summary.csv" }, { "date_key": "2025-07-15T15:54:37", "fields": { "# Binary Variables": "500", "# Continuous Variables": "0", "# Decision Variables": "500", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "24836", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "54.0", "CPU Runtime": "9809.11", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 15:54:37", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "94.0", "Other HW Runtime": "N/A", "Problem": "C500-9", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/C500-9/C500-9_summary.csv:1", "instance": "C500-9", "instance_dir": "C500-9", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/C500-9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C500-9/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/C500-9/C500-9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C500-9/C500-9_summary.csv" }, { "date_key": "2025-07-15T15:45:49", "fields": { "# Binary Variables": "4000", "# Continuous Variables": "0", "# Decision Variables": "4000", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "7995464", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "12.0", "CPU Runtime": "12431.02", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 15:45:49", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4000.0", "Other HW Runtime": "N/A", "Problem": "C4000-5", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.12", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/C4000-5/C4000-5_summary.csv:1", "instance": "C4000-5", "instance_dir": "C4000-5", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/C4000-5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C4000-5/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/C4000-5/C4000-5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C4000-5/C4000-5_summary.csv" }, { "date_key": "2025-07-15T15:45:47", "fields": { "# Binary Variables": "125", "# Continuous Variables": "0", "# Decision Variables": "125", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1574", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "34.0", "CPU Runtime": "0.52", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2025-07-15 15:45:47", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "34.0", "Other HW Runtime": "N/A", "Problem": "C125-9", "QPU Runtime": "N/A", "Reference": "See Models Directory (BLP) using Gurobi 12.0.1", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.97", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/C125-9_summary.csv:1", "instance": "C125-9", "instance_dir": "C125-9", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/README.md", "submission_set": "20250715_Gurobi_Schicker", "summary_csv": "07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/C125-9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/C125-9/C125-9_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "2048", "# Continuous Variables": "N/A", "# Decision Variables": "2048", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "78848", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "189", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "663.545565", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "sorrell7", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.038177", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/sorrell7_summary.csv:1", "instance": "sorrell7", "instance_dir": "sorrell7", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/sorrell7_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell7/sorrell7_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "2048", "# Continuous Variables": "N/A", "# Decision Variables": "2048", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1008902", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "24", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "1708.827991", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "sorrell4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "1708.889542", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/sorrell4_summary.csv:1", "instance": "sorrell4", "instance_dir": "sorrell4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/sorrell4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sorrell4/sorrell4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "2613", "# Continuous Variables": "N/A", "# Decision Variables": "2613", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "223992", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "499", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "1361.479842", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "socfb-trinity100", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.057372", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/socfb-trinity100_summary.csv:1", "instance": "socfb-trinity100", "instance_dir": "socfb-trinity100", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/socfb-trinity100_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-trinity100/socfb-trinity100_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1446", "# Continuous Variables": "N/A", "# Decision Variables": "1446", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "119178", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "282", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.645101", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "socfb-haverford76", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.023676", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/socfb-haverford76/socfb-haverford76_summary.csv:1", "instance": "socfb-haverford76", "instance_dir": "socfb-haverford76", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/socfb-haverford76/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-haverford76/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/socfb-haverford76/socfb-haverford76_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/socfb-haverford76/socfb-haverford76_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "128", "# Continuous Variables": "N/A", "# Decision Variables": "128", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "10346", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000212", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "sloane_2dc_128", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.087573", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv:1", "instance": "sloane_2dc_128", "instance_dir": "sloane_2dc_128", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_2dc_128/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_2dc_128/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_2dc_128/sloane_2dc_128_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "128", "# Continuous Variables": "N/A", "# Decision Variables": "128", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2240", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "18", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000342", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "sloane_1zc_128", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.086511", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv:1", "instance": "sloane_1zc_128", "instance_dir": "sloane_1zc_128", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1zc_128/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1zc_128/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1zc_128/sloane_1zc_128_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "64", "# Continuous Variables": "N/A", "# Decision Variables": "64", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1086", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000211", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "sloane_1dc_64", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.127906", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv:1", "instance": "sloane_1dc_64", "instance_dir": "sloane_1dc_64", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_64/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_64/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_64/sloane_1dc_64_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "128", "# Continuous Variables": "N/A", "# Decision Variables": "128", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2942", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "16", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.00381", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "sloane_1dc_128", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.084904", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv:1", "instance": "sloane_1dc_128", "instance_dir": "sloane_1dc_128", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_128/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_128/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/sloane_1dc_128/sloane_1dc_128_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1500", "# Continuous Variables": "N/A", "# Decision Variables": "1500", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "554012", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "94", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.150359", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "p_hat1500-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.194412", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-3/p_hat1500-3_summary.csv:1", "instance": "p_hat1500-3", "instance_dir": "p_hat1500-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-3/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-3/p_hat1500-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-3/p_hat1500-3_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1500", "# Continuous Variables": "N/A", "# Decision Variables": "1500", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1678654", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "2.436019", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "p_hat1500-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "2.488459", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/p_hat1500-1_summary.csv:1", "instance": "p_hat1500-1", "instance_dir": "p_hat1500-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/p_hat1500-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/p_hat1500-1/p_hat1500-1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "17", "# Continuous Variables": "N/A", "# Decision Variables": "17", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "182", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "4.7e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "mammalia-kangaroo-interactions", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.152356", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv:1", "instance": "mammalia-kangaroo-interactions", "instance_dir": "mammalia-kangaroo-interactions", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/mammalia-kangaroo-interactions/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/mammalia-kangaroo-interactions/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "3361", "# Continuous Variables": "N/A", "# Decision Variables": "3361", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2053164", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "59", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "290.937957", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "keller6", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.056106", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/keller6/keller6_summary.csv:1", "instance": "keller6", "instance_dir": "keller6", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/keller6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller6/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/keller6/keller6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller6/keller6_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "171", "# Continuous Variables": "N/A", "# Decision Variables": "171", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "10200", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "11", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000877", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "keller4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.070807", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/keller4/keller4_summary.csv:1", "instance": "keller4", "instance_dir": "keller4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/keller4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/keller4/keller4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/keller4/keller4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "34", "# Continuous Variables": "N/A", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "156", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "20", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "7.2e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "karate", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.183669", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/karate/karate_summary.csv:1", "instance": "karate", "instance_dir": "karate", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/karate/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/karate/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/karate/karate_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/karate/karate_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "70", "# Continuous Variables": "N/A", "# Decision Variables": "70", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3710", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.00011", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "johnson8-4-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.108894", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/johnson8-4-4/johnson8-4-4_summary.csv:1", "instance": "johnson8-4-4", "instance_dir": "johnson8-4-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/johnson8-4-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson8-4-4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/johnson8-4-4/johnson8-4-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson8-4-4/johnson8-4-4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "28", "# Continuous Variables": "N/A", "# Decision Variables": "28", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "420", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "7", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "4.9e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "johnson8-2-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.279965", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/johnson8-2-4/johnson8-2-4_summary.csv:1", "instance": "johnson8-2-4", "instance_dir": "johnson8-2-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/johnson8-2-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson8-2-4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/johnson8-2-4/johnson8-2-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson8-2-4/johnson8-2-4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "120", "# Continuous Variables": "N/A", "# Decision Variables": "120", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "10920", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "15", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000161", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "johnson16-2-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.087709", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/johnson16-2-4/johnson16-2-4_summary.csv:1", "instance": "johnson16-2-4", "instance_dir": "johnson16-2-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/johnson16-2-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson16-2-4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/johnson16-2-4/johnson16-2-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/johnson16-2-4/johnson16-2-4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "160", "# Continuous Variables": "N/A", "# Decision Variables": "160", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "17766", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "9", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000611", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "insecta-ant-colony3-day09", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.061239", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv:1", "instance": "insecta-ant-colony3-day09", "instance_dir": "insecta-ant-colony3-day09", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony3-day09/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony3-day09/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony3-day09/insecta-ant-colony3-day09_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "56", "# Continuous Variables": "N/A", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2268", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "7.7e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "insecta-ant-colony1-day38", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.098633", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv:1", "instance": "insecta-ant-colony1-day38", "instance_dir": "insecta-ant-colony1-day38", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony1-day38/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony1-day38/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/insecta-ant-colony1-day38/insecta-ant-colony1-day38_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "32", "# Continuous Variables": "N/A", "# Decision Variables": "32", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "180", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000118", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ibm32", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.14448", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/ibm32/ibm32_summary.csv:1", "instance": "ibm32", "instance_dir": "ibm32", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/ibm32/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/ibm32/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/ibm32/ibm32_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/ibm32/ibm32_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "64", "# Continuous Variables": "N/A", "# Decision Variables": "64", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1408", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "7.6e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "hamming6-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.099993", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/hamming6-4/hamming6-4_summary.csv:1", "instance": "hamming6-4", "instance_dir": "hamming6-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/hamming6-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming6-4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/hamming6-4/hamming6-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming6-4/hamming6-4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "64", "# Continuous Variables": "N/A", "# Decision Variables": "64", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3648", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "7.8e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "hamming6-2", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.0982", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/hamming6-2/hamming6-2_summary.csv:1", "instance": "hamming6-2", "instance_dir": "hamming6-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/hamming6-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming6-2/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/hamming6-2/hamming6-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming6-2/hamming6-2_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1024", "# Continuous Variables": "N/A", "# Decision Variables": "1024", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "179200", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "40", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.083474", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "hamming10-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.015458", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/hamming10-4/hamming10-4_summary.csv:1", "instance": "hamming10-4", "instance_dir": "hamming10-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/hamming10-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming10-4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/hamming10-4/hamming10-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/hamming10-4/hamming10-4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "N/A", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3980", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "44", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.020548", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "gen200_p0-9_44", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.077412", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv:1", "instance": "gen200_p0-9_44", "instance_dir": "gen200_p0-9_44", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/gen200_p0-9_44/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/gen200_p0-9_44/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/gen200_p0-9_44/gen200_p0-9_44_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1534", "# Continuous Variables": "N/A", "# Decision Variables": "1534", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "252326", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "56", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "1.949973", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "frb59-26-2", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.026409", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/frb59-26-2/frb59-26-2_summary.csv:1", "instance": "frb59-26-2", "instance_dir": "frb59-26-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/frb59-26-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb59-26-2/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/frb59-26-2/frb59-26-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb59-26-2/frb59-26-2_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1272", "# Continuous Variables": "N/A", "# Decision Variables": "1272", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "188454", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "51", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "1023.540733", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "frb53-24-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.021163", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/frb53-24-1_summary.csv:1", "instance": "frb53-24-1", "instance_dir": "frb53-24-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/frb53-24-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb53-24-1/frb53-24-1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1150", "# Continuous Variables": "N/A", "# Decision Variables": "1150", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "162136", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "49", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "252.274143", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "frb50-23-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.016719", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/frb50-23-3_summary.csv:1", "instance": "frb50-23-3", "instance_dir": "frb50-23-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/frb50-23-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb50-23-3/frb50-23-3_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "945", "# Continuous Variables": "N/A", "# Decision Variables": "945", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "116490", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "43", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "8.661117", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "frb45-21-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.015991", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/frb45-21-3/frb45-21-3_summary.csv:1", "instance": "frb45-21-3", "instance_dir": "frb45-21-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/frb45-21-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb45-21-3/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/frb45-21-3/frb45-21-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb45-21-3/frb45-21-3_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "4000", "# Continuous Variables": "N/A", "# Decision Variables": "4000", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1145548", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "93", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "4634.761939", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "frb100-40", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.097143", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/frb100-40_summary.csv:1", "instance": "frb100-40", "instance_dir": "frb100-40", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/frb100-40_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/frb100-40/frb100-40_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "35", "# Continuous Variables": "N/A", "# Decision Variables": "35", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "236", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "16", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "7.9e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "football", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.176563", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/football/football_summary.csv:1", "instance": "football", "instance_dir": "football", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/football/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/football/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/football/football_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/football/football_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "17", "# Continuous Variables": "N/A", "# Decision Variables": "17", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "78", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "5.3e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "farm", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.25367", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/farm/farm_summary.csv:1", "instance": "farm", "instance_dir": "farm", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/farm/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/farm/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/farm/farm_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/farm/farm_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "162", "# Continuous Variables": "N/A", "# Decision Variables": "162", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "476", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "78", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.052223", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "es60fst04", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.136957", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst04/es60fst04_summary.csv:1", "instance": "es60fst04", "instance_dir": "es60fst04", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst04/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst04/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst04/es60fst04_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst04/es60fst04_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "113", "# Continuous Variables": "N/A", "# Decision Variables": "113", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "284", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "55", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.00143", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "es60fst03", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.080255", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst03/es60fst03_summary.csv:1", "instance": "es60fst03", "instance_dir": "es60fst03", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst03/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst03/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst03/es60fst03_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst03/es60fst03_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "186", "# Continuous Variables": "N/A", "# Decision Variables": "186", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "88", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.03965", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "es60fst02", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.1272", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst02/es60fst02_summary.csv:1", "instance": "es60fst02", "instance_dir": "es60fst02", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst02/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst02/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst02/es60fst02_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst02/es60fst02_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "123", "# Continuous Variables": "N/A", "# Decision Variables": "123", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "318", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "60", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000756", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "es60fst01", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.071935", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst01/es60fst01_summary.csv:1", "instance": "es60fst01", "instance_dir": "es60fst01", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst01/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst01/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/es60fst01/es60fst01_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/es60fst01/es60fst01_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "39", "# Continuous Variables": "N/A", "# Decision Variables": "39", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "340", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "17", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000193", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "chesapeake", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.117324", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/chesapeake/chesapeake_summary.csv:1", "instance": "chesapeake", "instance_dir": "chesapeake", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/chesapeake/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/chesapeake/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/chesapeake/chesapeake_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/chesapeake/chesapeake_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "N/A", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3068", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "18", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000264", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "c-fat200-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.055902", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/c-fat200-1/c-fat200-1_summary.csv:1", "instance": "c-fat200-1", "instance_dir": "c-fat200-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/c-fat200-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/c-fat200-1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/c-fat200-1/c-fat200-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/c-fat200-1/c-fat200-1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "800", "# Continuous Variables": "N/A", "# Decision Variables": "800", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "224190", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "23", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "1139.321906", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock800-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "1139.356846", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/brock800-1_summary.csv:1", "instance": "brock800-1", "instance_dir": "brock800-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/brock800-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock800-1/brock800-1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "400", "# Continuous Variables": "N/A", "# Decision Variables": "400", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "40154", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "27", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "8.430588", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock400-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "8.466471", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/brock400-1/brock400-1_summary.csv:1", "instance": "brock400-1", "instance_dir": "brock400-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/brock400-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock400-1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/brock400-1/brock400-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock400-1/brock400-1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "N/A", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "26178", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "8", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000736", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock200-4", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.054376", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-4/brock200-4_summary.csv:1", "instance": "brock200-4", "instance_dir": "brock200-4", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-4/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-4/brock200-4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-4/brock200-4_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "N/A", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "24096", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "9", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.011155", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock200-3", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.053338", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-3/brock200-3_summary.csv:1", "instance": "brock200-3", "instance_dir": "brock200-3", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-3/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-3/brock200-3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-3/brock200-3_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "N/A", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "20048", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.001483", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock200-2", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.066278", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-2/brock200-2_summary.csv:1", "instance": "brock200-2", "instance_dir": "brock200-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-2/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-2/brock200-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-2/brock200-2_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "N/A", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "29668", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.000299", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock200-1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.05046", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-1/brock200-1_summary.csv:1", "instance": "brock200-1", "instance_dir": "brock200-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/brock200-1/brock200-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/brock200-1/brock200-1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "52", "# Continuous Variables": "N/A", "# Decision Variables": "52", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "908", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "9.2e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "aves-sparrow-social", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.104926", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv:1", "instance": "aves-sparrow-social", "instance_dir": "aves-sparrow-social", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/aves-sparrow-social/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/aves-sparrow-social/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "500", "# Continuous Variables": "N/A", "# Decision Variables": "500", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "12512", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "90", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.380262", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "R_500_005_1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.015039", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/R_500_005_1_summary.csv:1", "instance": "R_500_005_1", "instance_dir": "R_500_005_1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/R_500_005_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_500_005_1/R_500_005_1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "1000", "# Continuous Variables": "N/A", "# Decision Variables": "1000", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "49340", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "115", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "169.638285", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "R_1000_005_1", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.016193", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/R_1000_005_1_summary.csv:1", "instance": "R_1000_005_1", "instance_dir": "R_1000_005_1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/R_1000_005_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/R_1000_005_1/R_1000_005_1_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "45", "# Continuous Variables": "N/A", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1836", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "6.6e-05", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "MANN-a9", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.165682", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/MANN-a9/MANN-a9_summary.csv:1", "instance": "MANN-a9", "instance_dir": "MANN-a9", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/MANN-a9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/MANN-a9/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/MANN-a9/MANN-a9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/MANN-a9/MANN-a9_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "500", "# Continuous Variables": "N/A", "# Decision Variables": "500", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "24836", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "57", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "7.494257", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "C500-9", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.01296", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/C500-9/C500-9_summary.csv:1", "instance": "C500-9", "instance_dir": "C500-9", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/C500-9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C500-9/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/C500-9/C500-9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C500-9/C500-9_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "4000", "# Continuous Variables": "N/A", "# Decision Variables": "4000", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "7995464", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "18", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "166.961235", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "C4000-5", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.104349", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/C4000-5_summary.csv:1", "instance": "C4000-5", "instance_dir": "C4000-5", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/C4000-5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C4000-5/C4000-5_summary.csv" }, { "date_key": "2025-07-15T00:00:00", "fields": { "# Binary Variables": "125", "# Continuous Variables": "N/A", "# Decision Variables": "125", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1574", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "34", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "15. Jul. 2025", "GPU Runtime": "0.004102", "Hardware Specifications": "Four NVIDIA A40 48 GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "C125-9", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.084357", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "07-independentset/submissions/20250715_Abs2_Schicker/C125-9/C125-9_summary.csv:1", "instance": "C125-9", "instance_dir": "C125-9", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/C125-9/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C125-9/README.md", "submission_set": "20250715_Abs2_Schicker", "summary_csv": "07-independentset/submissions/20250715_Abs2_Schicker/C125-9/C125-9_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/C125-9/C125-9_summary.csv" }, { "date_key": "2025-06-27T00:00:00", "fields": { "# Binary Variables": "17", "# Continuous Variables": "0", "# Decision Variables": "17", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "91", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4", "CPU Runtime": "0.005", "Coefficients Range": "[-0.475, 6.875]", "Coefficients Type": "continuous", "Date": "Jun 2, 25", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M1 Pro (8 cores, 16 GB memory)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "mammalia-kangaroo-interactions", "QPU Runtime": "N/A", "Reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/mammalia-kangaroo-interactions.ipynb", "Remarks": "N/A", "Submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "Success Threshold": "0", "Total Runtime": "N/A", "Workflow": "Run an improved implementation of the Mean-Field Approximate Optimization Algorithm (https://doi.org/10.1103/PRXQuantum.4.030335)." }, "id": "07-independentset/submissions/20250627_Quicopt_Bode/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv:1", "instance": "mammalia-kangaroo-interactions", "instance_dir": "mammalia-kangaroo-interactions", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250627_Quicopt_Bode/mammalia-kangaroo-interactions/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/mammalia-kangaroo-interactions/README.md", "submission_set": "20250627_Quicopt_Bode", "summary_csv": "07-independentset/submissions/20250627_Quicopt_Bode/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "date_key": "2025-06-27T00:00:00", "fields": { "# Binary Variables": "400", "# Continuous Variables": "0", "# Decision Variables": "400", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "20077", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "23", "CPU Runtime": "1.7", "Coefficients Range": "[-0.5, 61.5]", "Coefficients Type": "continuous", "Date": "Jun 27, 25", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M1 Pro (8 cores, 16 GB memory)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock400-1", "QPU Runtime": "N/A", "Reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/brock400_1.ipynb", "Remarks": "N/A", "Submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "Success Threshold": "0", "Total Runtime": "N/A", "Workflow": "Run an improved implementation of the Mean-Field Approximate Optimization Algorithm (https://doi.org/10.1103/PRXQuantum.4.030335) and remove violated bonds." }, "id": "07-independentset/submissions/20250627_Quicopt_Bode/brock400-1/brock400-1_summary.csv:1", "instance": "brock400-1", "instance_dir": "brock400-1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250627_Quicopt_Bode/brock400-1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/brock400-1/README.md", "submission_set": "20250627_Quicopt_Bode", "summary_csv": "07-independentset/submissions/20250627_Quicopt_Bode/brock400-1/brock400-1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/brock400-1/brock400-1_summary.csv" }, { "date_key": "2025-06-27T00:00:00", "fields": { "# Binary Variables": "200", "# Continuous Variables": "0", "# Decision Variables": "200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "10024", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "10", "CPU Runtime": "0.9", "Coefficients Range": "[-0.5, 58.5]", "Coefficients Type": "continuous", "Date": "Jun 27, 25", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M1 Pro (8 cores, 16 GB memory)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "brock200-2", "QPU Runtime": "N/A", "Reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/brock200_2.ipynb", "Remarks": "N/A", "Submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "Success Threshold": "0", "Total Runtime": "N/A", "Workflow": "Run an improved implementation of the Mean-Field Approximate Optimization Algorithm (https://doi.org/10.1103/PRXQuantum.4.030335) and remove violated bonds." }, "id": "07-independentset/submissions/20250627_Quicopt_Bode/brock200-2/brock200-2_summary.csv:1", "instance": "brock200-2", "instance_dir": "brock200-2", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250627_Quicopt_Bode/brock200-2/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/brock200-2/README.md", "submission_set": "20250627_Quicopt_Bode", "summary_csv": "07-independentset/submissions/20250627_Quicopt_Bode/brock200-2/brock200-2_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/brock200-2/brock200-2_summary.csv" }, { "date_key": "2025-06-27T00:00:00", "fields": { "# Binary Variables": "52", "# Continuous Variables": "0", "# Decision Variables": "52", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "516", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13", "CPU Runtime": "0.06", "Coefficients Range": "[-1.0, 34.0]", "Coefficients Type": "continuous", "Date": "Jun 2, 25", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M1 Pro (8 cores, 16 GB memory)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "aves-sparrow-social", "QPU Runtime": "N/A", "Reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/aves-sparrow-social.ipynb", "Remarks": "N/A", "Submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "Success Threshold": "0", "Total Runtime": "N/A", "Workflow": "Run an improved implementation of the Mean-Field Approximate Optimization Algorithm (https://doi.org/10.1103/PRXQuantum.4.030335)." }, "id": "07-independentset/submissions/20250627_Quicopt_Bode/aves-sparrow-social/aves-sparrow-social_summary.csv:1", "instance": "aves-sparrow-social", "instance_dir": "aves-sparrow-social", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250627_Quicopt_Bode/aves-sparrow-social/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/aves-sparrow-social/README.md", "submission_set": "20250627_Quicopt_Bode", "summary_csv": "07-independentset/submissions/20250627_Quicopt_Bode/aves-sparrow-social/aves-sparrow-social_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "date_key": "2025-06-27T00:00:00", "fields": { "# Binary Variables": "500", "# Continuous Variables": "0", "# Decision Variables": "500", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "6256", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "89", "CPU Runtime": "1.97", "Coefficients Range": "[-0.5, 18.5]", "Coefficients Type": "continuous", "Date": "Jun 27, 25", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M1 Pro (8 cores, 16 GB memory)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "R_500_005_1", "QPU Runtime": "N/A", "Reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/R_500_005_1.ipynb", "Remarks": "N/A", "Submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "Success Threshold": "0", "Total Runtime": "N/A", "Workflow": "Run an improved implementation of the Mean-Field Approximate Optimization Algorithm (https://doi.org/10.1103/PRXQuantum.4.030335) and remove violated bonds." }, "id": "07-independentset/submissions/20250627_Quicopt_Bode/R_500_005_1/R_500_005_1_summary.csv:1", "instance": "R_500_005_1", "instance_dir": "R_500_005_1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250627_Quicopt_Bode/R_500_005_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/R_500_005_1/README.md", "submission_set": "20250627_Quicopt_Bode", "summary_csv": "07-independentset/submissions/20250627_Quicopt_Bode/R_500_005_1/R_500_005_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/R_500_005_1/R_500_005_1_summary.csv" }, { "date_key": "2025-06-27T00:00:00", "fields": { "# Binary Variables": "1000", "# Continuous Variables": "0", "# Decision Variables": "1000", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "24670", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "111", "CPU Runtime": "118.32", "Coefficients Range": "[-0.5, 37.0]", "Coefficients Type": "continuous", "Date": "Jun 27, 25", "GPU Runtime": "N/A", "Hardware Specifications": "Apple M1 Pro (8 cores, 16 GB memory)", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "R_1000_005_1", "QPU Runtime": "N/A", "Reference": "https://github.com/FZJ-PGI-12/QuicoptBenchmarks/blob/main/notebooks/max_independent_set/R_1000_005_1.ipynb", "Remarks": "N/A", "Submitter": "Tim Bode (Forschungszentrum J\u00fclich)", "Success Threshold": "0", "Total Runtime": "N/A", "Workflow": "Run an improved implementation of the Mean-Field Approximate Optimization Algorithm (https://doi.org/10.1103/PRXQuantum.4.030335) and remove violated bonds." }, "id": "07-independentset/submissions/20250627_Quicopt_Bode/R_1000_005_1/R_1000_005_1_summary.csv:1", "instance": "R_1000_005_1", "instance_dir": "R_1000_005_1", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250627_Quicopt_Bode/R_1000_005_1/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/R_1000_005_1/README.md", "submission_set": "20250627_Quicopt_Bode", "summary_csv": "07-independentset/submissions/20250627_Quicopt_Bode/R_1000_005_1/R_1000_005_1_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode/R_1000_005_1/R_1000_005_1_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "5050", "# Continuous Variables": "N/A", "# Decision Variables": "5050", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1240000", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1050", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "382.597505", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs100", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.165987", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs100/labs100_summary.csv:1", "instance": "labs100", "instance_dir": "labs100", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs100/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs100/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs100/labs100_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs100/labs100_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4950", "# Continuous Variables": "N/A", "# Decision Variables": "4950", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1203048", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1009", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "29.468402", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs099", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.185881", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs099/labs099_summary.csv:1", "instance": "labs099", "instance_dir": "labs099", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs099/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs099/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs099/labs099_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs099/labs099_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4851", "# Continuous Variables": "N/A", "# Decision Variables": "4851", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1166886", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1049", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "292.524023", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs098", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.221728", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs098/labs098_summary.csv:1", "instance": "labs098", "instance_dir": "labs098", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs098/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs098/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs098/labs098_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs098/labs098_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4753", "# Continuous Variables": "N/A", "# Decision Variables": "4753", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1131408", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "988", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "329.302463", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs097", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.207158", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs097/labs097_summary.csv:1", "instance": "labs097", "instance_dir": "labs097", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs097/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs097/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs097/labs097_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs097/labs097_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4656", "# Continuous Variables": "N/A", "# Decision Variables": "4656", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1096704", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1012", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "74.010461", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs096", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.200288", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs096/labs096_summary.csv:1", "instance": "labs096", "instance_dir": "labs096", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs096/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs096/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs096/labs096_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs096/labs096_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4560", "# Continuous Variables": "N/A", "# Decision Variables": "4560", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1062670", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "967", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "14.540503", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs095", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.157069", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs095/labs095_summary.csv:1", "instance": "labs095", "instance_dir": "labs095", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs095/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs095/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs095/labs095_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs095/labs095_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4465", "# Continuous Variables": "N/A", "# Decision Variables": "4465", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1029394", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "931", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "6.348318", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs094", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.116894", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs094/labs094_summary.csv:1", "instance": "labs094", "instance_dir": "labs094", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs094/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs094/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs094/labs094_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs094/labs094_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4371", "# Continuous Variables": "N/A", "# Decision Variables": "4371", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "996774", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "898", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "29.063772", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs093", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.156733", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs093/labs093_summary.csv:1", "instance": "labs093", "instance_dir": "labs093", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs093/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs093/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs093/labs093_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs093/labs093_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4278", "# Continuous Variables": "N/A", "# Decision Variables": "4278", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "964896", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "818", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "85.230432", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs092", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.180133", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs092/labs092_summary.csv:1", "instance": "labs092", "instance_dir": "labs092", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs092/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs092/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs092/labs092_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs092/labs092_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4186", "# Continuous Variables": "N/A", "# Decision Variables": "4186", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "933660", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "913", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "284.050967", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs091", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.129078", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs091/labs091_summary.csv:1", "instance": "labs091", "instance_dir": "labs091", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs091/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs091/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs091/labs091_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs091/labs091_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4095", "# Continuous Variables": "N/A", "# Decision Variables": "4095", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "903150", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "829", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "86.388473", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs090", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.142236", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs090/labs090_summary.csv:1", "instance": "labs090", "instance_dir": "labs090", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs090/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs090/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs090/labs090_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs090/labs090_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "4005", "# Continuous Variables": "N/A", "# Decision Variables": "4005", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "873268", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "844", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "140.51479", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs089", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.116488", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs089/labs089_summary.csv:1", "instance": "labs089", "instance_dir": "labs089", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs089/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs089/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs089/labs089_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs089/labs089_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3916", "# Continuous Variables": "N/A", "# Decision Variables": "3916", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "844096", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "748", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "12.892984", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs088", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.141375", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs088/labs088_summary.csv:1", "instance": "labs088", "instance_dir": "labs088", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs088/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs088/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs088/labs088_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs088/labs088_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3828", "# Continuous Variables": "N/A", "# Decision Variables": "3828", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "815538", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "815", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "95.2573", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs087", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.090492", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs087/labs087_summary.csv:1", "instance": "labs087", "instance_dir": "labs087", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs087/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs087/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs087/labs087_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs087/labs087_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3741", "# Continuous Variables": "N/A", "# Decision Variables": "3741", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "787674", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "831", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "9.41495", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs086", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.101609", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs086/labs086_summary.csv:1", "instance": "labs086", "instance_dir": "labs086", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs086/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs086/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs086/labs086_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs086/labs086_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3655", "# Continuous Variables": "N/A", "# Decision Variables": "3655", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "760410", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "786", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "279.251565", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs085", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.099192", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs085/labs085_summary.csv:1", "instance": "labs085", "instance_dir": "labs085", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs085/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs085/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs085/labs085_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs085/labs085_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3570", "# Continuous Variables": "N/A", "# Decision Variables": "3570", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "733824", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "714", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "57.538767", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs084", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.08125", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs084/labs084_summary.csv:1", "instance": "labs084", "instance_dir": "labs084", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs084/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs084/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs084/labs084_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs084/labs084_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3486", "# Continuous Variables": "N/A", "# Decision Variables": "3486", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "707824", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "701", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "22.617988", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs083", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.084329", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs083/labs083_summary.csv:1", "instance": "labs083", "instance_dir": "labs083", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs083/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs083/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs083/labs083_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs083/labs083_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3403", "# Continuous Variables": "N/A", "# Decision Variables": "3403", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "682486", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "665", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "293.644487", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs082", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.096346", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs082/labs082_summary.csv:1", "instance": "labs082", "instance_dir": "labs082", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs082/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs082/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs082/labs082_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs082/labs082_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3321", "# Continuous Variables": "N/A", "# Decision Variables": "3321", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "657720", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "616", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "260.722254", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs081", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.080491", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs081/labs081_summary.csv:1", "instance": "labs081", "instance_dir": "labs081", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs081/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs081/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs081/labs081_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs081/labs081_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3240", "# Continuous Variables": "N/A", "# Decision Variables": "3240", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "633600", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "644", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "146.25282", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs080", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.091549", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs080/labs080_summary.csv:1", "instance": "labs080", "instance_dir": "labs080", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs080/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs080/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs080/labs080_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs080/labs080_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3160", "# Continuous Variables": "N/A", "# Decision Variables": "3160", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "610038", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "611", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "163.030499", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs079", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.088588", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs079/labs079_summary.csv:1", "instance": "labs079", "instance_dir": "labs079", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs079/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs079/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs079/labs079_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs079/labs079_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3081", "# Continuous Variables": "N/A", "# Decision Variables": "3081", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "587106", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "643", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "14.844018", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs078", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.085918", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs078/labs078_summary.csv:1", "instance": "labs078", "instance_dir": "labs078", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs078/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs078/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs078/labs078_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs078/labs078_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3003", "# Continuous Variables": "N/A", "# Decision Variables": "3003", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "564718", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "610", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "306.940279", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs077", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.07046", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs077/labs077_summary.csv:1", "instance": "labs077", "instance_dir": "labs077", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs077/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs077/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs077/labs077_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs077/labs077_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2926", "# Continuous Variables": "N/A", "# Decision Variables": "2926", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "542944", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "602", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "86.493849", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs076", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.05874", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs076/labs076_summary.csv:1", "instance": "labs076", "instance_dir": "labs076", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs076/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs076/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs076/labs076_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs076/labs076_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2850", "# Continuous Variables": "N/A", "# Decision Variables": "2850", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "521700", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "553", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "258.122409", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs075", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.062822", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs075/labs075_summary.csv:1", "instance": "labs075", "instance_dir": "labs075", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs075/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs075/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs075/labs075_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs075/labs075_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2775", "# Continuous Variables": "N/A", "# Decision Variables": "2775", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "501054", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "557", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "270.467249", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs074", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.070515", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs074/labs074_summary.csv:1", "instance": "labs074", "instance_dir": "labs074", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs074/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs074/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs074/labs074_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs074/labs074_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2701", "# Continuous Variables": "N/A", "# Decision Variables": "2701", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "480924", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "560", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "235.63552", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs073", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.074287", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs073/labs073_summary.csv:1", "instance": "labs073", "instance_dir": "labs073", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs073/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs073/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs073/labs073_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs073/labs073_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2628", "# Continuous Variables": "N/A", "# Decision Variables": "2628", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "461376", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "516", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "29.312282", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs072", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.063074", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs072/labs072_summary.csv:1", "instance": "labs072", "instance_dir": "labs072", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs072/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs072/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs072/labs072_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs072/labs072_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2556", "# Continuous Variables": "N/A", "# Decision Variables": "2556", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "442330", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "499", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "117.162905", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs071", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.064044", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs071/labs071_summary.csv:1", "instance": "labs071", "instance_dir": "labs071", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs071/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs071/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs071/labs071_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs071/labs071_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2485", "# Continuous Variables": "N/A", "# Decision Variables": "2485", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "423850", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "527", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "135.117366", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs070", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.055372", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs070/labs070_summary.csv:1", "instance": "labs070", "instance_dir": "labs070", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs070/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs070/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs070/labs070_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs070/labs070_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2415", "# Continuous Variables": "N/A", "# Decision Variables": "2415", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "405858", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "446", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "6.591714", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs069", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.065684", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs069/labs069_summary.csv:1", "instance": "labs069", "instance_dir": "labs069", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs069/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs069/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs069/labs069_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs069/labs069_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2346", "# Continuous Variables": "N/A", "# Decision Variables": "2346", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "388416", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "402", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "13.703416", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs068", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.063434", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs068/labs068_summary.csv:1", "instance": "labs068", "instance_dir": "labs068", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs068/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs068/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs068/labs068_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs068/labs068_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2278", "# Continuous Variables": "N/A", "# Decision Variables": "2278", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "371448", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "457", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "513.669032", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs067", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.053484", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs067/labs067_summary.csv:1", "instance": "labs067", "instance_dir": "labs067", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs067/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs067/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs067/labs067_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs067/labs067_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2211", "# Continuous Variables": "N/A", "# Decision Variables": "2211", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "355014", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "417", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "334.304943", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs066", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.049071", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs066/labs066_summary.csv:1", "instance": "labs066", "instance_dir": "labs066", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs066/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs066/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs066/labs066_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs066/labs066_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2145", "# Continuous Variables": "N/A", "# Decision Variables": "2145", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "339040", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "460", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "1.977506", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs065", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.046229", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs065/labs065_summary.csv:1", "instance": "labs065", "instance_dir": "labs065", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs065/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs065/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs065/labs065_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs065/labs065_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2080", "# Continuous Variables": "N/A", "# Decision Variables": "2080", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "323584", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "412", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "260.845851", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs064", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.033372", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs064/labs064_summary.csv:1", "instance": "labs064", "instance_dir": "labs064", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs064/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs064/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs064/labs064_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs064/labs064_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "2016", "# Continuous Variables": "N/A", "# Decision Variables": "2016", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "308574", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "387", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "22.91029", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs063", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.040333", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs063/labs063_summary.csv:1", "instance": "labs063", "instance_dir": "labs063", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs063/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs063/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs063/labs063_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs063/labs063_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1953", "# Continuous Variables": "N/A", "# Decision Variables": "1953", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "294066", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "379", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "35.931423", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs062", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.041961", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs062/labs062_summary.csv:1", "instance": "labs062", "instance_dir": "labs062", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs062/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs062/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs062/labs062_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs062/labs062_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1891", "# Continuous Variables": "N/A", "# Decision Variables": "1891", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "279990", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "346", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "157.00675", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs061", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.038152", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs061/labs061_summary.csv:1", "instance": "labs061", "instance_dir": "labs061", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs061/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs061/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs061/labs061_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs061/labs061_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1830", "# Continuous Variables": "N/A", "# Decision Variables": "1830", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "266400", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "366", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "8.849773", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs060", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.035827", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs060/labs060_summary.csv:1", "instance": "labs060", "instance_dir": "labs060", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs060/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs060/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs060/labs060_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs060/labs060_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1770", "# Continuous Variables": "N/A", "# Decision Variables": "1770", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "253228", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "333", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "158.063573", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs059", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.029999", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs059/labs059_summary.csv:1", "instance": "labs059", "instance_dir": "labs059", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs059/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs059/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs059/labs059_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs059/labs059_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1711", "# Continuous Variables": "N/A", "# Decision Variables": "1711", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "240526", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "317", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "4.213992", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs058", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.03032", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs058/labs058_summary.csv:1", "instance": "labs058", "instance_dir": "labs058", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs058/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs058/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs058/labs058_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs058/labs058_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1653", "# Continuous Variables": "N/A", "# Decision Variables": "1653", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "228228", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "320", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "6.505659", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs057", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.024312", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs057/labs057_summary.csv:1", "instance": "labs057", "instance_dir": "labs057", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs057/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs057/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs057/labs057_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs057/labs057_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1596", "# Continuous Variables": "N/A", "# Decision Variables": "1596", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "216384", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "276", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "35.628787", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs056", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.035261", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs056/labs056_summary.csv:1", "instance": "labs056", "instance_dir": "labs056", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs056/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs056/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs056/labs056_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs056/labs056_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1540", "# Continuous Variables": "N/A", "# Decision Variables": "1540", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "204930", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "283", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "18.7693", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs055", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.038619", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs055/labs055_summary.csv:1", "instance": "labs055", "instance_dir": "labs055", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs055/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs055/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs055/labs055_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs055/labs055_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1485", "# Continuous Variables": "N/A", "# Decision Variables": "1485", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "193914", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "255", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "127.921097", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs054", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.033765", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs054/labs054_summary.csv:1", "instance": "labs054", "instance_dir": "labs054", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs054/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs054/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs054/labs054_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs054/labs054_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1431", "# Continuous Variables": "N/A", "# Decision Variables": "1431", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "183274", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "270", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "32.274984", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs053", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.029794", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs053/labs053_summary.csv:1", "instance": "labs053", "instance_dir": "labs053", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs053/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs053/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs053/labs053_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs053/labs053_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1378", "# Continuous Variables": "N/A", "# Decision Variables": "1378", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "173056", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "254", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "337.424831", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs052", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.022491", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs052/labs052_summary.csv:1", "instance": "labs052", "instance_dir": "labs052", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs052/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs052/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs052/labs052_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs052/labs052_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1326", "# Continuous Variables": "N/A", "# Decision Variables": "1326", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "163200", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "265", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "71.268158", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs051", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.046953", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs051/labs051_summary.csv:1", "instance": "labs051", "instance_dir": "labs051", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs051/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs051/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs051/labs051_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs051/labs051_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1275", "# Continuous Variables": "N/A", "# Decision Variables": "1275", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "153750", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "265", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "8.024845", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs050", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.046166", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs050/labs050_summary.csv:1", "instance": "labs050", "instance_dir": "labs050", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs050/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs050/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs050/labs050_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs050/labs050_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1225", "# Continuous Variables": "N/A", "# Decision Variables": "1225", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "144648", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "216", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "291.05654", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs049", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.033916", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs049/labs049_summary.csv:1", "instance": "labs049", "instance_dir": "labs049", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs049/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs049/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs049/labs049_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs049/labs049_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1176", "# Continuous Variables": "N/A", "# Decision Variables": "1176", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "135936", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "196", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "1.465677", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs048", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.038131", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs048/labs048_summary.csv:1", "instance": "labs048", "instance_dir": "labs048", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs048/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs048/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs048/labs048_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs048/labs048_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1128", "# Continuous Variables": "N/A", "# Decision Variables": "1128", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "127558", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "219", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "37.9926", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs047", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.032261", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs047/labs047_summary.csv:1", "instance": "labs047", "instance_dir": "labs047", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs047/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs047/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs047/labs047_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs047/labs047_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1081", "# Continuous Variables": "N/A", "# Decision Variables": "1081", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "119554", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "203", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "335.905088", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs046", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.036122", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs046/labs046_summary.csv:1", "instance": "labs046", "instance_dir": "labs046", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs046/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs046/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs046/labs046_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs046/labs046_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "1035", "# Continuous Variables": "N/A", "# Decision Variables": "1035", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "111870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "182", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "64.259616", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs045", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.03801", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs045/labs045_summary.csv:1", "instance": "labs045", "instance_dir": "labs045", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs045/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs045/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs045/labs045_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs045/labs045_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "990", "# Continuous Variables": "N/A", "# Decision Variables": "990", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "104544", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "166", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "33.31879", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs044", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.027297", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs044/labs044_summary.csv:1", "instance": "labs044", "instance_dir": "labs044", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs044/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs044/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs044/labs044_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs044/labs044_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "946", "# Continuous Variables": "N/A", "# Decision Variables": "946", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "97524", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "169", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "17.712615", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs043", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.023016", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs043/labs043_summary.csv:1", "instance": "labs043", "instance_dir": "labs043", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs043/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs043/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs043/labs043_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs043/labs043_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "903", "# Continuous Variables": "N/A", "# Decision Variables": "903", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "90846", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "149", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "4.00141", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs042", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.02493", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs042/labs042_summary.csv:1", "instance": "labs042", "instance_dir": "labs042", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs042/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs042/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs042/labs042_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs042/labs042_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "861", "# Continuous Variables": "N/A", "# Decision Variables": "861", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "84460", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "152", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "365.923547", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs041", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.028264", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs041/labs041_summary.csv:1", "instance": "labs041", "instance_dir": "labs041", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs041/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs041/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs041/labs041_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs041/labs041_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "820", "# Continuous Variables": "N/A", "# Decision Variables": "820", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "78400", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "136", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "546.347755", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs040", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.014499", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs040/labs040_summary.csv:1", "instance": "labs040", "instance_dir": "labs040", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs040/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs040/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs040/labs040_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs040/labs040_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "780", "# Continuous Variables": "N/A", "# Decision Variables": "780", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "72618", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "131", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.311952", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs039", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.033206", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs039/labs039_summary.csv:1", "instance": "labs039", "instance_dir": "labs039", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs039/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs039/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs039/labs039_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs039/labs039_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "741", "# Continuous Variables": "N/A", "# Decision Variables": "741", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "67146", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "127", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "95.231843", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs038", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.016813", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs038/labs038_summary.csv:1", "instance": "labs038", "instance_dir": "labs038", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs038/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs038/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs038/labs038_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs038/labs038_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "703", "# Continuous Variables": "N/A", "# Decision Variables": "703", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "61938", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "106", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "121.826975", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs037", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.028526", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs037/labs037_summary.csv:1", "instance": "labs037", "instance_dir": "labs037", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs037/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs037/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs037/labs037_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs037/labs037_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "666", "# Continuous Variables": "N/A", "# Decision Variables": "666", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "57024", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "98", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "32.02112", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs036", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.032561", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs036/labs036_summary.csv:1", "instance": "labs036", "instance_dir": "labs036", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs036/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs036/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs036/labs036_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs036/labs036_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "630", "# Continuous Variables": "N/A", "# Decision Variables": "630", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "52360", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "85", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "133.906331", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs035", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.042891", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs035/labs035_summary.csv:1", "instance": "labs035", "instance_dir": "labs035", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs035/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs035/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs035/labs035_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs035/labs035_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "595", "# Continuous Variables": "N/A", "# Decision Variables": "595", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "47974", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "89", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "101.46888", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs034", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.042606", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs034/labs034_summary.csv:1", "instance": "labs034", "instance_dir": "labs034", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs034/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs034/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs034/labs034_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs034/labs034_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "561", "# Continuous Variables": "N/A", "# Decision Variables": "561", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "43824", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "80", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "574.907529", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs033", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.026566", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs033/labs033_summary.csv:1", "instance": "labs033", "instance_dir": "labs033", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs033/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs033/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs033/labs033_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs033/labs033_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "528", "# Continuous Variables": "N/A", "# Decision Variables": "528", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "39936", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "72", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "247.883211", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs032", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.038312", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs032/labs032_summary.csv:1", "instance": "labs032", "instance_dir": "labs032", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs032/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs032/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs032/labs032_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs032/labs032_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "496", "# Continuous Variables": "N/A", "# Decision Variables": "496", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "36270", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "71", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "303.305631", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs031", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.032277", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs031/labs031_summary.csv:1", "instance": "labs031", "instance_dir": "labs031", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs031/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs031/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs031/labs031_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs031/labs031_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "465", "# Continuous Variables": "N/A", "# Decision Variables": "465", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "32850", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "59", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "592.675466", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs030", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "592.741499", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs030/labs030_summary.csv:1", "instance": "labs030", "instance_dir": "labs030", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs030/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs030/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs030/labs030_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs030/labs030_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "435", "# Continuous Variables": "N/A", "# Decision Variables": "435", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "29638", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "66", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "190.399829", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs029", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.026511", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs029/labs029_summary.csv:1", "instance": "labs029", "instance_dir": "labs029", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs029/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs029/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs029/labs029_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs029/labs029_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "406", "# Continuous Variables": "N/A", "# Decision Variables": "406", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "26656", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "62", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "165.657854", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs028", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.030636", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs028/labs028_summary.csv:1", "instance": "labs028", "instance_dir": "labs028", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs028/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs028/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs028/labs028_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs028/labs028_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "378", "# Continuous Variables": "N/A", "# Decision Variables": "378", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "23868", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "53", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "164.504365", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs027", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.036593", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs027/labs027_summary.csv:1", "instance": "labs027", "instance_dir": "labs027", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs027/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs027/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs027/labs027_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs027/labs027_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "351", "# Continuous Variables": "N/A", "# Decision Variables": "351", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "21294", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "45", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "1.218434", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs026", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "1.331118", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs026/labs026_summary.csv:1", "instance": "labs026", "instance_dir": "labs026", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs026/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs026/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs026/labs026_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs026/labs026_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "325", "# Continuous Variables": "N/A", "# Decision Variables": "325", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "18900", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "36", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "239.51381", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs025", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "239.586121", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs025/labs025_summary.csv:1", "instance": "labs025", "instance_dir": "labs025", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs025/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs025/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs025/labs025_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs025/labs025_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "300", "# Continuous Variables": "N/A", "# Decision Variables": "300", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "16704", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "36", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "6.034385", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs024", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "6.124976", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs024/labs024_summary.csv:1", "instance": "labs024", "instance_dir": "labs024", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs024/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs024/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs024/labs024_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs024/labs024_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "276", "# Continuous Variables": "N/A", "# Decision Variables": "276", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "14674", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "47", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "2.707823", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs023", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "2.856399", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs023/labs023_summary.csv:1", "instance": "labs023", "instance_dir": "labs023", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs023/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs023/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs023/labs023_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs023/labs023_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "253", "# Continuous Variables": "N/A", "# Decision Variables": "253", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "12826", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "39", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.245257", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs022", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.326647", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs022/labs022_summary.csv:1", "instance": "labs022", "instance_dir": "labs022", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs022/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs022/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs022/labs022_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs022/labs022_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "231", "# Continuous Variables": "N/A", "# Decision Variables": "231", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "11130", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "26", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "14.054428", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs021", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "14.194171", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs021/labs021_summary.csv:1", "instance": "labs021", "instance_dir": "labs021", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs021/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs021/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs021/labs021_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs021/labs021_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "210", "# Continuous Variables": "N/A", "# Decision Variables": "210", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "9600", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "26", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "7.835537", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs020", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7.998091", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs020/labs020_summary.csv:1", "instance": "labs020", "instance_dir": "labs020", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs020/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs020/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs020/labs020_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs020/labs020_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "190", "# Continuous Variables": "N/A", "# Decision Variables": "190", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "8208", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "29", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "1.284276", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs019", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "1.423615", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs019/labs019_summary.csv:1", "instance": "labs019", "instance_dir": "labs019", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs019/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs019/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs019/labs019_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs019/labs019_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "171", "# Continuous Variables": "N/A", "# Decision Variables": "171", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "6966", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "25", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.016097", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs018", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.09804", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs018/labs018_summary.csv:1", "instance": "labs018", "instance_dir": "labs018", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs018/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs018/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs018/labs018_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs018/labs018_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "153", "# Continuous Variables": "N/A", "# Decision Variables": "153", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "5848", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "32", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.036123", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs017", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.233442", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs017/labs017_summary.csv:1", "instance": "labs017", "instance_dir": "labs017", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs017/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs017/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs017/labs017_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs017/labs017_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "136", "# Continuous Variables": "N/A", "# Decision Variables": "136", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "4864", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "24", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.006879", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs016", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.149242", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs016/labs016_summary.csv:1", "instance": "labs016", "instance_dir": "labs016", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs016/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs016/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs016/labs016_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs016/labs016_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "120", "# Continuous Variables": "N/A", "# Decision Variables": "120", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3990", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "15", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.161098", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs015", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.419585", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs015/labs015_summary.csv:1", "instance": "labs015", "instance_dir": "labs015", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs015/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs015/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs015/labs015_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs015/labs015_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "105", "# Continuous Variables": "N/A", "# Decision Variables": "105", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3234", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "19", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000595", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs014", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.134173", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs014/labs014_summary.csv:1", "instance": "labs014", "instance_dir": "labs014", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs014/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs014/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs014/labs014_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs014/labs014_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "91", "# Continuous Variables": "N/A", "# Decision Variables": "91", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2574", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.016254", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs013", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.164782", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs013/labs013_summary.csv:1", "instance": "labs013", "instance_dir": "labs013", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs013/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs013/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs013/labs013_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs013/labs013_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "78", "# Continuous Variables": "N/A", "# Decision Variables": "78", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2016", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.004224", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs012", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.170356", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs012/labs012_summary.csv:1", "instance": "labs012", "instance_dir": "labs012", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs012/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs012/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs012/labs012_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs012/labs012_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "66", "# Continuous Variables": "N/A", "# Decision Variables": "66", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1540", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.009849", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs011", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.190839", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs011/labs011_summary.csv:1", "instance": "labs011", "instance_dir": "labs011", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs011/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs011/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs011/labs011_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs011/labs011_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "55", "# Continuous Variables": "N/A", "# Decision Variables": "55", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1150", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000681", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs010", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.209115", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs010/labs010_summary.csv:1", "instance": "labs010", "instance_dir": "labs010", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs010/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs010/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs010/labs010_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs010/labs010_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "45", "# Continuous Variables": "N/A", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "828", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.00073", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs009", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.264882", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs009/labs009_summary.csv:1", "instance": "labs009", "instance_dir": "labs009", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs009/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs009/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs009/labs009_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs009/labs009_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "36", "# Continuous Variables": "N/A", "# Decision Variables": "36", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "576", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "8", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000354", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs008", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.271149", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs008/labs008_summary.csv:1", "instance": "labs008", "instance_dir": "labs008", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs008/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs008/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs008/labs008_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs008/labs008_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "28", "# Continuous Variables": "N/A", "# Decision Variables": "28", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "378", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000148", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs007", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.382743", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs007/labs007_summary.csv:1", "instance": "labs007", "instance_dir": "labs007", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs007/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs007/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs007/labs007_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs007/labs007_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "21", "# Continuous Variables": "N/A", "# Decision Variables": "21", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "234", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "7", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000135", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs006", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.367144", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs006/labs006_summary.csv:1", "instance": "labs006", "instance_dir": "labs006", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs006/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs006/labs006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs006/labs006_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "15", "# Continuous Variables": "N/A", "# Decision Variables": "15", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "130", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000104", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs005", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.388686", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs005/labs005_summary.csv:1", "instance": "labs005", "instance_dir": "labs005", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs005/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs005/labs005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs005/labs005_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "10", "# Continuous Variables": "N/A", "# Decision Variables": "10", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "64", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.000124", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs004", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.388622", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs004/labs004_summary.csv:1", "instance": "labs004", "instance_dir": "labs004", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs004/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs004/labs004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs004/labs004_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "6", "# Continuous Variables": "N/A", "# Decision Variables": "6", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "24", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "8.9e-05", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs003", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.373337", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs003/labs003_summary.csv:1", "instance": "labs003", "instance_dir": "labs003", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs003/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs003/labs003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs003/labs003_summary.csv" }, { "date_key": "2025-02-21T00:00:00", "fields": { "# Binary Variables": "3", "# Continuous Variables": "N/A", "# Decision Variables": "3", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "6", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "21. Feb. 2025", "GPU Runtime": "0.0", "Hardware Specifications": "Two NVIDIA A100-SXM4-80GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "labs002", "QPU Runtime": "N/A", "Reference": "See Models Directory (UQO) using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.371176", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "02-labs/submissions/20250221_Abs2_Schicker/labs002/labs002_summary.csv:1", "instance": "labs002", "instance_dir": "labs002", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/labs002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs002/README.md", "submission_set": "20250221_Abs2_Schicker", "summary_csv": "02-labs/submissions/20250221_Abs2_Schicker/labs002/labs002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/labs002/labs002_summary.csv" }, { "date_key": "2025-01-15T00:00:00", "fields": { "# Binary Variables": "17", "# Continuous Variables": "N/A", "# Decision Variables": "17", "# Feasible Runs": "5", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "108", "# Runs": "5", "# Successful Runs": "5", "Algorithm Type": "Stochastic", "Best Objective Value": "4", "CPU Runtime": "27", "Coefficients Range": "<0-1>", "Coefficients Type": "Continuous", "Date": "15. Jan. 2025", "GPU Runtime": "N/A", "Hardware Specifications": "ThinkPad laptop and IBM Quantum device ibm_fez.", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "mammalia-kangaroo-interactions", "QPU Runtime": "60", "Reference": "See https://github.com/eggerdj/independent_set_benchmarking", "Remarks": "Runtime is in seconds and QPU runtime includes payload compilation and execution.", "Submitter": "Daniel Egger", "Success Threshold": "0", "Total Runtime": "87", "Workflow": "1) The parameters \u03b2 and \u03b3 of the depth-one QAOA and the Lagrange multiplier are optimized classically. 2) Samples are drawn from the QPU. 3) Samples from the QPU are classically post-processed. Therefore each run can provide multiple solutions." }, "id": "07-independentset/submissions/20250115_QAOA_Egger/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv:1", "instance": "mammalia-kangaroo-interactions", "instance_dir": "mammalia-kangaroo-interactions", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250115_QAOA_Egger/mammalia-kangaroo-interactions/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger/mammalia-kangaroo-interactions/README.md", "submission_set": "20250115_QAOA_Egger", "summary_csv": "07-independentset/submissions/20250115_QAOA_Egger/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger/mammalia-kangaroo-interactions/mammalia-kangaroo-interactions_summary.csv" }, { "date_key": "2025-01-15T00:00:00", "fields": { "# Binary Variables": "52", "# Continuous Variables": "N/A", "# Decision Variables": "52", "# Feasible Runs": "5", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "506", "# Runs": "5", "# Successful Runs": "5", "Algorithm Type": "Stochastic", "Best Objective Value": "13", "CPU Runtime": "192", "Coefficients Range": "<0-1>", "Coefficients Type": "Continuous", "Date": "15. Jan. 2025", "GPU Runtime": "N/A", "Hardware Specifications": "ThinkPad laptop and IBM Quantum device ibm_fez.", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "aves-sparrow-social", "QPU Runtime": "60", "Reference": "See https://github.com/eggerdj/independent_set_benchmarking", "Remarks": "Runtime is in seconds and QPU runtime includes payload compilation and execution.", "Submitter": "Daniel Egger", "Success Threshold": "0", "Total Runtime": "252", "Workflow": "1) The parameters \u03b2 and \u03b3 of the depth-one QAOA and the Lagrange multiplier are optimized classically. 2) Samples are drawn from the QPU. 3) Samples from the QPU are classically post-processed. Therefore each run can provide multiple solutions." }, "id": "07-independentset/submissions/20250115_QAOA_Egger/aves-sparrow-social/aves-sparrow-social_summary.csv:1", "instance": "aves-sparrow-social", "instance_dir": "aves-sparrow-social", "problem_dir": "07-independentset", "problem_number": "07", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250115_QAOA_Egger/aves-sparrow-social/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger/aves-sparrow-social/README.md", "submission_set": "20250115_QAOA_Egger", "summary_csv": "07-independentset/submissions/20250115_QAOA_Egger/aves-sparrow-social/aves-sparrow-social_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger/aves-sparrow-social/aves-sparrow-social_summary.csv" }, { "date_key": "2024-12-29T08:02:58", "fields": { "# Binary Variables": "5049", "# Continuous Variables": "0", "# Decision Variables": "5148", "# Feasible Runs": "1", "# Integer Variables": "99", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1902.0", "CPU Runtime": "6723.28", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 08:02:58", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs100", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.19", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs100/labs100_summary.csv:1", "instance": "labs100", "instance_dir": "labs100", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs100/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs100/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs100/labs100_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs100/labs100_summary.csv" }, { "date_key": "2024-12-29T07:35:22", "fields": { "# Binary Variables": "4949", "# Continuous Variables": "0", "# Decision Variables": "5047", "# Feasible Runs": "1", "# Integer Variables": "98", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1797.0", "CPU Runtime": "6021.52", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 07:35:22", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "2.545979869121e-17", "Other HW Runtime": "N/A", "Problem": "labs099", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs099/labs099_summary.csv:1", "instance": "labs099", "instance_dir": "labs099", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs099/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs099/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs099/labs099_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs099/labs099_summary.csv" }, { "date_key": "2024-12-29T06:55:26", "fields": { "# Binary Variables": "4850", "# Continuous Variables": "0", "# Decision Variables": "4947", "# Feasible Runs": "1", "# Integer Variables": "97", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1585.0", "CPU Runtime": "6489.65", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:55:26", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs098", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs098/labs098_summary.csv:1", "instance": "labs098", "instance_dir": "labs098", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs098/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs098/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs098/labs098_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs098/labs098_summary.csv" }, { "date_key": "2024-12-29T06:36:24", "fields": { "# Binary Variables": "4752", "# Continuous Variables": "0", "# Decision Variables": "4848", "# Feasible Runs": "1", "# Integer Variables": "96", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1588.0", "CPU Runtime": "6269.86", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:36:24", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs097", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs097/labs097_summary.csv:1", "instance": "labs097", "instance_dir": "labs097", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs097/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs097/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs097/labs097_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs097/labs097_summary.csv" }, { "date_key": "2024-12-29T06:15:25", "fields": { "# Binary Variables": "4655", "# Continuous Variables": "0", "# Decision Variables": "4750", "# Feasible Runs": "1", "# Integer Variables": "95", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1504.0", "CPU Runtime": "6481.87", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:15:25", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs096", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs096/labs096_summary.csv:1", "instance": "labs096", "instance_dir": "labs096", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs096/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs096/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs096/labs096_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs096/labs096_summary.csv" }, { "date_key": "2024-12-29T06:15:22", "fields": { "# Binary Variables": "4559", "# Continuous Variables": "0", "# Decision Variables": "4653", "# Feasible Runs": "1", "# Integer Variables": "94", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1103.0", "CPU Runtime": "6878.34", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:15:22", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "4.782031036326e-12", "Other HW Runtime": "N/A", "Problem": "labs095", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs095/labs095_summary.csv:1", "instance": "labs095", "instance_dir": "labs095", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs095/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs095/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs095/labs095_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs095/labs095_summary.csv" }, { "date_key": "2024-12-29T06:11:21", "fields": { "# Binary Variables": "4464", "# Continuous Variables": "0", "# Decision Variables": "4557", "# Feasible Runs": "1", "# Integer Variables": "93", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1003.0", "CPU Runtime": "7058.98", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:11:21", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs094", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs094/labs094_summary.csv:1", "instance": "labs094", "instance_dir": "labs094", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs094/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs094/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs094/labs094_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs094/labs094_summary.csv" }, { "date_key": "2024-12-29T06:08:52", "fields": { "# Binary Variables": "4370", "# Continuous Variables": "0", "# Decision Variables": "4462", "# Feasible Runs": "1", "# Integer Variables": "92", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1082.0", "CPU Runtime": "6974.52", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:08:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs093", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs093/labs093_summary.csv:1", "instance": "labs093", "instance_dir": "labs093", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs093/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs093/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs093/labs093_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs093/labs093_summary.csv" }, { "date_key": "2024-12-29T06:06:53", "fields": { "# Binary Variables": "4277", "# Continuous Variables": "0", "# Decision Variables": "4368", "# Feasible Runs": "1", "# Integer Variables": "91", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1010.0", "CPU Runtime": "7186.05", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:06:53", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs092", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs092/labs092_summary.csv:1", "instance": "labs092", "instance_dir": "labs092", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs092/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs092/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs092/labs092_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs092/labs092_summary.csv" }, { "date_key": "2024-12-29T06:02:56", "fields": { "# Binary Variables": "4185", "# Continuous Variables": "0", "# Decision Variables": "4275", "# Feasible Runs": "1", "# Integer Variables": "90", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1025.0", "CPU Runtime": "6594.56", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 06:02:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs091", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs091/labs091_summary.csv:1", "instance": "labs091", "instance_dir": "labs091", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs091/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs091/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs091/labs091_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs091/labs091_summary.csv" }, { "date_key": "2024-12-29T05:35:21", "fields": { "# Binary Variables": "4094", "# Continuous Variables": "0", "# Decision Variables": "4183", "# Feasible Runs": "1", "# Integer Variables": "89", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1037.0", "CPU Runtime": "7488.8", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 05:35:21", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "3.561241622089e-16", "Other HW Runtime": "N/A", "Problem": "labs090", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs090/labs090_summary.csv:1", "instance": "labs090", "instance_dir": "labs090", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs090/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs090/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs090/labs090_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs090/labs090_summary.csv" }, { "date_key": "2024-12-29T04:55:24", "fields": { "# Binary Variables": "4004", "# Continuous Variables": "0", "# Decision Variables": "4092", "# Feasible Runs": "1", "# Integer Variables": "88", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1080.0", "CPU Runtime": "8480.73", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:55:24", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs089", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs089/labs089_summary.csv:1", "instance": "labs089", "instance_dir": "labs089", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs089/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs089/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs089/labs089_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs089/labs089_summary.csv" }, { "date_key": "2024-12-29T04:36:23", "fields": { "# Binary Variables": "3915", "# Continuous Variables": "0", "# Decision Variables": "4002", "# Feasible Runs": "1", "# Integer Variables": "87", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "960.0", "CPU Runtime": "7308.64", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:36:23", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "1.043053311908e-16", "Other HW Runtime": "N/A", "Problem": "labs088", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.12", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs088/labs088_summary.csv:1", "instance": "labs088", "instance_dir": "labs088", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs088/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs088/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs088/labs088_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs088/labs088_summary.csv" }, { "date_key": "2024-12-29T04:15:24", "fields": { "# Binary Variables": "3827", "# Continuous Variables": "0", "# Decision Variables": "3913", "# Feasible Runs": "1", "# Integer Variables": "86", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "863.0", "CPU Runtime": "8242.11", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:15:24", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs087", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs087/labs087_summary.csv:1", "instance": "labs087", "instance_dir": "labs087", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs087/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs087/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs087/labs087_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs087/labs087_summary.csv" }, { "date_key": "2024-12-29T04:15:21", "fields": { "# Binary Variables": "3740", "# Continuous Variables": "0", "# Decision Variables": "3825", "# Feasible Runs": "1", "# Integer Variables": "85", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "887.0", "CPU Runtime": "9148.75", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:15:21", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs086", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs086/labs086_summary.csv:1", "instance": "labs086", "instance_dir": "labs086", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs086/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs086/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs086/labs086_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs086/labs086_summary.csv" }, { "date_key": "2024-12-29T04:11:20", "fields": { "# Binary Variables": "3654", "# Continuous Variables": "0", "# Decision Variables": "3738", "# Feasible Runs": "1", "# Integer Variables": "84", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "862.0", "CPU Runtime": "6407.47", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:11:20", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs085", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs085/labs085_summary.csv:1", "instance": "labs085", "instance_dir": "labs085", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs085/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs085/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs085/labs085_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs085/labs085_summary.csv" }, { "date_key": "2024-12-29T04:08:50", "fields": { "# Binary Variables": "3569", "# Continuous Variables": "0", "# Decision Variables": "3652", "# Feasible Runs": "1", "# Integer Variables": "83", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "914.0", "CPU Runtime": "7285.64", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:08:50", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs084", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.09", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs084/labs084_summary.csv:1", "instance": "labs084", "instance_dir": "labs084", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs084/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs084/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs084/labs084_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs084/labs084_summary.csv" }, { "date_key": "2024-12-29T04:06:50", "fields": { "# Binary Variables": "3485", "# Continuous Variables": "0", "# Decision Variables": "3567", "# Feasible Runs": "1", "# Integer Variables": "82", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "749.0", "CPU Runtime": "7946.62", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:06:50", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs083", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs083/labs083_summary.csv:1", "instance": "labs083", "instance_dir": "labs083", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs083/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs083/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs083/labs083_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs083/labs083_summary.csv" }, { "date_key": "2024-12-29T04:02:52", "fields": { "# Binary Variables": "3402", "# Continuous Variables": "0", "# Decision Variables": "3483", "# Feasible Runs": "1", "# Integer Variables": "81", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "809.0", "CPU Runtime": "8191.89", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 04:02:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "1.768357949937e-15", "Other HW Runtime": "N/A", "Problem": "labs082", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.09", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs082/labs082_summary.csv:1", "instance": "labs082", "instance_dir": "labs082", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs082/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs082/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs082/labs082_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs082/labs082_summary.csv" }, { "date_key": "2024-12-29T03:35:18", "fields": { "# Binary Variables": "3320", "# Continuous Variables": "0", "# Decision Variables": "3400", "# Feasible Runs": "1", "# Integer Variables": "80", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "840.0", "CPU Runtime": "7383.05", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 03:35:18", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "5.984349645461e-16", "Other HW Runtime": "N/A", "Problem": "labs081", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs081/labs081_summary.csv:1", "instance": "labs081", "instance_dir": "labs081", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs081/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs081/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs081/labs081_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs081/labs081_summary.csv" }, { "date_key": "2024-12-29T02:55:22", "fields": { "# Binary Variables": "3239", "# Continuous Variables": "0", "# Decision Variables": "3318", "# Feasible Runs": "1", "# Integer Variables": "79", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "672.0", "CPU Runtime": "6995.52", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:55:22", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs080", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.09", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs080/labs080_summary.csv:1", "instance": "labs080", "instance_dir": "labs080", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs080/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs080/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs080/labs080_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs080/labs080_summary.csv" }, { "date_key": "2024-12-29T02:36:20", "fields": { "# Binary Variables": "3159", "# Continuous Variables": "0", "# Decision Variables": "3237", "# Feasible Runs": "1", "# Integer Variables": "78", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "671.0", "CPU Runtime": "7067.38", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:36:20", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "2.100871996273e-17", "Other HW Runtime": "N/A", "Problem": "labs079", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs079/labs079_summary.csv:1", "instance": "labs079", "instance_dir": "labs079", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs079/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs079/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs079/labs079_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs079/labs079_summary.csv" }, { "date_key": "2024-12-29T02:15:18", "fields": { "# Binary Variables": "3080", "# Continuous Variables": "0", "# Decision Variables": "3157", "# Feasible Runs": "1", "# Integer Variables": "77", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "755.0", "CPU Runtime": "6942.42", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:15:18", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs078", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs078/labs078_summary.csv:1", "instance": "labs078", "instance_dir": "labs078", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs078/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs078/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs078/labs078_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs078/labs078_summary.csv" }, { "date_key": "2024-12-29T02:15:18", "fields": { "# Binary Variables": "3002", "# Continuous Variables": "0", "# Decision Variables": "3078", "# Feasible Runs": "1", "# Integer Variables": "76", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "654.0", "CPU Runtime": "7975.35", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:15:18", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs077", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs077/labs077_summary.csv:1", "instance": "labs077", "instance_dir": "labs077", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs077/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs077/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs077/labs077_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs077/labs077_summary.csv" }, { "date_key": "2024-12-29T02:11:18", "fields": { "# Binary Variables": "2925", "# Continuous Variables": "0", "# Decision Variables": "3000", "# Feasible Runs": "1", "# Integer Variables": "75", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "566.0", "CPU Runtime": "7439.9", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:11:18", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs076", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs076/labs076_summary.csv:1", "instance": "labs076", "instance_dir": "labs076", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs076/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs076/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs076/labs076_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs076/labs076_summary.csv" }, { "date_key": "2024-12-29T02:08:47", "fields": { "# Binary Variables": "2849", "# Continuous Variables": "0", "# Decision Variables": "2923", "# Feasible Runs": "1", "# Integer Variables": "74", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "585.0", "CPU Runtime": "7381.55", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:08:47", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs075", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs075/labs075_summary.csv:1", "instance": "labs075", "instance_dir": "labs075", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs075/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs075/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs075/labs075_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs075/labs075_summary.csv" }, { "date_key": "2024-12-29T02:06:47", "fields": { "# Binary Variables": "2774", "# Continuous Variables": "0", "# Decision Variables": "2847", "# Feasible Runs": "1", "# Integer Variables": "73", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "637.0", "CPU Runtime": "8998.59", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:06:47", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs074", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs074/labs074_summary.csv:1", "instance": "labs074", "instance_dir": "labs074", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs074/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs074/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs074/labs074_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs074/labs074_summary.csv" }, { "date_key": "2024-12-29T02:02:47", "fields": { "# Binary Variables": "2700", "# Continuous Variables": "0", "# Decision Variables": "2772", "# Feasible Runs": "1", "# Integer Variables": "72", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "548.0", "CPU Runtime": "8327.83", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 02:02:47", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs073", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.62", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs073/labs073_summary.csv:1", "instance": "labs073", "instance_dir": "labs073", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs073/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs073/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs073/labs073_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs073/labs073_summary.csv" }, { "date_key": "2024-12-29T01:35:14", "fields": { "# Binary Variables": "2627", "# Continuous Variables": "0", "# Decision Variables": "2698", "# Feasible Runs": "1", "# Integer Variables": "71", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "492.0", "CPU Runtime": "7595.21", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 01:35:14", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs072", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs072/labs072_summary.csv:1", "instance": "labs072", "instance_dir": "labs072", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs072/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs072/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs072/labs072_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs072/labs072_summary.csv" }, { "date_key": "2024-12-29T00:55:09", "fields": { "# Binary Variables": "2555", "# Continuous Variables": "0", "# Decision Variables": "2625", "# Feasible Runs": "1", "# Integer Variables": "70", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "547.0", "CPU Runtime": "7743.66", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:55:09", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs071", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs071/labs071_summary.csv:1", "instance": "labs071", "instance_dir": "labs071", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs071/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs071/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs071/labs071_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs071/labs071_summary.csv" }, { "date_key": "2024-12-29T00:36:06", "fields": { "# Binary Variables": "2484", "# Continuous Variables": "0", "# Decision Variables": "2553", "# Feasible Runs": "1", "# Integer Variables": "69", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "543.0", "CPU Runtime": "7027.83", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:36:06", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs070", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.18", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs070/labs070_summary.csv:1", "instance": "labs070", "instance_dir": "labs070", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs070/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs070/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs070/labs070_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs070/labs070_summary.csv" }, { "date_key": "2024-12-29T00:15:02", "fields": { "# Binary Variables": "2414", "# Continuous Variables": "0", "# Decision Variables": "2482", "# Feasible Runs": "1", "# Integer Variables": "68", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "538.0", "CPU Runtime": "7211.34", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:15:02", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs069", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs069/labs069_summary.csv:1", "instance": "labs069", "instance_dir": "labs069", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs069/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs069/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs069/labs069_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs069/labs069_summary.csv" }, { "date_key": "2024-12-29T00:14:57", "fields": { "# Binary Variables": "2345", "# Continuous Variables": "0", "# Decision Variables": "2412", "# Feasible Runs": "1", "# Integer Variables": "67", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "514.0", "CPU Runtime": "7843.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:14:57", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs068", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs068/labs068_summary.csv:1", "instance": "labs068", "instance_dir": "labs068", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs068/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs068/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs068/labs068_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs068/labs068_summary.csv" }, { "date_key": "2024-12-29T00:10:56", "fields": { "# Binary Variables": "2277", "# Continuous Variables": "0", "# Decision Variables": "2343", "# Feasible Runs": "1", "# Integer Variables": "66", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "465.0", "CPU Runtime": "7421.7", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:10:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs067", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs067/labs067_summary.csv:1", "instance": "labs067", "instance_dir": "labs067", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs067/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs067/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs067/labs067_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs067/labs067_summary.csv" }, { "date_key": "2024-12-29T00:08:31", "fields": { "# Binary Variables": "2210", "# Continuous Variables": "0", "# Decision Variables": "2275", "# Feasible Runs": "1", "# Integer Variables": "65", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "481.0", "CPU Runtime": "7702.69", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:08:31", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "3.973351775654e-15", "Other HW Runtime": "N/A", "Problem": "labs066", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs066/labs066_summary.csv:1", "instance": "labs066", "instance_dir": "labs066", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs066/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs066/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs066/labs066_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs066/labs066_summary.csv" }, { "date_key": "2024-12-29T00:06:31", "fields": { "# Binary Variables": "2144", "# Continuous Variables": "0", "# Decision Variables": "2208", "# Feasible Runs": "1", "# Integer Variables": "64", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "368.0", "CPU Runtime": "7656.82", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:06:31", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs065", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs065/labs065_summary.csv:1", "instance": "labs065", "instance_dir": "labs065", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs065/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs065/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs065/labs065_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs065/labs065_summary.csv" }, { "date_key": "2024-12-29T00:02:30", "fields": { "# Binary Variables": "2079", "# Continuous Variables": "0", "# Decision Variables": "2142", "# Feasible Runs": "1", "# Integer Variables": "63", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "424.0", "CPU Runtime": "7679.16", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-29 00:02:30", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs064", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs064/labs064_summary.csv:1", "instance": "labs064", "instance_dir": "labs064", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs064/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs064/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs064/labs064_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs064/labs064_summary.csv" }, { "date_key": "2024-12-28T23:34:55", "fields": { "# Binary Variables": "2015", "# Continuous Variables": "0", "# Decision Variables": "2077", "# Feasible Runs": "1", "# Integer Variables": "62", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "419.0", "CPU Runtime": "7404.54", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 23:34:55", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs063", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs063/labs063_summary.csv:1", "instance": "labs063", "instance_dir": "labs063", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs063/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs063/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs063/labs063_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs063/labs063_summary.csv" }, { "date_key": "2024-12-28T22:54:57", "fields": { "# Binary Variables": "1952", "# Continuous Variables": "0", "# Decision Variables": "2013", "# Feasible Runs": "1", "# Integer Variables": "61", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "379.0", "CPU Runtime": "7602.31", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:54:57", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs062", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs062/labs062_summary.csv:1", "instance": "labs062", "instance_dir": "labs062", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs062/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs062/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs062/labs062_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs062/labs062_summary.csv" }, { "date_key": "2024-12-28T22:35:56", "fields": { "# Binary Variables": "1890", "# Continuous Variables": "0", "# Decision Variables": "1950", "# Feasible Runs": "1", "# Integer Variables": "60", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "374.0", "CPU Runtime": "7190.01", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:35:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs061", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs061/labs061_summary.csv:1", "instance": "labs061", "instance_dir": "labs061", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs061/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs061/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs061/labs061_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs061/labs061_summary.csv" }, { "date_key": "2024-12-28T22:14:56", "fields": { "# Binary Variables": "1829", "# Continuous Variables": "0", "# Decision Variables": "1888", "# Feasible Runs": "1", "# Integer Variables": "59", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "326.0", "CPU Runtime": "7573.14", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:14:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs060", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.43", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs060/labs060_summary.csv:1", "instance": "labs060", "instance_dir": "labs060", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs060/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs060/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs060/labs060_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs060/labs060_summary.csv" }, { "date_key": "2024-12-28T22:14:35", "fields": { "# Binary Variables": "1769", "# Continuous Variables": "0", "# Decision Variables": "1827", "# Feasible Runs": "1", "# Integer Variables": "58", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "345.0", "CPU Runtime": "7604.68", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:14:35", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs059", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs059/labs059_summary.csv:1", "instance": "labs059", "instance_dir": "labs059", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs059/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs059/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs059/labs059_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs059/labs059_summary.csv" }, { "date_key": "2024-12-28T22:10:34", "fields": { "# Binary Variables": "1710", "# Continuous Variables": "0", "# Decision Variables": "1767", "# Feasible Runs": "1", "# Integer Variables": "57", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "325.0", "CPU Runtime": "7570.68", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:10:34", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs058", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs058/labs058_summary.csv:1", "instance": "labs058", "instance_dir": "labs058", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs058/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs058/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs058/labs058_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs058/labs058_summary.csv" }, { "date_key": "2024-12-28T22:07:56", "fields": { "# Binary Variables": "1652", "# Continuous Variables": "0", "# Decision Variables": "1708", "# Feasible Runs": "1", "# Integer Variables": "56", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "328.0", "CPU Runtime": "7570.68", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:07:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs057", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs057/labs057_summary.csv:1", "instance": "labs057", "instance_dir": "labs057", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs057/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs057/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs057/labs057_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs057/labs057_summary.csv" }, { "date_key": "2024-12-28T22:06:03", "fields": { "# Binary Variables": "1595", "# Continuous Variables": "0", "# Decision Variables": "1650", "# Feasible Runs": "1", "# Integer Variables": "55", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "252.0", "CPU Runtime": "7124.88", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:06:03", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs056", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.23", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs056/labs056_summary.csv:1", "instance": "labs056", "instance_dir": "labs056", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs056/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs056/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs056/labs056_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs056/labs056_summary.csv" }, { "date_key": "2024-12-28T22:01:56", "fields": { "# Binary Variables": "1539", "# Continuous Variables": "0", "# Decision Variables": "1593", "# Feasible Runs": "1", "# Integer Variables": "54", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "271.0", "CPU Runtime": "6489.37", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 22:01:56", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs055", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.15", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs055/labs055_summary.csv:1", "instance": "labs055", "instance_dir": "labs055", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs055/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs055/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs055/labs055_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs055/labs055_summary.csv" }, { "date_key": "2024-12-28T21:34:24", "fields": { "# Binary Variables": "1484", "# Continuous Variables": "0", "# Decision Variables": "1537", "# Feasible Runs": "1", "# Integer Variables": "53", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "279.0", "CPU Runtime": "7446.61", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 21:34:24", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs054", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs054/labs054_summary.csv:1", "instance": "labs054", "instance_dir": "labs054", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs054/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs054/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs054/labs054_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs054/labs054_summary.csv" }, { "date_key": "2024-12-28T20:54:43", "fields": { "# Binary Variables": "1430", "# Continuous Variables": "0", "# Decision Variables": "1482", "# Feasible Runs": "1", "# Integer Variables": "52", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "270.0", "CPU Runtime": "7191.73", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:54:43", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs053", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs053/labs053_summary.csv:1", "instance": "labs053", "instance_dir": "labs053", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs053/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs053/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs053/labs053_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs053/labs053_summary.csv" }, { "date_key": "2024-12-28T20:35:37", "fields": { "# Binary Variables": "1377", "# Continuous Variables": "0", "# Decision Variables": "1428", "# Feasible Runs": "1", "# Integer Variables": "51", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "214.0", "CPU Runtime": "7217.92", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:35:37", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "3.150995891689e-12", "Other HW Runtime": "N/A", "Problem": "labs052", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs052/labs052_summary.csv:1", "instance": "labs052", "instance_dir": "labs052", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs052/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs052/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs052/labs052_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs052/labs052_summary.csv" }, { "date_key": "2024-12-28T20:14:35", "fields": { "# Binary Variables": "1325", "# Continuous Variables": "0", "# Decision Variables": "1375", "# Feasible Runs": "1", "# Integer Variables": "50", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "245.0", "CPU Runtime": "7454.99", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:14:35", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs051", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs051/labs051_summary.csv:1", "instance": "labs051", "instance_dir": "labs051", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs051/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs051/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs051/labs051_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs051/labs051_summary.csv" }, { "date_key": "2024-12-28T20:14:05", "fields": { "# Binary Variables": "1274", "# Continuous Variables": "0", "# Decision Variables": "1323", "# Feasible Runs": "1", "# Integer Variables": "49", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "225.0", "CPU Runtime": "7204.61", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:14:05", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs050", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs050/labs050_summary.csv:1", "instance": "labs050", "instance_dir": "labs050", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs050/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs050/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs050/labs050_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs050/labs050_summary.csv" }, { "date_key": "2024-12-28T20:10:04", "fields": { "# Binary Variables": "1224", "# Continuous Variables": "0", "# Decision Variables": "1272", "# Feasible Runs": "1", "# Integer Variables": "48", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "216.0", "CPU Runtime": "7192.29", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:10:04", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs049", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs049/labs049_summary.csv:1", "instance": "labs049", "instance_dir": "labs049", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs049/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs049/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs049/labs049_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs049/labs049_summary.csv" }, { "date_key": "2024-12-28T20:07:34", "fields": { "# Binary Variables": "1175", "# Continuous Variables": "0", "# Decision Variables": "1222", "# Feasible Runs": "1", "# Integer Variables": "47", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "200.0", "CPU Runtime": "7227.66", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:07:34", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs048", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs048/labs048_summary.csv:1", "instance": "labs048", "instance_dir": "labs048", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs048/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs048/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs048/labs048_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs048/labs048_summary.csv" }, { "date_key": "2024-12-28T20:05:54", "fields": { "# Binary Variables": "1127", "# Continuous Variables": "0", "# Decision Variables": "1173", "# Feasible Runs": "1", "# Integer Variables": "46", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "175.0", "CPU Runtime": "7393.51", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:05:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs047", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs047/labs047_summary.csv:1", "instance": "labs047", "instance_dir": "labs047", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs047/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs047/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs047/labs047_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs047/labs047_summary.csv" }, { "date_key": "2024-12-28T20:01:33", "fields": { "# Binary Variables": "1080", "# Continuous Variables": "0", "# Decision Variables": "1125", "# Feasible Runs": "1", "# Integer Variables": "45", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "179.0", "CPU Runtime": "7181.89", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 20:01:33", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs046", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.22", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs046/labs046_summary.csv:1", "instance": "labs046", "instance_dir": "labs046", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs046/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs046/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs046/labs046_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs046/labs046_summary.csv" }, { "date_key": "2024-12-28T19:33:55", "fields": { "# Binary Variables": "1034", "# Continuous Variables": "0", "# Decision Variables": "1078", "# Feasible Runs": "1", "# Integer Variables": "44", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "154.0", "CPU Runtime": "7131.54", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 19:33:55", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs045", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs045/labs045_summary.csv:1", "instance": "labs045", "instance_dir": "labs045", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs045/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs045/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs045/labs045_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs045/labs045_summary.csv" }, { "date_key": "2024-12-28T18:54:20", "fields": { "# Binary Variables": "989", "# Continuous Variables": "0", "# Decision Variables": "1032", "# Feasible Runs": "1", "# Integer Variables": "43", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "146.0", "CPU Runtime": "7133.21", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:54:20", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs044", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs044/labs044_summary.csv:1", "instance": "labs044", "instance_dir": "labs044", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs044/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs044/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs044/labs044_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs044/labs044_summary.csv" }, { "date_key": "2024-12-28T18:35:17", "fields": { "# Binary Variables": "945", "# Continuous Variables": "0", "# Decision Variables": "987", "# Feasible Runs": "1", "# Integer Variables": "42", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "137.0", "CPU Runtime": "6923.55", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:35:17", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "labs043", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs043/labs043_summary.csv:1", "instance": "labs043", "instance_dir": "labs043", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs043/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs043/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs043/labs043_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs043/labs043_summary.csv" }, { "date_key": "2024-12-28T18:14:13", "fields": { "# Binary Variables": "902", "# Continuous Variables": "0", "# Decision Variables": "943", "# Feasible Runs": "1", "# Integer Variables": "41", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "117.0", "CPU Runtime": "6844.82", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:14:13", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "labs042", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs042/labs042_summary.csv:1", "instance": "labs042", "instance_dir": "labs042", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs042/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs042/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs042/labs042_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs042/labs042_summary.csv" }, { "date_key": "2024-12-28T18:13:43", "fields": { "# Binary Variables": "860", "# Continuous Variables": "0", "# Decision Variables": "900", "# Feasible Runs": "1", "# Integer Variables": "40", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "112.0", "CPU Runtime": "6680.59", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:13:43", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "labs041", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs041/labs041_summary.csv:1", "instance": "labs041", "instance_dir": "labs041", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs041/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs041/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs041/labs041_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs041/labs041_summary.csv" }, { "date_key": "2024-12-28T18:09:43", "fields": { "# Binary Variables": "819", "# Continuous Variables": "0", "# Decision Variables": "858", "# Feasible Runs": "1", "# Integer Variables": "39", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "116.0", "CPU Runtime": "6817.17", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:09:43", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "labs040", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs040/labs040_summary.csv:1", "instance": "labs040", "instance_dir": "labs040", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs040/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs040/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs040/labs040_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs040/labs040_summary.csv" }, { "date_key": "2024-12-28T18:06:52", "fields": { "# Binary Variables": "779", "# Continuous Variables": "0", "# Decision Variables": "817", "# Feasible Runs": "1", "# Integer Variables": "38", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "99.0", "CPU Runtime": "6788.34", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:06:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "1.0", "Other HW Runtime": "N/A", "Problem": "labs039", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs039/labs039_summary.csv:1", "instance": "labs039", "instance_dir": "labs039", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs039/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs039/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs039/labs039_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs039/labs039_summary.csv" }, { "date_key": "2024-12-28T18:05:12", "fields": { "# Binary Variables": "740", "# Continuous Variables": "0", "# Decision Variables": "777", "# Feasible Runs": "1", "# Integer Variables": "37", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "87.0", "CPU Runtime": "6756.94", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:05:12", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "16.0", "Other HW Runtime": "N/A", "Problem": "labs038", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs038/labs038_summary.csv:1", "instance": "labs038", "instance_dir": "labs038", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs038/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs038/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs038/labs038_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs038/labs038_summary.csv" }, { "date_key": "2024-12-28T18:00:52", "fields": { "# Binary Variables": "702", "# Continuous Variables": "0", "# Decision Variables": "738", "# Feasible Runs": "1", "# Integer Variables": "36", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "86.0", "CPU Runtime": "6556.43", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:00:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "22.0", "Other HW Runtime": "N/A", "Problem": "labs037", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs037/labs037_summary.csv:1", "instance": "labs037", "instance_dir": "labs037", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs037/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs037/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs037/labs037_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs037/labs037_summary.csv" }, { "date_key": "2024-12-28T18:00:07", "fields": { "# Binary Variables": "665", "# Continuous Variables": "0", "# Decision Variables": "700", "# Feasible Runs": "1", "# Integer Variables": "35", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "82.0", "CPU Runtime": "5214.71", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 18:00:07", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "82.0", "Other HW Runtime": "N/A", "Problem": "labs036", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "5610.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs036/labs036_summary.csv:1", "instance": "labs036", "instance_dir": "labs036", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs036/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs036/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs036/labs036_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs036/labs036_summary.csv" }, { "date_key": "2024-12-28T17:59:11", "fields": { "# Binary Variables": "629", "# Continuous Variables": "0", "# Decision Variables": "663", "# Feasible Runs": "1", "# Integer Variables": "34", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "73.0", "CPU Runtime": "3070.06", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:59:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "73.0", "Other HW Runtime": "N/A", "Problem": "labs035", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3305.28", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs035/labs035_summary.csv:1", "instance": "labs035", "instance_dir": "labs035", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs035/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs035/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs035/labs035_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs035/labs035_summary.csv" }, { "date_key": "2024-12-28T17:59:11", "fields": { "# Binary Variables": "594", "# Continuous Variables": "0", "# Decision Variables": "627", "# Feasible Runs": "1", "# Integer Variables": "33", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "65.0", "CPU Runtime": "2212.41", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:59:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "65.0", "Other HW Runtime": "N/A", "Problem": "labs034", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2149.32", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs034/labs034_summary.csv:1", "instance": "labs034", "instance_dir": "labs034", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs034/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs034/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs034/labs034_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs034/labs034_summary.csv" }, { "date_key": "2024-12-28T17:59:11", "fields": { "# Binary Variables": "560", "# Continuous Variables": "0", "# Decision Variables": "592", "# Feasible Runs": "1", "# Integer Variables": "32", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "64.0", "CPU Runtime": "799.53", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:59:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "64.0", "Other HW Runtime": "N/A", "Problem": "labs033", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "884.42", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs033/labs033_summary.csv:1", "instance": "labs033", "instance_dir": "labs033", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs033/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs033/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs033/labs033_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs033/labs033_summary.csv" }, { "date_key": "2024-12-28T17:59:11", "fields": { "# Binary Variables": "527", "# Continuous Variables": "0", "# Decision Variables": "558", "# Feasible Runs": "1", "# Integer Variables": "31", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "64.0", "CPU Runtime": "558.44", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:59:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "64.0", "Other HW Runtime": "N/A", "Problem": "labs032", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "618.93", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs032/labs032_summary.csv:1", "instance": "labs032", "instance_dir": "labs032", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs032/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs032/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs032/labs032_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs032/labs032_summary.csv" }, { "date_key": "2024-12-28T17:59:11", "fields": { "# Binary Variables": "495", "# Continuous Variables": "0", "# Decision Variables": "525", "# Feasible Runs": "1", "# Integer Variables": "30", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "67.0", "CPU Runtime": "887.58", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:59:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "67.0", "Other HW Runtime": "N/A", "Problem": "labs031", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "866.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs031/labs031_summary.csv:1", "instance": "labs031", "instance_dir": "labs031", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs031/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs031/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs031/labs031_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs031/labs031_summary.csv" }, { "date_key": "2024-12-28T17:58:54", "fields": { "# Binary Variables": "54", "# Continuous Variables": "0", "# Decision Variables": "63", "# Feasible Runs": "1", "# Integer Variables": "9", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "13.0", "CPU Runtime": "0.02", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "13.0", "Other HW Runtime": "N/A", "Problem": "labs010", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.21", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs010/labs010_summary.csv:1", "instance": "labs010", "instance_dir": "labs010", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs010/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs010/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs010/labs010_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs010/labs010_summary.csv" }, { "date_key": "2024-12-28T17:58:54", "fields": { "# Binary Variables": "44", "# Continuous Variables": "0", "# Decision Variables": "52", "# Feasible Runs": "1", "# Integer Variables": "8", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "12.0", "CPU Runtime": "0.03", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "12.0", "Other HW Runtime": "N/A", "Problem": "labs009", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.19", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs009/labs009_summary.csv:1", "instance": "labs009", "instance_dir": "labs009", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs009/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs009/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs009/labs009_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs009/labs009_summary.csv" }, { "date_key": "2024-12-28T17:58:54", "fields": { "# Binary Variables": "9", "# Continuous Variables": "0", "# Decision Variables": "12", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "labs004", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs004/labs004_summary.csv:1", "instance": "labs004", "instance_dir": "labs004", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs004/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs004/labs004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs004/labs004_summary.csv" }, { "date_key": "2024-12-28T17:58:54", "fields": { "# Binary Variables": "3", "# Continuous Variables": "0", "# Decision Variables": "5", "# Feasible Runs": "1", "# Integer Variables": "2", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1.0", "CPU Runtime": "0.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "1.0", "Other HW Runtime": "N/A", "Problem": "labs003", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs003/labs003_summary.csv:1", "instance": "labs003", "instance_dir": "labs003", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs003/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs003/labs003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs003/labs003_summary.csv" }, { "date_key": "2024-12-28T17:58:41", "fields": { "# Binary Variables": "464", "# Continuous Variables": "0", "# Decision Variables": "493", "# Feasible Runs": "1", "# Integer Variables": "29", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "59.0", "CPU Runtime": "380.43", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "59.0", "Other HW Runtime": "N/A", "Problem": "labs030", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "384.56", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs030/labs030_summary.csv:1", "instance": "labs030", "instance_dir": "labs030", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs030/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs030/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs030/labs030_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs030/labs030_summary.csv" }, { "date_key": "2024-12-28T17:58:41", "fields": { "# Binary Variables": "434", "# Continuous Variables": "0", "# Decision Variables": "462", "# Feasible Runs": "1", "# Integer Variables": "28", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "62.0", "CPU Runtime": "502.57", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "62.0", "Other HW Runtime": "N/A", "Problem": "labs029", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "484.7", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs029/labs029_summary.csv:1", "instance": "labs029", "instance_dir": "labs029", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs029/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs029/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs029/labs029_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs029/labs029_summary.csv" }, { "date_key": "2024-12-28T17:58:11", "fields": { "# Binary Variables": "405", "# Continuous Variables": "0", "# Decision Variables": "432", "# Feasible Runs": "1", "# Integer Variables": "27", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "50.0", "CPU Runtime": "152.72", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:58:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "50.0", "Other HW Runtime": "N/A", "Problem": "labs028", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "152.48", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs028/labs028_summary.csv:1", "instance": "labs028", "instance_dir": "labs028", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs028/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs028/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs028/labs028_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs028/labs028_summary.csv" }, { "date_key": "2024-12-28T17:57:53", "fields": { "# Binary Variables": "377", "# Continuous Variables": "0", "# Decision Variables": "403", "# Feasible Runs": "1", "# Integer Variables": "26", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "37.0", "CPU Runtime": "83.7", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:53", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "37.0", "Other HW Runtime": "N/A", "Problem": "labs027", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "84.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs027/labs027_summary.csv:1", "instance": "labs027", "instance_dir": "labs027", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs027/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs027/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs027/labs027_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs027/labs027_summary.csv" }, { "date_key": "2024-12-28T17:57:53", "fields": { "# Binary Variables": "350", "# Continuous Variables": "0", "# Decision Variables": "375", "# Feasible Runs": "1", "# Integer Variables": "25", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "45.0", "CPU Runtime": "62.9", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:53", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "45.0", "Other HW Runtime": "N/A", "Problem": "labs026", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "62.94", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs026/labs026_summary.csv:1", "instance": "labs026", "instance_dir": "labs026", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs026/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs026/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs026/labs026_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs026/labs026_summary.csv" }, { "date_key": "2024-12-28T17:57:50", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "25", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "7.0", "CPU Runtime": "0.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:50", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "7.0", "Other HW Runtime": "N/A", "Problem": "labs006", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.09", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs006/labs006_summary.csv:1", "instance": "labs006", "instance_dir": "labs006", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs006/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs006/labs006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs006/labs006_summary.csv" }, { "date_key": "2024-12-28T17:57:50", "fields": { "# Binary Variables": "14", "# Continuous Variables": "0", "# Decision Variables": "18", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:50", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "labs005", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs005/labs005_summary.csv:1", "instance": "labs005", "instance_dir": "labs005", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs005/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs005/labs005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs005/labs005_summary.csv" }, { "date_key": "2024-12-28T17:57:41", "fields": { "# Binary Variables": "324", "# Continuous Variables": "0", "# Decision Variables": "348", "# Feasible Runs": "1", "# Integer Variables": "24", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "36.0", "CPU Runtime": "55.2", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "36.0", "Other HW Runtime": "N/A", "Problem": "labs025", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "54.91", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs025/labs025_summary.csv:1", "instance": "labs025", "instance_dir": "labs025", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs025/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs025/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs025/labs025_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs025/labs025_summary.csv" }, { "date_key": "2024-12-28T17:57:41", "fields": { "# Binary Variables": "299", "# Continuous Variables": "0", "# Decision Variables": "322", "# Feasible Runs": "1", "# Integer Variables": "23", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "36.0", "CPU Runtime": "37.7", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "36.0", "Other HW Runtime": "N/A", "Problem": "labs024", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "39.34", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs024/labs024_summary.csv:1", "instance": "labs024", "instance_dir": "labs024", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs024/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs024/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs024/labs024_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs024/labs024_summary.csv" }, { "date_key": "2024-12-28T17:57:41", "fields": { "# Binary Variables": "275", "# Continuous Variables": "0", "# Decision Variables": "297", "# Feasible Runs": "1", "# Integer Variables": "22", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "47.0", "CPU Runtime": "19.31", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:41", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "47.0", "Other HW Runtime": "N/A", "Problem": "labs023", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "22.63", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs023/labs023_summary.csv:1", "instance": "labs023", "instance_dir": "labs023", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs023/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs023/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs023/labs023_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs023/labs023_summary.csv" }, { "date_key": "2024-12-28T17:57:11", "fields": { "# Binary Variables": "252", "# Continuous Variables": "0", "# Decision Variables": "273", "# Feasible Runs": "1", "# Integer Variables": "21", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "39.0", "CPU Runtime": "13.36", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "39.0", "Other HW Runtime": "N/A", "Problem": "labs022", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "15.37", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs022/labs022_summary.csv:1", "instance": "labs022", "instance_dir": "labs022", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs022/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs022/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs022/labs022_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs022/labs022_summary.csv" }, { "date_key": "2024-12-28T17:57:11", "fields": { "# Binary Variables": "230", "# Continuous Variables": "0", "# Decision Variables": "250", "# Feasible Runs": "1", "# Integer Variables": "20", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "26.0", "CPU Runtime": "2.02", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "26.0", "Other HW Runtime": "N/A", "Problem": "labs021", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2.97", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs021/labs021_summary.csv:1", "instance": "labs021", "instance_dir": "labs021", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs021/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs021/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs021/labs021_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs021/labs021_summary.csv" }, { "date_key": "2024-12-28T17:57:11", "fields": { "# Binary Variables": "209", "# Continuous Variables": "0", "# Decision Variables": "228", "# Feasible Runs": "1", "# Integer Variables": "19", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "26.0", "CPU Runtime": "1.4", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:57:11", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "26.0", "Other HW Runtime": "N/A", "Problem": "labs020", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2.26", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs020/labs020_summary.csv:1", "instance": "labs020", "instance_dir": "labs020", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs020/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs020/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs020/labs020_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs020/labs020_summary.csv" }, { "date_key": "2024-12-28T17:56:54", "fields": { "# Binary Variables": "35", "# Continuous Variables": "0", "# Decision Variables": "42", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "8.0", "CPU Runtime": "0.01", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:56:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "8.0", "Other HW Runtime": "N/A", "Problem": "labs008", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs008/labs008_summary.csv:1", "instance": "labs008", "instance_dir": "labs008", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs008/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs008/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs008/labs008_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs008/labs008_summary.csv" }, { "date_key": "2024-12-28T17:56:54", "fields": { "# Binary Variables": "27", "# Continuous Variables": "0", "# Decision Variables": "33", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "0.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:56:54", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "labs007", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs007/labs007_summary.csv:1", "instance": "labs007", "instance_dir": "labs007", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs007/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs007/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs007/labs007_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs007/labs007_summary.csv" }, { "date_key": "2024-12-28T17:56:53", "fields": { "# Binary Variables": "189", "# Continuous Variables": "0", "# Decision Variables": "207", "# Feasible Runs": "1", "# Integer Variables": "18", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "29.0", "CPU Runtime": "1.25", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:56:53", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "29.0", "Other HW Runtime": "N/A", "Problem": "labs019", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs019/labs019_summary.csv:1", "instance": "labs019", "instance_dir": "labs019", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs019/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs019/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs019/labs019_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs019/labs019_summary.csv" }, { "date_key": "2024-12-28T17:56:40", "fields": { "# Binary Variables": "170", "# Continuous Variables": "0", "# Decision Variables": "187", "# Feasible Runs": "1", "# Integer Variables": "17", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "25.0", "CPU Runtime": "0.61", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:56:40", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "25.0", "Other HW Runtime": "N/A", "Problem": "labs018", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.2", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs018/labs018_summary.csv:1", "instance": "labs018", "instance_dir": "labs018", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs018/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs018/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs018/labs018_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs018/labs018_summary.csv" }, { "date_key": "2024-12-28T17:56:10", "fields": { "# Binary Variables": "152", "# Continuous Variables": "0", "# Decision Variables": "168", "# Feasible Runs": "1", "# Integer Variables": "16", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "32.0", "CPU Runtime": "0.81", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:56:10", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "32.0", "Other HW Runtime": "N/A", "Problem": "labs017", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.38", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs017/labs017_summary.csv:1", "instance": "labs017", "instance_dir": "labs017", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs017/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs017/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs017/labs017_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs017/labs017_summary.csv" }, { "date_key": "2024-12-28T17:55:52", "fields": { "# Binary Variables": "135", "# Continuous Variables": "0", "# Decision Variables": "150", "# Feasible Runs": "1", "# Integer Variables": "15", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "24.0", "CPU Runtime": "0.37", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:55:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "24.0", "Other HW Runtime": "N/A", "Problem": "labs016", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.88", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs016/labs016_summary.csv:1", "instance": "labs016", "instance_dir": "labs016", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs016/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs016/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs016/labs016_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs016/labs016_summary.csv" }, { "date_key": "2024-12-28T17:55:40", "fields": { "# Binary Variables": "119", "# Continuous Variables": "0", "# Decision Variables": "133", "# Feasible Runs": "1", "# Integer Variables": "14", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "15.0", "CPU Runtime": "0.17", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:55:40", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "15.0", "Other HW Runtime": "N/A", "Problem": "labs015", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.44", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs015/labs015_summary.csv:1", "instance": "labs015", "instance_dir": "labs015", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs015/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs015/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs015/labs015_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs015/labs015_summary.csv" }, { "date_key": "2024-12-28T17:55:10", "fields": { "# Binary Variables": "104", "# Continuous Variables": "0", "# Decision Variables": "117", "# Feasible Runs": "1", "# Integer Variables": "13", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "19.0", "CPU Runtime": "0.3", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:55:10", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "19.0", "Other HW Runtime": "N/A", "Problem": "labs014", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.76", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs014/labs014_summary.csv:1", "instance": "labs014", "instance_dir": "labs014", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs014/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs014/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs014/labs014_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs014/labs014_summary.csv" }, { "date_key": "2024-12-28T17:54:52", "fields": { "# Binary Variables": "90", "# Continuous Variables": "0", "# Decision Variables": "102", "# Feasible Runs": "1", "# Integer Variables": "12", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "0.12", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:54:52", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "6.0", "Other HW Runtime": "N/A", "Problem": "labs013", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.65", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs013/labs013_summary.csv:1", "instance": "labs013", "instance_dir": "labs013", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs013/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs013/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs013/labs013_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs013/labs013_summary.csv" }, { "date_key": "2024-12-28T17:54:40", "fields": { "# Binary Variables": "77", "# Continuous Variables": "0", "# Decision Variables": "88", "# Feasible Runs": "1", "# Integer Variables": "11", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "10.0", "CPU Runtime": "0.05", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:54:40", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "10.0", "Other HW Runtime": "N/A", "Problem": "labs012", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.32", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs012/labs012_summary.csv:1", "instance": "labs012", "instance_dir": "labs012", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs012/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs012/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs012/labs012_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs012/labs012_summary.csv" }, { "date_key": "2024-12-28T17:54:10", "fields": { "# Binary Variables": "65", "# Continuous Variables": "0", "# Decision Variables": "75", "# Feasible Runs": "1", "# Integer Variables": "10", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "0.02", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 4.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:54:10", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "5.0", "Other HW Runtime": "N/A", "Problem": "labs011", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.18", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs011/labs011_summary.csv:1", "instance": "labs011", "instance_dir": "labs011", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs011/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs011/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs011/labs011_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs011/labs011_summary.csv" }, { "date_key": "2024-12-28T17:53:53", "fields": { "# Binary Variables": "2", "# Continuous Variables": "0", "# Decision Variables": "3", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "0", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "1.0", "CPU Runtime": "0.0", "Coefficients Range": "0.0 - 0.0, 4.0 - 4.0, 1.0 - 2.0", "Coefficients Type": "Integer", "Date": "2024-12-28 17:53:53", "GPU Runtime": "N/A", "Hardware Specifications": "linux64, gurobi_cl: AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Program", "Optimality Bound": "1.0", "Other HW Runtime": "N/A", "Problem": "labs002", "QPU Runtime": "N/A", "Reference": "See Models Directory (integer) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "02-labs/submissions/20241229_Gurobi_Schicker/labs002/labs002_summary.csv:1", "instance": "labs002", "instance_dir": "labs002", "problem_dir": "02-labs", "problem_number": "02", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/labs002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs002/README.md", "submission_set": "20241229_Gurobi_Schicker", "summary_csv": "02-labs/submissions/20241229_Gurobi_Schicker/labs002/labs002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/labs002/labs002_summary.csv" }, { "date_key": "2024-12-23T12:02:21", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "424", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "15662.48", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 12:02:21", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_200_500", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2753.22", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/ms_07_200_500_summary.csv:1", "instance": "ms_07_200_500", "instance_dir": "ms_07_200_500", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/ms_07_200_500_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_500/ms_07_200_500_summary.csv" }, { "date_key": "2024-12-23T11:35:18", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "426", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "14702.0", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 11:35:18", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_200_398", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2479.56", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/ms_07_200_398_summary.csv:1", "instance": "ms_07_200_398", "instance_dir": "ms_07_200_398", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/ms_07_200_398_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_398/ms_07_200_398_summary.csv" }, { "date_key": "2024-12-23T11:24:47", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "424", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "16954.68", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 11:24:47", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_200_370", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2568.29", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/ms_07_200_370_summary.csv:1", "instance": "ms_07_200_370", "instance_dir": "ms_07_200_370", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/ms_07_200_370_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_370/ms_07_200_370_summary.csv" }, { "date_key": "2024-12-23T11:17:47", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "425", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "11933.28", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 11:17:47", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_200_248", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2329.87", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/ms_07_200_248_summary.csv:1", "instance": "ms_07_200_248", "instance_dir": "ms_07_200_248", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/ms_07_200_248_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_200_248/ms_07_200_248_summary.csv" }, { "date_key": "2024-12-23T10:09:41", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "423", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "2437.57", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 10:09:41", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_100_006", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "898.13", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/ms_07_100_006_summary.csv:1", "instance": "ms_07_100_006", "instance_dir": "ms_07_100_006", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/ms_07_100_006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_006/ms_07_100_006_summary.csv" }, { "date_key": "2024-12-23T10:03:11", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "418", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "2277.31", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 10:03:11", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_100_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "887.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/ms_07_100_005_summary.csv:1", "instance": "ms_07_100_005", "instance_dir": "ms_07_100_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/ms_07_100_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_005/ms_07_100_005_summary.csv" }, { "date_key": "2024-12-23T09:59:41", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "427", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "2563.96", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:59:41", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1139.69", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/ms_07_100_003_summary.csv:1", "instance": "ms_07_100_003", "instance_dir": "ms_07_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/ms_07_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_003/ms_07_100_003_summary.csv" }, { "date_key": "2024-12-23T09:59:41", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "424", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "3112.3", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:59:41", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_100_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1475.69", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/ms_07_100_002_summary.csv:1", "instance": "ms_07_100_002", "instance_dir": "ms_07_100_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/ms_07_100_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_100_002/ms_07_100_002_summary.csv" }, { "date_key": "2024-12-23T09:48:40", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "419", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "441.7", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:48:40", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "246.32", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/ms_07_050_004_summary.csv:1", "instance": "ms_07_050_004", "instance_dir": "ms_07_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/ms_07_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_004/ms_07_050_004_summary.csv" }, { "date_key": "2024-12-23T09:46:09", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "422", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "276.97", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:46:09", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "160.69", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/ms_07_050_003_summary.csv:1", "instance": "ms_07_050_003", "instance_dir": "ms_07_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/ms_07_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_003/ms_07_050_003_summary.csv" }, { "date_key": "2024-12-23T09:45:39", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "423", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "312.5", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:45:39", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "166.84", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/ms_07_050_002_summary.csv:1", "instance": "ms_07_050_002", "instance_dir": "ms_07_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/ms_07_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_002/ms_07_050_002_summary.csv" }, { "date_key": "2024-12-23T09:45:39", "fields": { "# Binary Variables": "60", "# Continuous Variables": "0", "# Decision Variables": "67", "# Feasible Runs": "1", "# Integer Variables": "7", "# Non-Zero Coefficients": "413", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "370.7", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:45:39", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_07_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "206.56", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/ms_07_050_001_summary.csv:1", "instance": "ms_07_050_001", "instance_dir": "ms_07_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/ms_07_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_07_050_001/ms_07_050_001_summary.csv" }, { "date_key": "2024-12-23T09:44:09", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "305", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "53.07", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:44:09", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_200_289", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "22.77", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/ms_06_200_289_summary.csv:1", "instance": "ms_06_200_289", "instance_dir": "ms_06_200_289", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/ms_06_200_289_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_289/ms_06_200_289_summary.csv" }, { "date_key": "2024-12-23T09:43:09", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "305", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "65.82", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:43:09", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_200_240", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "27.65", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/ms_06_200_240_summary.csv:1", "instance": "ms_06_200_240", "instance_dir": "ms_06_200_240", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/ms_06_200_240_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_240/ms_06_200_240_summary.csv" }, { "date_key": "2024-12-23T09:43:09", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "306", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "67.56", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:43:09", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_200_104", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "28.42", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/ms_06_200_104_summary.csv:1", "instance": "ms_06_200_104", "instance_dir": "ms_06_200_104", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/ms_06_200_104_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_104/ms_06_200_104_summary.csv" }, { "date_key": "2024-12-23T09:41:39", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "303", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "31.55", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:41:39", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_200_077", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "15.49", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/ms_06_200_077_summary.csv:1", "instance": "ms_06_200_077", "instance_dir": "ms_06_200_077", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/ms_06_200_077_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_200_077/ms_06_200_077_summary.csv" }, { "date_key": "2024-12-23T09:39:08", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "304", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "341.58", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:39:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_100_010", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "114.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/ms_06_100_010_summary.csv:1", "instance": "ms_06_100_010", "instance_dir": "ms_06_100_010", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/ms_06_100_010_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_010/ms_06_100_010_summary.csv" }, { "date_key": "2024-12-23T09:38:08", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "300", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "215.07", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:38:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_100_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "70.29", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/ms_06_100_005_summary.csv:1", "instance": "ms_06_100_005", "instance_dir": "ms_06_100_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/ms_06_100_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_005/ms_06_100_005_summary.csv" }, { "date_key": "2024-12-23T09:37:38", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "306", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "176.59", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:37:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "61.7", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/ms_06_100_003_summary.csv:1", "instance": "ms_06_100_003", "instance_dir": "ms_06_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/ms_06_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_003/ms_06_100_003_summary.csv" }, { "date_key": "2024-12-23T09:37:38", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "303", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "124.15", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:37:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_100_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "45.33", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/ms_06_100_002_summary.csv:1", "instance": "ms_06_100_002", "instance_dir": "ms_06_100_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/ms_06_100_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_100_002/ms_06_100_002_summary.csv" }, { "date_key": "2024-12-23T09:36:38", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "299", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "71.62", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "26.61", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/ms_06_050_004_summary.csv:1", "instance": "ms_06_050_004", "instance_dir": "ms_06_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/ms_06_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_004/ms_06_050_004_summary.csv" }, { "date_key": "2024-12-23T09:36:38", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "302", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "19.52", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "11.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/ms_06_050_003_summary.csv:1", "instance": "ms_06_050_003", "instance_dir": "ms_06_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/ms_06_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_003/ms_06_050_003_summary.csv" }, { "date_key": "2024-12-23T09:36:38", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "302", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "29.3", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "14.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/ms_06_050_002_summary.csv:1", "instance": "ms_06_050_002", "instance_dir": "ms_06_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/ms_06_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_002/ms_06_050_002_summary.csv" }, { "date_key": "2024-12-23T09:36:38", "fields": { "# Binary Variables": "50", "# Continuous Variables": "0", "# Decision Variables": "56", "# Feasible Runs": "1", "# Integer Variables": "6", "# Non-Zero Coefficients": "297", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "4.76", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_06_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "6.75", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/ms_06_050_001_summary.csv:1", "instance": "ms_06_050_001", "instance_dir": "ms_06_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/ms_06_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_06_050_001/ms_06_050_001_summary.csv" }, { "date_key": "2024-12-23T09:36:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "204", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "1.06", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_200_199", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.97", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/ms_05_200_199_summary.csv:1", "instance": "ms_05_200_199", "instance_dir": "ms_05_200_199", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/ms_05_200_199_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_199/ms_05_200_199_summary.csv" }, { "date_key": "2024-12-23T09:36:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "205", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "1.34", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_200_180", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/ms_05_200_180_summary.csv:1", "instance": "ms_05_200_180", "instance_dir": "ms_05_200_180", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/ms_05_200_180_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_180/ms_05_200_180_summary.csv" }, { "date_key": "2024-12-23T09:36:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "205", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "1.27", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_200_095", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/ms_05_200_095_summary.csv:1", "instance": "ms_05_200_095", "instance_dir": "ms_05_200_095", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/ms_05_200_095_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_095/ms_05_200_095_summary.csv" }, { "date_key": "2024-12-23T09:36:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "205", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "1.34", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:36:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_200_070", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.9", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/ms_05_200_070_summary.csv:1", "instance": "ms_05_200_070", "instance_dir": "ms_05_200_070", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/ms_05_200_070_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_200_070/ms_05_200_070_summary.csv" }, { "date_key": "2024-12-23T09:35:38", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "205", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "1.15", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_100_015", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.92", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/ms_05_100_015_summary.csv:1", "instance": "ms_05_100_015", "instance_dir": "ms_05_100_015", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/ms_05_100_015_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_015/ms_05_100_015_summary.csv" }, { "date_key": "2024-12-23T09:35:38", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "204", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.57", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_100_013", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.65", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/ms_05_100_013_summary.csv:1", "instance": "ms_05_100_013", "instance_dir": "ms_05_100_013", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/ms_05_100_013_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_013/ms_05_100_013_summary.csv" }, { "date_key": "2024-12-23T09:35:38", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "204", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.92", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_100_006", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.87", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/ms_05_100_006_summary.csv:1", "instance": "ms_05_100_006", "instance_dir": "ms_05_100_006", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/ms_05_100_006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_006/ms_05_100_006_summary.csv" }, { "date_key": "2024-12-23T09:35:38", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "205", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.54", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.69", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/ms_05_100_003_summary.csv:1", "instance": "ms_05_100_003", "instance_dir": "ms_05_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/ms_05_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_100_003/ms_05_100_003_summary.csv" }, { "date_key": "2024-12-23T09:35:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "198", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.6", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.76", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/ms_05_050_004_summary.csv:1", "instance": "ms_05_050_004", "instance_dir": "ms_05_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/ms_05_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_004/ms_05_050_004_summary.csv" }, { "date_key": "2024-12-23T09:35:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "202", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.64", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.8", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/ms_05_050_003_summary.csv:1", "instance": "ms_05_050_003", "instance_dir": "ms_05_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/ms_05_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_003/ms_05_050_003_summary.csv" }, { "date_key": "2024-12-23T09:35:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "201", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.33", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.66", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/ms_05_050_002_summary.csv:1", "instance": "ms_05_050_002", "instance_dir": "ms_05_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/ms_05_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_002/ms_05_050_002_summary.csv" }, { "date_key": "2024-12-23T09:35:08", "fields": { "# Binary Variables": "40", "# Continuous Variables": "0", "# Decision Variables": "45", "# Feasible Runs": "1", "# Integer Variables": "5", "# Non-Zero Coefficients": "201", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.25", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:35:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_05_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.7", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/ms_05_050_001_summary.csv:1", "instance": "ms_05_050_001", "instance_dir": "ms_05_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/ms_05_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_05_050_001/ms_05_050_001_summary.csv" }, { "date_key": "2024-12-23T09:34:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "124", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.84", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_200_176", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.96", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/ms_04_200_176_summary.csv:1", "instance": "ms_04_200_176", "instance_dir": "ms_04_200_176", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/ms_04_200_176_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_176/ms_04_200_176_summary.csv" }, { "date_key": "2024-12-23T09:34:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "124", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.04", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_200_174", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.31", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/ms_04_200_174_summary.csv:1", "instance": "ms_04_200_174", "instance_dir": "ms_04_200_174", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/ms_04_200_174_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_174/ms_04_200_174_summary.csv" }, { "date_key": "2024-12-23T09:34:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "123", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.83", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_200_150", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.87", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/ms_04_200_150_summary.csv:1", "instance": "ms_04_200_150", "instance_dir": "ms_04_200_150", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/ms_04_200_150_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_150/ms_04_200_150_summary.csv" }, { "date_key": "2024-12-23T09:34:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "123", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.94", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_200_030", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.9", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/ms_04_200_030_summary.csv:1", "instance": "ms_04_200_030", "instance_dir": "ms_04_200_030", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/ms_04_200_030_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_200_030/ms_04_200_030_summary.csv" }, { "date_key": "2024-12-23T09:34:08", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "124", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.52", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_100_015", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/ms_04_100_015_summary.csv:1", "instance": "ms_04_100_015", "instance_dir": "ms_04_100_015", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/ms_04_100_015_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_015/ms_04_100_015_summary.csv" }, { "date_key": "2024-12-23T09:34:08", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "123", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.65", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_100_013", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.89", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/ms_04_100_013_summary.csv:1", "instance": "ms_04_100_013", "instance_dir": "ms_04_100_013", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/ms_04_100_013_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_013/ms_04_100_013_summary.csv" }, { "date_key": "2024-12-23T09:34:08", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "123", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.43", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_100_009", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.68", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/ms_04_100_009_summary.csv:1", "instance": "ms_04_100_009", "instance_dir": "ms_04_100_009", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/ms_04_100_009_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_009/ms_04_100_009_summary.csv" }, { "date_key": "2024-12-23T09:34:08", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "124", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.43", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:34:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.0", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/ms_04_100_003_summary.csv:1", "instance": "ms_04_100_003", "instance_dir": "ms_04_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/ms_04_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_100_003/ms_04_100_003_summary.csv" }, { "date_key": "2024-12-23T09:33:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "122", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.11", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_050_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.5", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/ms_04_050_005_summary.csv:1", "instance": "ms_04_050_005", "instance_dir": "ms_04_050_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/ms_04_050_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_005/ms_04_050_005_summary.csv" }, { "date_key": "2024-12-23T09:33:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "121", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.26", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/ms_04_050_004_summary.csv:1", "instance": "ms_04_050_004", "instance_dir": "ms_04_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/ms_04_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_004/ms_04_050_004_summary.csv" }, { "date_key": "2024-12-23T09:33:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "123", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.25", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.98", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/ms_04_050_003_summary.csv:1", "instance": "ms_04_050_003", "instance_dir": "ms_04_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/ms_04_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_003/ms_04_050_003_summary.csv" }, { "date_key": "2024-12-23T09:33:38", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "34", "# Feasible Runs": "1", "# Integer Variables": "4", "# Non-Zero Coefficients": "121", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.77", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_04_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2.84", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/ms_04_050_001_summary.csv:1", "instance": "ms_04_050_001", "instance_dir": "ms_04_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/ms_04_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_04_050_001/ms_04_050_001_summary.csv" }, { "date_key": "2024-12-23T09:33:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "62", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.02", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_200_177", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/ms_03_200_177_summary.csv:1", "instance": "ms_03_200_177", "instance_dir": "ms_03_200_177", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/ms_03_200_177_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_177/ms_03_200_177_summary.csv" }, { "date_key": "2024-12-23T09:33:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "62", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_200_161", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.12", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/ms_03_200_161_summary.csv:1", "instance": "ms_03_200_161", "instance_dir": "ms_03_200_161", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/ms_03_200_161_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_161/ms_03_200_161_summary.csv" }, { "date_key": "2024-12-23T09:33:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "63", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_200_068", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.15", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/ms_03_200_068_summary.csv:1", "instance": "ms_03_200_068", "instance_dir": "ms_03_200_068", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/ms_03_200_068_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_068/ms_03_200_068_summary.csv" }, { "date_key": "2024-12-23T09:33:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "63", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 200.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:33:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_200_050", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.15", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/ms_03_200_050_summary.csv:1", "instance": "ms_03_200_050", "instance_dir": "ms_03_200_050", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/ms_03_200_050_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_200_050/ms_03_200_050_summary.csv" }, { "date_key": "2024-12-23T09:32:38", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "63", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_100_022", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.12", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/ms_03_100_022_summary.csv:1", "instance": "ms_03_100_022", "instance_dir": "ms_03_100_022", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/ms_03_100_022_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_022/ms_03_100_022_summary.csv" }, { "date_key": "2024-12-23T09:32:38", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "63", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.03", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_100_019", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.23", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/ms_03_100_019_summary.csv:1", "instance": "ms_03_100_019", "instance_dir": "ms_03_100_019", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/ms_03_100_019_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_019/ms_03_100_019_summary.csv" }, { "date_key": "2024-12-23T09:32:38", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "62", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.02", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_100_012", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.16", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/ms_03_100_012_summary.csv:1", "instance": "ms_03_100_012", "instance_dir": "ms_03_100_012", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/ms_03_100_012_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_012/ms_03_100_012_summary.csv" }, { "date_key": "2024-12-23T09:32:38", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "61", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.04", "Coefficients Range": "1.0 - 100.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:38", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_100_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.23", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/ms_03_100_001_summary.csv:1", "instance": "ms_03_100_001", "instance_dir": "ms_03_100_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/ms_03_100_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_100_001/ms_03_100_001_summary.csv" }, { "date_key": "2024-12-23T09:32:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "60", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_050_009", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/ms_03_050_009_summary.csv:1", "instance": "ms_03_050_009", "instance_dir": "ms_03_050_009", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/ms_03_050_009_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_009/ms_03_050_009_summary.csv" }, { "date_key": "2024-12-23T09:32:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "59", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.03", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_050_007", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/ms_03_050_007_summary.csv:1", "instance": "ms_03_050_007", "instance_dir": "ms_03_050_007", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/ms_03_050_007_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_007/ms_03_050_007_summary.csv" }, { "date_key": "2024-12-23T09:32:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "62", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.0", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_050_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.01", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/ms_03_050_005_summary.csv:1", "instance": "ms_03_050_005", "instance_dir": "ms_03_050_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/ms_03_050_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_005/ms_03_050_005_summary.csv" }, { "date_key": "2024-12-23T09:32:08", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "23", "# Feasible Runs": "1", "# Integer Variables": "3", "# Non-Zero Coefficients": "62", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0.0", "CPU Runtime": "0.01", "Coefficients Range": "1.0 - 50.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "2024-12-23 09:32:08", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "0.0", "Other HW Runtime": "N/A", "Problem": "ms_03_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.16", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_002/ms_03_050_002_summary.csv:1", "instance": "ms_03_050_002", "instance_dir": "ms_03_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_002/README.md", "submission_set": "20241224_Gurobi_Schicker", "summary_csv": "01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_002/ms_03_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/ms_03_050_002/ms_03_050_002_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "26", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "250.114951", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_200_500", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.108209", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_500/ms_07_200_500_summary.csv:1", "instance": "ms_07_200_500", "instance_dir": "ms_07_200_500", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_500/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_500/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_500/ms_07_200_500_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_500/ms_07_200_500_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "36", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "163.810138", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_200_398", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.100455", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_398/ms_07_200_398_summary.csv:1", "instance": "ms_07_200_398", "instance_dir": "ms_07_200_398", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_398/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_398/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_398/ms_07_200_398_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_398/ms_07_200_398_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "19", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "439.490541", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_200_370", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.101658", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_370/ms_07_200_370_summary.csv:1", "instance": "ms_07_200_370", "instance_dir": "ms_07_200_370", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_370/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_370/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_370/ms_07_200_370_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_370/ms_07_200_370_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "22", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "43.492901", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_200_248", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.101984", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_248/ms_07_200_248_summary.csv:1", "instance": "ms_07_200_248", "instance_dir": "ms_07_200_248", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_248/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_248/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_248/ms_07_200_248_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_200_248/ms_07_200_248_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "21.152795", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_100_006", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.107245", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_006/ms_07_100_006_summary.csv:1", "instance": "ms_07_100_006", "instance_dir": "ms_07_100_006", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_006/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_006/ms_07_100_006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_006/ms_07_100_006_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "12", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "214.164549", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_100_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.101031", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_005/ms_07_100_005_summary.csv:1", "instance": "ms_07_100_005", "instance_dir": "ms_07_100_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_005/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_005/ms_07_100_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_005/ms_07_100_005_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "565.359368", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.100547", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_003/ms_07_100_003_summary.csv:1", "instance": "ms_07_100_003", "instance_dir": "ms_07_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_003/ms_07_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_003/ms_07_100_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "7", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "269.797455", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_100_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.101912", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_002/ms_07_100_002_summary.csv:1", "instance": "ms_07_100_002", "instance_dir": "ms_07_100_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_002/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_002/ms_07_100_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_100_002/ms_07_100_002_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "572.398602", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.098002", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_004/ms_07_050_004_summary.csv:1", "instance": "ms_07_050_004", "instance_dir": "ms_07_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_004/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_004/ms_07_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_004/ms_07_050_004_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "388.312831", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.108237", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_003/ms_07_050_003_summary.csv:1", "instance": "ms_07_050_003", "instance_dir": "ms_07_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_003/ms_07_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_003/ms_07_050_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "377.349501", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.101964", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_002/ms_07_050_002_summary.csv:1", "instance": "ms_07_050_002", "instance_dir": "ms_07_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_002/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_002/ms_07_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_002/ms_07_050_002_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "60", "# Continuous Variables": "N/A", "# Decision Variables": "60", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "3540", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "240.072076", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_07_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.099805", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_001/ms_07_050_001_summary.csv:1", "instance": "ms_07_050_001", "instance_dir": "ms_07_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_001/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_001/ms_07_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_07_050_001/ms_07_050_001_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "473.357777", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_200_289", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "473.575552", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_289/ms_06_200_289_summary.csv:1", "instance": "ms_06_200_289", "instance_dir": "ms_06_200_289", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_289/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_289/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_289/ms_06_200_289_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_289/ms_06_200_289_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "1491.064358", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_200_240", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.099547", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_240/ms_06_200_240_summary.csv:1", "instance": "ms_06_200_240", "instance_dir": "ms_06_200_240", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_240/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_240/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_240/ms_06_200_240_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_240/ms_06_200_240_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "4762.015846", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_200_104", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.099811", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_104/ms_06_200_104_summary.csv:1", "instance": "ms_06_200_104", "instance_dir": "ms_06_200_104", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_104/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_104/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_104/ms_06_200_104_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_104/ms_06_200_104_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "3", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "1069.543557", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_200_077", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.109388", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_077/ms_06_200_077_summary.csv:1", "instance": "ms_06_200_077", "instance_dir": "ms_06_200_077", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_077/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_077/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_077/ms_06_200_077_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_200_077/ms_06_200_077_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "2052.171214", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_100_010", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "2052.40022", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_010/ms_06_100_010_summary.csv:1", "instance": "ms_06_100_010", "instance_dir": "ms_06_100_010", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_010/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_010/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_010/ms_06_100_010_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_010/ms_06_100_010_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "1326.377668", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_100_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7200.102591", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_005/ms_06_100_005_summary.csv:1", "instance": "ms_06_100_005", "instance_dir": "ms_06_100_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_005/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_005/ms_06_100_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_005/ms_06_100_005_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "1", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "319.730265", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.103222", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_003/ms_06_100_003_summary.csv:1", "instance": "ms_06_100_003", "instance_dir": "ms_06_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_003/ms_06_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_003/ms_06_100_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "2", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "138.784167", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_100_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "600.110226", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_002/ms_06_100_002_summary.csv:1", "instance": "ms_06_100_002", "instance_dir": "ms_06_100_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_002/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_002/ms_06_100_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_100_002/ms_06_100_002_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "31.279635", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "31.489273", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_004/ms_06_050_004_summary.csv:1", "instance": "ms_06_050_004", "instance_dir": "ms_06_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_004/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_004/ms_06_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_004/ms_06_050_004_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "154.648331", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "154.872018", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_003/ms_06_050_003_summary.csv:1", "instance": "ms_06_050_003", "instance_dir": "ms_06_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_003/ms_06_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_003/ms_06_050_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "62.324224", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "62.551974", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_002/ms_06_050_002_summary.csv:1", "instance": "ms_06_050_002", "instance_dir": "ms_06_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_002/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_002/ms_06_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_002/ms_06_050_002_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "50", "# Continuous Variables": "N/A", "# Decision Variables": "50", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "2450", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "3230.788124", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_06_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "3230.997628", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_001/ms_06_050_001_summary.csv:1", "instance": "ms_06_050_001", "instance_dir": "ms_06_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_001/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_001/ms_06_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_06_050_001/ms_06_050_001_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "2.210924", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_200_199", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "2.46601", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_199/ms_05_200_199_summary.csv:1", "instance": "ms_05_200_199", "instance_dir": "ms_05_200_199", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_199/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_199/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_199/ms_05_200_199_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_199/ms_05_200_199_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "159.38805", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_200_180", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "159.687087", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_180/ms_05_200_180_summary.csv:1", "instance": "ms_05_200_180", "instance_dir": "ms_05_200_180", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_180/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_180/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_180/ms_05_200_180_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_180/ms_05_200_180_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "309.00099", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_200_095", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "309.270877", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_095/ms_05_200_095_summary.csv:1", "instance": "ms_05_200_095", "instance_dir": "ms_05_200_095", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_095/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_095/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_095/ms_05_200_095_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_095/ms_05_200_095_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "46.726541", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_200_070", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "47.028723", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_070/ms_05_200_070_summary.csv:1", "instance": "ms_05_200_070", "instance_dir": "ms_05_200_070", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_070/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_070/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_070/ms_05_200_070_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_200_070/ms_05_200_070_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "166.872326", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_100_015", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "167.173741", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_015/ms_05_100_015_summary.csv:1", "instance": "ms_05_100_015", "instance_dir": "ms_05_100_015", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_015/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_015/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_015/ms_05_100_015_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_015/ms_05_100_015_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "159.847498", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_100_013", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "160.121463", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_013/ms_05_100_013_summary.csv:1", "instance": "ms_05_100_013", "instance_dir": "ms_05_100_013", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_013/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_013/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_013/ms_05_100_013_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_013/ms_05_100_013_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "225.154894", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_100_006", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "225.430747", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_006/ms_05_100_006_summary.csv:1", "instance": "ms_05_100_006", "instance_dir": "ms_05_100_006", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_006/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_006/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_006/ms_05_100_006_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_006/ms_05_100_006_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "7.516691", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "7.774432", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_003/ms_05_100_003_summary.csv:1", "instance": "ms_05_100_003", "instance_dir": "ms_05_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_003/ms_05_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_100_003/ms_05_100_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "5.880548", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "6.18652", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_004/ms_05_050_004_summary.csv:1", "instance": "ms_05_050_004", "instance_dir": "ms_05_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_004/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_004/ms_05_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_004/ms_05_050_004_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "5.573821", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "5.849204", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_003/ms_05_050_003_summary.csv:1", "instance": "ms_05_050_003", "instance_dir": "ms_05_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_003/ms_05_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_003/ms_05_050_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "31.475072", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "31.750981", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_002/ms_05_050_002_summary.csv:1", "instance": "ms_05_050_002", "instance_dir": "ms_05_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_002/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_002/ms_05_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_002/ms_05_050_002_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "40", "# Continuous Variables": "N/A", "# Decision Variables": "40", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "1560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "9.349004", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_05_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "9.60591", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_001/ms_05_050_001_summary.csv:1", "instance": "ms_05_050_001", "instance_dir": "ms_05_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_001/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_001/ms_05_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_05_050_001/ms_05_050_001_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.022476", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_200_176", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.386963", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_176/ms_04_200_176_summary.csv:1", "instance": "ms_04_200_176", "instance_dir": "ms_04_200_176", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_176/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_176/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_176/ms_04_200_176_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_176/ms_04_200_176_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "1.47368", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_200_174", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "1.879598", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_174/ms_04_200_174_summary.csv:1", "instance": "ms_04_200_174", "instance_dir": "ms_04_200_174", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_174/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_174/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_174/ms_04_200_174_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_174/ms_04_200_174_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.042412", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_200_150", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.505015", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_150/ms_04_200_150_summary.csv:1", "instance": "ms_04_200_150", "instance_dir": "ms_04_200_150", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_150/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_150/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_150/ms_04_200_150_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_150/ms_04_200_150_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.214902", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_200_030", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.61052", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_030/ms_04_200_030_summary.csv:1", "instance": "ms_04_200_030", "instance_dir": "ms_04_200_030", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_030/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_030/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_030/ms_04_200_030_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_200_030/ms_04_200_030_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.023687", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_100_015", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.368127", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_015/ms_04_100_015_summary.csv:1", "instance": "ms_04_100_015", "instance_dir": "ms_04_100_015", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_015/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_015/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_015/ms_04_100_015_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_015/ms_04_100_015_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.002627", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_100_013", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.236793", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_013/ms_04_100_013_summary.csv:1", "instance": "ms_04_100_013", "instance_dir": "ms_04_100_013", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_013/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_013/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_013/ms_04_100_013_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_013/ms_04_100_013_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.693132", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_100_009", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "1.079545", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_009/ms_04_100_009_summary.csv:1", "instance": "ms_04_100_009", "instance_dir": "ms_04_100_009", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_009/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_009/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_009/ms_04_100_009_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_009/ms_04_100_009_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.024747", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_100_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.407428", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_003/ms_04_100_003_summary.csv:1", "instance": "ms_04_100_003", "instance_dir": "ms_04_100_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_003/ms_04_100_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_100_003/ms_04_100_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.020773", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_050_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.323827", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_005/ms_04_050_005_summary.csv:1", "instance": "ms_04_050_005", "instance_dir": "ms_04_050_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_005/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_005/ms_04_050_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_005/ms_04_050_005_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.198428", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_050_004", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.638373", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_004/ms_04_050_004_summary.csv:1", "instance": "ms_04_050_004", "instance_dir": "ms_04_050_004", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_004/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_004/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_004/ms_04_050_004_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_004/ms_04_050_004_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.135708", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_050_003", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.530695", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_003/ms_04_050_003_summary.csv:1", "instance": "ms_04_050_003", "instance_dir": "ms_04_050_003", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_003/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_003/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_003/ms_04_050_003_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_003/ms_04_050_003_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "N/A", "# Decision Variables": "30", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "870", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.008391", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_04_050_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.231479", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_001/ms_04_050_001_summary.csv:1", "instance": "ms_04_050_001", "instance_dir": "ms_04_050_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_001/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_001/ms_04_050_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_04_050_001/ms_04_050_001_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.002031", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_200_177", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.251363", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_177/ms_03_200_177_summary.csv:1", "instance": "ms_03_200_177", "instance_dir": "ms_03_200_177", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_177/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_177/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_177/ms_03_200_177_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_177/ms_03_200_177_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.001192", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_200_161", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.246673", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_161/ms_03_200_161_summary.csv:1", "instance": "ms_03_200_161", "instance_dir": "ms_03_200_161", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_161/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_161/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_161/ms_03_200_161_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_161/ms_03_200_161_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.004224", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_200_068", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.267825", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_068/ms_03_200_068_summary.csv:1", "instance": "ms_03_200_068", "instance_dir": "ms_03_200_068", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_068/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_068/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_068/ms_03_200_068_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_068/ms_03_200_068_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.007963", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_200_050", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.246465", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_050/ms_03_200_050_summary.csv:1", "instance": "ms_03_200_050", "instance_dir": "ms_03_200_050", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_050/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_050/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_050/ms_03_200_050_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_200_050/ms_03_200_050_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.003099", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_100_022", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.260394", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_022/ms_03_100_022_summary.csv:1", "instance": "ms_03_100_022", "instance_dir": "ms_03_100_022", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_022/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_022/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_022/ms_03_100_022_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_022/ms_03_100_022_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.008741", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_100_019", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.259412", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_019/ms_03_100_019_summary.csv:1", "instance": "ms_03_100_019", "instance_dir": "ms_03_100_019", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_019/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_019/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_019/ms_03_100_019_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_019/ms_03_100_019_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.002322", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_100_012", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.267623", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_012/ms_03_100_012_summary.csv:1", "instance": "ms_03_100_012", "instance_dir": "ms_03_100_012", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_012/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_012/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_012/ms_03_100_012_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_012/ms_03_100_012_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.004725", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_100_001", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.258647", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_001/ms_03_100_001_summary.csv:1", "instance": "ms_03_100_001", "instance_dir": "ms_03_100_001", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_001/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_001/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_001/ms_03_100_001_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_100_001/ms_03_100_001_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.003489", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_050_009", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.247072", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_009/ms_03_050_009_summary.csv:1", "instance": "ms_03_050_009", "instance_dir": "ms_03_050_009", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_009/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_009/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_009/ms_03_050_009_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_009/ms_03_050_009_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "378", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.000614", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_050_007", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.219634", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_007/ms_03_050_007_summary.csv:1", "instance": "ms_03_050_007", "instance_dir": "ms_03_050_007", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_007/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_007/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_007/ms_03_050_007_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_007/ms_03_050_007_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.002293", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_050_005", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.240276", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_005/ms_03_050_005_summary.csv:1", "instance": "ms_03_050_005", "instance_dir": "ms_03_050_005", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_005/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_005/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_005/ms_03_050_005_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_005/ms_03_050_005_summary.csv" }, { "date_key": "2024-12-22T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "N/A", "# Decision Variables": "20", "# Feasible Runs": "1", "# Integer Variables": "N/A", "# Non-Zero Coefficients": "380", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "0", "CPU Runtime": "N/A", "Coefficients Range": "N/A - N/A", "Coefficients Type": "Integer", "Date": "22. Dec. 2024", "GPU Runtime": "0.003595", "Hardware Specifications": "Four NVIDIA Tesla V100-SXM2-16GB: CUDA 12.2", "Modeling Approach": "QUBO", "Optimality Bound": "N/A", "Other HW Runtime": "N/A", "Problem": "ms_03_050_002", "QPU Runtime": "N/A", "Reference": "See Models Directory using abs2", "Remarks": "GPU Runtime is Time to solution (TTS)", "Submitter": "Maximilian Schicker", "Success Threshold": "N/A", "Total Runtime": "0.251919", "Workflow": "Generate QS files using ZIMPL, solve using abs2" }, "id": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_002/ms_03_050_002_summary.csv:1", "instance": "ms_03_050_002", "instance_dir": "ms_03_050_002", "problem_dir": "01-marketsplit", "problem_number": "01", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_002/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_002/README.md", "submission_set": "20241222_Abs2_Schicker", "summary_csv": "01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_002/ms_03_050_002_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/ms_03_050_002/ms_03_050_002_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "421400", "# Continuous Variables": "0", "# Decision Variables": "421401", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "13475", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "9193.05", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_50_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/topology_50_4_summary.csv:1", "instance": "topology_50_4", "instance_dir": "topology_50_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/topology_50_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_50_4/topology_50_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "365820", "# Continuous Variables": "0", "# Decision Variables": "365821", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "12480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "10784.75", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_40_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/topology_40_6_summary.csv:1", "instance": "topology_40_6", "instance_dir": "topology_40_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/topology_40_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_40_6/topology_40_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "81515", "# Continuous Variables": "0", "# Decision Variables": "81516", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "4760", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "13512.11", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_35_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/topology_35_6_summary.csv:1", "instance": "topology_35_6", "instance_dir": "topology_35_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/topology_35_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_6/topology_35_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "142205", "# Continuous Variables": "0", "# Decision Variables": "142206", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "6545", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "7631.42", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_35_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/topology_35_5_summary.csv:1", "instance": "topology_35_5", "instance_dir": "topology_35_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/topology_35_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_35_5/topology_35_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "50895", "# Continuous Variables": "0", "# Decision Variables": "50896", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "3480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "9625.32", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_30_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.31", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/topology_30_6_summary.csv:1", "instance": "topology_30_6", "instance_dir": "topology_30_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/topology_30_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_6/topology_30_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "76125", "# Continuous Variables": "0", "# Decision Variables": "76126", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "4350", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "1748.33", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_30_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1209.86", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/topology_30_5_summary.csv:1", "instance": "topology_30_5", "instance_dir": "topology_30_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/topology_30_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_5/topology_30_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "88740", "# Continuous Variables": "0", "# Decision Variables": "88741", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "4785", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "9559.58", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_30_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_4/topology_30_4_summary.csv:1", "instance": "topology_30_4", "instance_dir": "topology_30_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_4/topology_30_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_30_4/topology_30_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "7500", "# Continuous Variables": "0", "# Decision Variables": "7500", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1500", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "51.75", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_25_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "36.82", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/topology_25_6_summary.csv:1", "instance": "topology_25_6", "instance_dir": "topology_25_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/topology_25_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_6/topology_25_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "36300", "# Continuous Variables": "0", "# Decision Variables": "36301", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "2700", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "224.69", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_25_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "158.43", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/topology_25_5_summary.csv:1", "instance": "topology_25_5", "instance_dir": "topology_25_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/topology_25_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_5/topology_25_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "43500", "# Continuous Variables": "0", "# Decision Variables": "43501", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "3000", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "462.46", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_25_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "380.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/topology_25_4_summary.csv:1", "instance": "topology_25_4", "instance_dir": "topology_25_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/topology_25_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_4/topology_25_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "65100", "# Continuous Variables": "0", "# Decision Variables": "65101", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "3900", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "4947.78", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "topology_25_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3934.27", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/topology_25_3_summary.csv:1", "instance": "topology_25_3", "instance_dir": "topology_25_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/topology_25_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_25_3/topology_25_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "3800", "# Continuous Variables": "0", "# Decision Variables": "3800", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "950", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "20.56", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6246 CPU @ 3.30GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_20_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "14.34", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/topology_20_5_summary.csv:1", "instance": "topology_20_5", "instance_dir": "topology_20_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/topology_20_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_5/topology_20_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "7410", "# Continuous Variables": "0", "# Decision Variables": "7410", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "1140", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "5.42", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6246 CPU @ 3.30GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_20_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3.9", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/topology_20_4_summary.csv:1", "instance": "topology_20_4", "instance_dir": "topology_20_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/topology_20_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_4/topology_20_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "11020", "# Continuous Variables": "0", "# Decision Variables": "11021", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "1330", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "81.07", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_20_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "61.94", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/topology_20_3_summary.csv:1", "instance": "topology_20_3", "instance_dir": "topology_20_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/topology_20_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_20_3/topology_20_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "1575", "# Continuous Variables": "0", "# Decision Variables": "1575", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "525", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "0.65", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6246 CPU @ 3.30GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_15_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.13", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/topology_15_4_summary.csv:1", "instance": "topology_15_4", "instance_dir": "topology_15_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/topology_15_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_4/topology_15_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "3045", "# Continuous Variables": "0", "# Decision Variables": "3045", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "630", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "3.47", "Coefficients Range": "1.0 - 1.0, 1.0 - 1.0, 1.0 - 1.0", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6246 CPU @ 3.30GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Quadratic Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_15_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Quadratic) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "2.68", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/topology_15_3_summary.csv:1", "instance": "topology_15_3", "instance_dir": "topology_15_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/README.md", "submission_set": "20241206_Gurobi-Seidel-Quadratic_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/topology_15_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/topology_15_3/topology_15_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "421400", "# Continuous Variables": "0", "# Decision Variables": "421401", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "2088625", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "", "CPU Runtime": "6346.26", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "nan", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_50_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi nan", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.02", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_50_4/topology_50_4_summary.csv:1", "instance": "topology_50_4", "instance_dir": "topology_50_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_50_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_50_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_50_4/topology_50_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_50_4/topology_50_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "365820", "# Continuous Variables": "0", "# Decision Variables": "365821", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "1809600", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "12.0", "CPU Runtime": "10288.69", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_40_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_40_6/topology_40_6_summary.csv:1", "instance": "topology_40_6", "instance_dir": "topology_40_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_40_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_40_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_40_6/topology_40_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_40_6/topology_40_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "81515", "# Continuous Variables": "0", "# Decision Variables": "81516", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "402220", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "11302.63", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_35_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_6/topology_35_6_summary.csv:1", "instance": "topology_35_6", "instance_dir": "topology_35_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_6/topology_35_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_6/topology_35_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "142205", "# Continuous Variables": "0", "# Decision Variables": "142206", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "702100", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "8923.79", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_35_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.16", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_5/topology_35_5_summary.csv:1", "instance": "topology_35_5", "instance_dir": "topology_35_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_5/topology_35_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_35_5/topology_35_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "50895", "# Continuous Variables": "0", "# Decision Variables": "50896", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "250560", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "9779.46", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_30_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.39", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_6/topology_30_6_summary.csv:1", "instance": "topology_30_6", "instance_dir": "topology_30_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_6/topology_30_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_6/topology_30_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "76125", "# Continuous Variables": "0", "# Decision Variables": "76126", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "374970", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "1654.73", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_30_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1009.57", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_5/topology_30_5_summary.csv:1", "instance": "topology_30_5", "instance_dir": "topology_30_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_5/topology_30_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_5/topology_30_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "88740", "# Continuous Variables": "0", "# Decision Variables": "88741", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "437175", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "8999.59", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_30_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "6487.33", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/topology_30_4_summary.csv:1", "instance": "topology_30_4", "instance_dir": "topology_30_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/topology_30_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_30_4/topology_30_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "7200", "# Continuous Variables": "0", "# Decision Variables": "7200", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "36600", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "120.4", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_25_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "94.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_6/topology_25_6_summary.csv:1", "instance": "topology_25_6", "instance_dir": "topology_25_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_6/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_6/topology_25_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_6/topology_25_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "36300", "# Continuous Variables": "0", "# Decision Variables": "36301", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "178200", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "325.97", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_25_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "210.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_5/topology_25_5_summary.csv:1", "instance": "topology_25_5", "instance_dir": "topology_25_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_5/topology_25_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_5/topology_25_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "43500", "# Continuous Variables": "0", "# Decision Variables": "43501", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "213600", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "834.11", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_25_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "497.25", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_4/topology_25_4_summary.csv:1", "instance": "topology_25_4", "instance_dir": "topology_25_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_4/topology_25_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_4/topology_25_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "65100", "# Continuous Variables": "0", "# Decision Variables": "65101", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "319800", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "4476.56", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "4.0", "Other HW Runtime": "N/A", "Problem": "topology_25_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3325.17", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_3/topology_25_3_summary.csv:1", "instance": "topology_25_3", "instance_dir": "topology_25_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_3/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_3/topology_25_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_25_3/topology_25_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "3610", "# Continuous Variables": "0", "# Decision Variables": "3610", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "18430", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "18.63", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_20_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "16.13", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_5/topology_20_5_summary.csv:1", "instance": "topology_20_5", "instance_dir": "topology_20_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_5/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_5/topology_20_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_5/topology_20_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "7410", "# Continuous Variables": "0", "# Decision Variables": "7410", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "36100", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "5.46", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_20_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3.84", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_4/topology_20_4_summary.csv:1", "instance": "topology_20_4", "instance_dir": "topology_20_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_4/topology_20_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_4/topology_20_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "11020", "# Continuous Variables": "0", "# Decision Variables": "11021", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "53770", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "77.23", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_20_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "51.55", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_3/topology_20_3_summary.csv:1", "instance": "topology_20_3", "instance_dir": "topology_20_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_3/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_3/topology_20_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_20_3/topology_20_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "1470", "# Continuous Variables": "0", "# Decision Variables": "1470", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "7560", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "2.36", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_15_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3.67", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_4/topology_15_4_summary.csv:1", "instance": "topology_15_4", "instance_dir": "topology_15_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_4/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_4/topology_15_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_4/topology_15_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "3045", "# Continuous Variables": "0", "# Decision Variables": "3045", "# Feasible Runs": "1", "# Integer Variables": "0", "# Non-Zero Coefficients": "14700", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "4.34", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Binary Linear Program", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_15_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Seidel-Linear) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3.27", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_3/topology_15_3_summary.csv:1", "instance": "topology_15_3", "instance_dir": "topology_15_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_3/README.md", "submission_set": "20241206_Gurobi-Seidel-Linear_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_3/topology_15_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/topology_15_3/topology_15_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "3002475", "# Continuous Variables": "0", "# Decision Variables": "3002476", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "15012375", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "6.0", "CPU Runtime": "8367.6", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_50_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.39", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_50_4/topology_50_4_summary.csv:1", "instance": "topology_50_4", "instance_dir": "topology_50_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_50_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_50_4/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_50_4/topology_50_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_50_4/topology_50_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "1217580", "# Continuous Variables": "0", "# Decision Variables": "1217581", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "6087900", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "7213.65", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_40_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.16", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_40_6/topology_40_6_summary.csv:1", "instance": "topology_40_6", "instance_dir": "topology_40_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_40_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_40_6/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_40_6/topology_40_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_40_6/topology_40_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "708645", "# Continuous Variables": "0", "# Decision Variables": "708646", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "3543225", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "10967.94", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_35_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_6/topology_35_6_summary.csv:1", "instance": "topology_35_6", "instance_dir": "topology_35_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_6/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_6/topology_35_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_6/topology_35_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "708645", "# Continuous Variables": "0", "# Decision Variables": "708646", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "3543225", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "6348.2", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_35_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.09", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_5/topology_35_5_summary.csv:1", "instance": "topology_35_5", "instance_dir": "topology_35_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_5/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_5/topology_35_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_35_5/topology_35_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "378885", "# Continuous Variables": "0", "# Decision Variables": "378886", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "1894425", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "9362.07", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_30_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7201.86", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_6/topology_30_6_summary.csv:1", "instance": "topology_30_6", "instance_dir": "topology_30_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_6/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_6/topology_30_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_6/topology_30_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "378885", "# Continuous Variables": "0", "# Decision Variables": "378886", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "1894425", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "6457.71", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) CPU E7-4830 v3 @ 2.10GHz, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_30_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.26", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_5/topology_30_5_summary.csv:1", "instance": "topology_30_5", "instance_dir": "topology_30_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_5/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_5/topology_30_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_5/topology_30_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "378885", "# Continuous Variables": "0", "# Decision Variables": "378886", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "1894425", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "6844.81", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) CPU E7-4830 v3 @ 2.10GHz, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_30_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.48", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_4/topology_30_4_summary.csv:1", "instance": "topology_30_4", "instance_dir": "topology_30_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_4/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_4/topology_30_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_30_4/topology_30_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "180300", "# Continuous Variables": "0", "# Decision Variables": "180301", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "901500", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "3927.72", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6338 CPU @ 2.00GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_25_6", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "3101.31", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_6/topology_25_6_summary.csv:1", "instance": "topology_25_6", "instance_dir": "topology_25_6", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_6/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_6/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_6/topology_25_6_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_6/topology_25_6_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "180300", "# Continuous Variables": "0", "# Decision Variables": "180301", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "901500", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "5902.12", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) CPU E5-2680 v4 @ 2.40GHz, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_25_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.18", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_5/topology_25_5_summary.csv:1", "instance": "topology_25_5", "instance_dir": "topology_25_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_5/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_5/topology_25_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_5/topology_25_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "180300", "# Continuous Variables": "0", "# Decision Variables": "180301", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "901500", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "5.0", "CPU Runtime": "6364.88", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) CPU E5-2680 v4 @ 2.40GHz, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_25_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.72", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_4/topology_25_4_summary.csv:1", "instance": "topology_25_4", "instance_dir": "topology_25_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_4/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_4/topology_25_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_4/topology_25_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "180300", "# Continuous Variables": "0", "# Decision Variables": "180301", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "901500", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "4.0", "CPU Runtime": "7839.07", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6246 CPU @ 3.30GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_25_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.66", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_3/topology_25_3_summary.csv:1", "instance": "topology_25_3", "instance_dir": "topology_25_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_3/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_3/topology_25_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_25_3/topology_25_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "72390", "# Continuous Variables": "0", "# Decision Variables": "72391", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "361950", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "536.05", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_20_5", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "342.91", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_5/topology_20_5_summary.csv:1", "instance": "topology_20_5", "instance_dir": "topology_20_5", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_5/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_5/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_5/topology_20_5_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_5/topology_20_5_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "72390", "# Continuous Variables": "0", "# Decision Variables": "72391", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "361950", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "1881.2", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_20_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1150.18", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_4/topology_20_4_summary.csv:1", "instance": "topology_20_4", "instance_dir": "topology_20_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_4/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_4/topology_20_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_4/topology_20_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "72390", "# Continuous Variables": "0", "# Decision Variables": "72391", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "361950", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "1888.27", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_20_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1424.35", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_3/topology_20_3_summary.csv:1", "instance": "topology_20_3", "instance_dir": "topology_20_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_3/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_3/topology_20_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_20_3/topology_20_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "22155", "# Continuous Variables": "0", "# Decision Variables": "22156", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "110775", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "2.0", "CPU Runtime": "12.27", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "2.0", "Other HW Runtime": "N/A", "Problem": "topology_15_4", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "9.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_4/topology_15_4_summary.csv:1", "instance": "topology_15_4", "instance_dir": "topology_15_4", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_4/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_4/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_4/topology_15_4_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_4/topology_15_4_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "22155", "# Continuous Variables": "0", "# Decision Variables": "22156", "# Feasible Runs": "1", "# Integer Variables": "1", "# Non-Zero Coefficients": "110775", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "3.0", "CPU Runtime": "133.9", "Coefficients Range": "1.0 - 1.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "Intel(R) Xeon(R) Gold 6342 CPU @ 2.80GHz, instruction set [SSE2|AVX|AVX2|AVX512]", "Modeling Approach": "Flow MIP", "Optimality Bound": "3.0", "Other HW Runtime": "N/A", "Problem": "topology_15_3", "QPU Runtime": "N/A", "Reference": "See Models Directory (Flow) using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "94.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_3/topology_15_3_summary.csv:1", "instance": "topology_15_3", "instance_dir": "topology_15_3", "problem_dir": "10-topology", "problem_number": "10", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_3/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_3/README.md", "submission_set": "20241206_Gurobi-Flow_Schicker", "summary_csv": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_3/topology_15_3_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/topology_15_3/topology_15_3_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "552", "# Continuous Variables": "0", "# Decision Variables": "13249", "# Feasible Runs": "1", "# Integer Variables": "12697", "# Non-Zero Coefficients": "64584", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "779410.0", "CPU Runtime": "10122.58", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "224386.0", "Other HW Runtime": "N/A", "Problem": "network24", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.1", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network24/network24_summary.csv:1", "instance": "network24", "instance_dir": "network24", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network24/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network24/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network24/network24_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network24/network24_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "506", "# Continuous Variables": "0", "# Decision Variables": "11639", "# Feasible Runs": "1", "# Integer Variables": "11133", "# Non-Zero Coefficients": "56672", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "749923.0", "CPU Runtime": "9909.35", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "349579.0", "Other HW Runtime": "N/A", "Problem": "network23", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network23/network23_summary.csv:1", "instance": "network23", "instance_dir": "network23", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network23/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network23/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network23/network23_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network23/network23_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "462", "# Continuous Variables": "0", "# Decision Variables": "10165", "# Feasible Runs": "1", "# Integer Variables": "9703", "# Non-Zero Coefficients": "49434", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "709597.0", "CPU Runtime": "11465.66", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "192877.0", "Other HW Runtime": "N/A", "Problem": "network22", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.07", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network22/network22_summary.csv:1", "instance": "network22", "instance_dir": "network22", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network22/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network22/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network22/network22_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network22/network22_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "420", "# Continuous Variables": "0", "# Decision Variables": "8821", "# Feasible Runs": "1", "# Integer Variables": "8401", "# Non-Zero Coefficients": "42840", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "641249.0", "CPU Runtime": "12019.13", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "353739.0505284", "Other HW Runtime": "N/A", "Problem": "network21", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network21/network21_summary.csv:1", "instance": "network21", "instance_dir": "network21", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network21/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network21/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network21/network21_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network21/network21_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "380", "# Continuous Variables": "0", "# Decision Variables": "7601", "# Feasible Runs": "1", "# Integer Variables": "7221", "# Non-Zero Coefficients": "36860", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "570974.0", "CPU Runtime": "10709.52", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "351740.0", "Other HW Runtime": "N/A", "Problem": "network20", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network20/network20_summary.csv:1", "instance": "network20", "instance_dir": "network20", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network20/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network20/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network20/network20_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network20/network20_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "342", "# Continuous Variables": "0", "# Decision Variables": "6499", "# Feasible Runs": "1", "# Integer Variables": "6157", "# Non-Zero Coefficients": "31464", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "565570.0", "CPU Runtime": "9457.25", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "337091.0", "Other HW Runtime": "N/A", "Problem": "network19", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network19/network19_summary.csv:1", "instance": "network19", "instance_dir": "network19", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network19/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network19/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network19/network19_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network19/network19_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "306", "# Continuous Variables": "0", "# Decision Variables": "5509", "# Feasible Runs": "1", "# Integer Variables": "5203", "# Non-Zero Coefficients": "26622", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "517398.0", "CPU Runtime": "11202.12", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "336326.0", "Other HW Runtime": "N/A", "Problem": "network18", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.06", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network18/network18_summary.csv:1", "instance": "network18", "instance_dir": "network18", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network18/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network18/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network18/network18_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network18/network18_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "272", "# Continuous Variables": "0", "# Decision Variables": "4625", "# Feasible Runs": "1", "# Integer Variables": "4353", "# Non-Zero Coefficients": "22304", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "488699.0", "CPU Runtime": "12251.75", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "280281.0", "Other HW Runtime": "N/A", "Problem": "network17", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.12", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network17/network17_summary.csv:1", "instance": "network17", "instance_dir": "network17", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network17/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network17/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network17/network17_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network17/network17_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "240", "# Continuous Variables": "0", "# Decision Variables": "3841", "# Feasible Runs": "1", "# Integer Variables": "3601", "# Non-Zero Coefficients": "18480", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "430000.0", "CPU Runtime": "11273.34", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "302575.2088978", "Other HW Runtime": "N/A", "Problem": "network16", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.11", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network16/network16_summary.csv:1", "instance": "network16", "instance_dir": "network16", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network16/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network16/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network16/network16_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network16/network16_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "210", "# Continuous Variables": "0", "# Decision Variables": "3151", "# Feasible Runs": "1", "# Integer Variables": "2941", "# Non-Zero Coefficients": "15120", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "397000.0", "CPU Runtime": "11797.36", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "294374.2750733", "Other HW Runtime": "N/A", "Problem": "network15", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.05", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network15/network15_summary.csv:1", "instance": "network15", "instance_dir": "network15", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network15/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network15/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network15/network15_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network15/network15_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "182", "# Continuous Variables": "0", "# Decision Variables": "2549", "# Feasible Runs": "1", "# Integer Variables": "2367", "# Non-Zero Coefficients": "12194", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "367899.0", "CPU Runtime": "12042.94", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "276522.0", "Other HW Runtime": "N/A", "Problem": "network14", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.42", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network14/network14_summary.csv:1", "instance": "network14", "instance_dir": "network14", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network14/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network14/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network14/network14_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network14/network14_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "156", "# Continuous Variables": "0", "# Decision Variables": "2029", "# Feasible Runs": "1", "# Integer Variables": "1873", "# Non-Zero Coefficients": "9672", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "313000.0", "CPU Runtime": "11423.44", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "248974.0987588", "Other HW Runtime": "N/A", "Problem": "network13", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network13/network13_summary.csv:1", "instance": "network13", "instance_dir": "network13", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network13/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network13/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network13/network13_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network13/network13_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "132", "# Continuous Variables": "0", "# Decision Variables": "1585", "# Feasible Runs": "1", "# Integer Variables": "1453", "# Non-Zero Coefficients": "7524", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "285643.0", "CPU Runtime": "11400.08", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "234765.0", "Other HW Runtime": "N/A", "Problem": "network12", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.08", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network12/network12_summary.csv:1", "instance": "network12", "instance_dir": "network12", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network12/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network12/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network12/network12_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network12/network12_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "110", "# Continuous Variables": "0", "# Decision Variables": "1211", "# Feasible Runs": "1", "# Integer Variables": "1101", "# Non-Zero Coefficients": "5720", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "240818.0", "CPU Runtime": "12064.36", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "210366.190725", "Other HW Runtime": "N/A", "Problem": "network11", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.04", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network11/network11_summary.csv:1", "instance": "network11", "instance_dir": "network11", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network11/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network11/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network11/network11_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network11/network11_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "90", "# Continuous Variables": "0", "# Decision Variables": "901", "# Feasible Runs": "1", "# Integer Variables": "811", "# Non-Zero Coefficients": "4230", "# Runs": "1", "# Successful Runs": "0", "Algorithm Type": "Deterministic", "Best Objective Value": "210800.0", "CPU Runtime": "10053.49", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "202750.0", "Other HW Runtime": "N/A", "Problem": "network10", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "7200.03", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network10/network10_summary.csv:1", "instance": "network10", "instance_dir": "network10", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network10/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network10/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network10/network10_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network10/network10_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "72", "# Continuous Variables": "0", "# Decision Variables": "649", "# Feasible Runs": "1", "# Integer Variables": "577", "# Non-Zero Coefficients": "3024", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "196750.0", "CPU Runtime": "964.31", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "196750.0", "Other HW Runtime": "N/A", "Problem": "network09", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "620.56", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network09/network09_summary.csv:1", "instance": "network09", "instance_dir": "network09", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network09/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network09/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network09/network09_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network09/network09_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "56", "# Continuous Variables": "0", "# Decision Variables": "449", "# Feasible Runs": "1", "# Integer Variables": "393", "# Non-Zero Coefficients": "2072", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "170231.0", "CPU Runtime": "28.82", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "170231.0", "Other HW Runtime": "N/A", "Problem": "network08", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "21.77", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network08/network08_summary.csv:1", "instance": "network08", "instance_dir": "network08", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network08/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network08/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network08/network08_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network08/network08_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "42", "# Continuous Variables": "0", "# Decision Variables": "295", "# Feasible Runs": "1", "# Integer Variables": "253", "# Non-Zero Coefficients": "1344", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "142400.0", "CPU Runtime": "1.4", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "142400.0", "Other HW Runtime": "N/A", "Problem": "network07", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "1.61", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network07/network07_summary.csv:1", "instance": "network07", "instance_dir": "network07", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network07/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network07/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network07/network07_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network07/network07_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "30", "# Continuous Variables": "0", "# Decision Variables": "181", "# Feasible Runs": "1", "# Integer Variables": "151", "# Non-Zero Coefficients": "810", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "101000.0", "CPU Runtime": "0.25", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "101000.0", "Other HW Runtime": "N/A", "Problem": "network06", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.51", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network06/network06_summary.csv:1", "instance": "network06", "instance_dir": "network06", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network06/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network06/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network06/network06_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network06/network06_summary.csv" }, { "date_key": "2024-12-06T00:00:00", "fields": { "# Binary Variables": "20", "# Continuous Variables": "0", "# Decision Variables": "101", "# Feasible Runs": "1", "# Integer Variables": "81", "# Non-Zero Coefficients": "440", "# Runs": "1", "# Successful Runs": "1", "Algorithm Type": "Deterministic", "Best Objective Value": "65500.0", "CPU Runtime": "0.03", "Coefficients Range": "1.0 - 1000000.0, N/A - N/A, N/A - N/A", "Coefficients Type": "Integer", "Date": "06. Dec. 2024", "GPU Runtime": "N/A", "Hardware Specifications": "AMD EPYC 7542 32-Core Processor, instruction set [SSE2|AVX|AVX2]", "Modeling Approach": "Integer Linear Program", "Optimality Bound": "65500.0", "Other HW Runtime": "N/A", "Problem": "network05", "QPU Runtime": "N/A", "Reference": "See Models Directory using Gurobi 11.0.0", "Remarks": "CPU Runtime is Gurobi Work Measure, Success Threshold is the MIP Gap tolerance, variable counts are after presolve, Coefficient Range is (Min - Max) for (Linear, Quadratic, Quadratic Linear) coefficients", "Submitter": "Maximilian Schicker", "Success Threshold": "0.0001", "Total Runtime": "0.14", "Workflow": "Generate LP files using ZIMPL, solve using Gurobi" }, "id": "08-network/submissions/20250102_Gurobi_Schicker/network05/network05_summary.csv:1", "instance": "network05", "instance_dir": "network05", "problem_dir": "08-network", "problem_number": "08", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/network05/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network05/README.md", "submission_set": "20250102_Gurobi_Schicker", "summary_csv": "08-network/submissions/20250102_Gurobi_Schicker/network05/network05_summary.csv", "summary_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/network05/network05_summary.csv" } ], "submission_sets": [ { "algorithm_types": [ "Stochastic" ], "date_key": "2026-03-08T00:00:00", "instance_count": 4, "modeling_approaches": [ "QUBO" ], "name": "20260308_Arvak_Hinderink", "path": "07-independentset/submissions/20260308_Arvak_Hinderink", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "readme_path": "", "readme_url": "", "result_count": 3, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20260308_Arvak_Hinderink", "submitted_instance_count": 3, "submitters": [ "Daniel Hinderink (hiq-lab)" ] }, { "algorithm_types": [ "Stochastic" ], "date_key": "2026-03-08T00:00:00", "instance_count": 3, "modeling_approaches": [ "QUBO" ], "name": "20260308_Arvak_Hinderink", "path": "06-portfolio/submissions/20260308_Arvak_Hinderink", "problem_dir": "06-portfolio", "problem_title": "Portfolio Optimization", "readme_path": "", "readme_url": "", "result_count": 2, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20260308_Arvak_Hinderink", "submitted_instance_count": 2, "submitters": [ "Daniel Hinderink (hiq-lab)" ] }, { "algorithm_types": [ "Stochastic" ], "date_key": "2026-03-08T00:00:00", "instance_count": 2, "modeling_approaches": [ "QUBO" ], "name": "20260308_Arvak_Hinderink", "path": "02-labs/submissions/20260308_Arvak_Hinderink", "problem_dir": "02-labs", "problem_title": "LABS", "readme_path": "", "readme_url": "", "result_count": 1, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260308_Arvak_Hinderink", "submitted_instance_count": 1, "submitters": [ "Daniel Hinderink (hiq-lab)" ] }, { "algorithm_types": [ "Stochastic" ], "date_key": "2026-03-08T00:00:00", "instance_count": 2, "modeling_approaches": [ "QUBO" ], "name": "20260308_Arvak_Hinderink", "path": "01-marketsplit/submissions/20260308_Arvak_Hinderink", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "readme_path": "", "readme_url": "", "result_count": 1, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20260308_Arvak_Hinderink", "submitted_instance_count": 1, "submitters": [ "Daniel Hinderink (hiq-lab)" ] }, { "algorithm_types": [ "stochastic" ], "date_key": "2026-02-09T00:00:00", "instance_count": 9, "modeling_approaches": [ "PUBO" ], "name": "20260209_QAOA_AQT", "path": "02-labs/submissions/20260209_QAOA_AQT", "problem_dir": "02-labs", "problem_title": "LABS", "readme_path": "02-labs/submissions/20260209_QAOA_AQT/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT/README.md", "result_count": 8, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20260209_QAOA_AQT", "submitted_instance_count": 4, "submitters": [ "Angelika Widl (Math.Tec), Daniel Egger (IBM), Juris Ulmanis (AQT), Christoph Regner (Math.Tec)" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2026-01-10T20:53:28", "instance_count": 80, "modeling_approaches": [ "Binary Linear Program" ], "name": "20260111_Gurobi_Schicker", "path": "03-birkhoff/submissions/20260111_Gurobi_Schicker", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "", "readme_url": "", "result_count": 80, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20260111_Gurobi_Schicker", "submitted_instance_count": 80, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [], "date_key": "2025-08-22T00:00:00", "instance_count": 16, "modeling_approaches": [], "name": "20250822_Abs2_Schicker", "path": "06-portfolio/submissions/20250822_Abs2_Schicker", "problem_dir": "06-portfolio", "problem_title": "Portfolio Optimization", "readme_path": "06-portfolio/submissions/20250822_Abs2_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20250822_Abs2_Schicker/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20250822_Abs2_Schicker", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [], "date_key": "2025-08-19T00:00:00", "instance_count": 16, "modeling_approaches": [], "name": "20250819_Gurobi_Schicker", "path": "06-portfolio/submissions/20250819_Gurobi_Schicker", "problem_dir": "06-portfolio", "problem_title": "Portfolio Optimization", "readme_path": "06-portfolio/submissions/20250819_Gurobi_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20250819_Gurobi_Schicker/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/06-portfolio/submissions/20250819_Gurobi_Schicker", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [], "date_key": "2025-08-06T00:00:00", "instance_count": 14, "modeling_approaches": [], "name": "20250806_Classic_Valls", "path": "03-birkhoff/submissions/20250806_Classic_Valls", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20250806_Classic_Valls/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20250806_Classic_Valls/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20250806_Classic_Valls", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2025-07-15T19:42:09", "instance_count": 50, "modeling_approaches": [ "Binary Linear Program" ], "name": "20250715_Gurobi_Schicker", "path": "07-independentset/submissions/20250715_Gurobi_Schicker", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Gurobi_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker/README.md", "result_count": 50, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Gurobi_Schicker", "submitted_instance_count": 50, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2025-07-15T00:00:00", "instance_count": 50, "modeling_approaches": [ "QUBO" ], "name": "20250715_Abs2_Schicker", "path": "07-independentset/submissions/20250715_Abs2_Schicker", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "readme_path": "07-independentset/submissions/20250715_Abs2_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker/README.md", "result_count": 50, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250715_Abs2_Schicker", "submitted_instance_count": 50, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [], "date_key": "2025-07-15T00:00:00", "instance_count": 1, "modeling_approaches": [], "name": "20250715_SchroeppelShamir_Kempke", "path": "01-marketsplit/submissions/20250715_SchroeppelShamir_Kempke", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20250715_SchroeppelShamir_Kempke/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20250715_SchroeppelShamir_Kempke/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20250715_SchroeppelShamir_Kempke", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [], "date_key": "2025-07-15T00:00:00", "instance_count": 2, "modeling_approaches": [], "name": "20250715_Lattice_Wassermann", "path": "01-marketsplit/submissions/20250715_Lattice_Wassermann", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20250715_Lattice_Wassermann/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20250715_Lattice_Wassermann/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20250715_Lattice_Wassermann", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2025-06-27T00:00:00", "instance_count": 6, "modeling_approaches": [ "QUBO" ], "name": "20250627_Quicopt_Bode", "path": "07-independentset/submissions/20250627_Quicopt_Bode", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "readme_path": "", "readme_url": "", "result_count": 6, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250627_Quicopt_Bode", "submitted_instance_count": 6, "submitters": [ "Tim Bode (Forschungszentrum J\u00fclich)" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2025-02-21T00:00:00", "instance_count": 99, "modeling_approaches": [ "QUBO" ], "name": "20250221_Abs2_Schicker", "path": "02-labs/submissions/20250221_Abs2_Schicker", "problem_dir": "02-labs", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250221_Abs2_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker/README.md", "result_count": 99, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250221_Abs2_Schicker", "submitted_instance_count": 99, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [], "date_key": "2025-01-30T00:00:00", "instance_count": 5, "modeling_approaches": [], "name": "20250130_QuantumBaseline-BlackBox_Takeori-Valls", "path": "03-birkhoff/submissions/20250130_QuantumBaseline-BlackBox_Takeori-Valls", "problem_dir": "03-birkhoff", "problem_title": "Minimum Birkhoff Decomposition", "readme_path": "03-birkhoff/submissions/20250130_QuantumBaseline-BlackBox_Takeori-Valls/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20250130_QuantumBaseline-BlackBox_Takeori-Valls/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/03-birkhoff/submissions/20250130_QuantumBaseline-BlackBox_Takeori-Valls", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [], "date_key": "2025-01-20T00:00:00", "instance_count": 2, "modeling_approaches": [], "name": "20250120_BF-DCQO_Hegade", "path": "02-labs/submissions/20250120_BF-DCQO_Hegade", "problem_dir": "02-labs", "problem_title": "LABS", "readme_path": "02-labs/submissions/20250120_BF-DCQO_Hegade/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250120_BF-DCQO_Hegade/README.md", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20250120_BF-DCQO_Hegade", "submitted_instance_count": 0, "submitters": [] }, { "algorithm_types": [ "Stochastic" ], "date_key": "2025-01-15T00:00:00", "instance_count": 3, "modeling_approaches": [ "QUBO" ], "name": "20250115_QAOA_Egger", "path": "07-independentset/submissions/20250115_QAOA_Egger", "problem_dir": "07-independentset", "problem_title": "Maximum Independent Set", "readme_path": "", "readme_url": "", "result_count": 2, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/07-independentset/submissions/20250115_QAOA_Egger", "submitted_instance_count": 2, "submitters": [ "Daniel Egger" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-29T08:02:58", "instance_count": 99, "modeling_approaches": [ "Integer Program" ], "name": "20241229_Gurobi_Schicker", "path": "02-labs/submissions/20241229_Gurobi_Schicker", "problem_dir": "02-labs", "problem_title": "LABS", "readme_path": "02-labs/submissions/20241229_Gurobi_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker/README.md", "result_count": 99, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/02-labs/submissions/20241229_Gurobi_Schicker", "submitted_instance_count": 99, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-23T12:02:21", "instance_count": 60, "modeling_approaches": [ "Binary Linear Program" ], "name": "20241224_Gurobi_Schicker", "path": "01-marketsplit/submissions/20241224_Gurobi_Schicker", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241224_Gurobi_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker/README.md", "result_count": 60, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241224_Gurobi_Schicker", "submitted_instance_count": 60, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-22T00:00:00", "instance_count": 60, "modeling_approaches": [ "QUBO" ], "name": "20241222_Abs2_Schicker", "path": "01-marketsplit/submissions/20241222_Abs2_Schicker", "problem_dir": "01-marketsplit", "problem_title": "Market Split", "readme_path": "01-marketsplit/submissions/20241222_Abs2_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker/README.md", "result_count": 60, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/01-marketsplit/submissions/20241222_Abs2_Schicker", "submitted_instance_count": 60, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-06T00:00:00", "instance_count": 16, "modeling_approaches": [ "Binary Quadratic Program" ], "name": "20241206_Gurobi-Seidel-Quadratic_Schicker", "path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker", "problem_dir": "10-topology", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker/README.md", "result_count": 16, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Quadratic_Schicker", "submitted_instance_count": 16, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-06T00:00:00", "instance_count": 16, "modeling_approaches": [ "Binary Linear Program" ], "name": "20241206_Gurobi-Seidel-Linear_Schicker", "path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker", "problem_dir": "10-topology", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker/README.md", "result_count": 16, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Seidel-Linear_Schicker", "submitted_instance_count": 16, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-06T00:00:00", "instance_count": 16, "modeling_approaches": [ "Flow MIP" ], "name": "20241206_Gurobi-Flow_Schicker", "path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker", "problem_dir": "10-topology", "problem_title": "Topology Design", "readme_path": "10-topology/submissions/20241206_Gurobi-Flow_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker/README.md", "result_count": 16, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/10-topology/submissions/20241206_Gurobi-Flow_Schicker", "submitted_instance_count": 16, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [ "Deterministic" ], "date_key": "2024-12-06T00:00:00", "instance_count": 20, "modeling_approaches": [ "Integer Linear Program" ], "name": "20250102_Gurobi_Schicker", "path": "08-network/submissions/20250102_Gurobi_Schicker", "problem_dir": "08-network", "problem_title": "Network Design", "readme_path": "08-network/submissions/20250102_Gurobi_Schicker/README.md", "readme_url": "https://github.com/bernalde/QOBLIB/blob/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker/README.md", "result_count": 20, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/08-network/submissions/20250102_Gurobi_Schicker", "submitted_instance_count": 20, "submitters": [ "Maximilian Schicker" ] }, { "algorithm_types": [], "date_key": "2024-11-29T00:00:00", "instance_count": 1, "modeling_approaches": [], "name": "20241129_Classic_VanBulck", "path": "05-sports/submissions/20241129_Classic_VanBulck", "problem_dir": "05-sports", "problem_title": "Sports Tournament Scheduling", "readme_path": "", "readme_url": "", "result_count": 0, "source_url": "https://github.com/bernalde/QOBLIB/tree/aef5d804c0b60d38f3d197278abbf909b88ac6aa/05-sports/submissions/20241129_Classic_VanBulck", "submitted_instance_count": 0, "submitters": [] } ], "template_columns": [ "Problem", "Submitter", "Date", "Reference", "Best Objective Value", "Optimality Bound", "Modeling Approach", "# Decision Variables", "# Binary Variables", "# Integer Variables", "# Continuous Variables", "# Non-Zero Coefficients", "Coefficients Type", "Coefficients Range", "Workflow", "Algorithm Type", "# Runs", "# Feasible Runs", "# Successful Runs", "Success Threshold", "Hardware Specifications", "Total Runtime", "CPU Runtime", "GPU Runtime", "QPU Runtime", "Other HW Runtime", "Remarks" ], "warnings": [] }