Package evaluation to test Boscia on Julia 1.14.0-DEV.1414 (f2608a495e*) started at 2025-12-25T18:30:15.372 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 11.29s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Installed Bzip2_jll ──────────── v1.0.9+0 Installed DiffResults ────────── v1.1.0 Installed MacroTools ─────────── v0.5.16 Installed ConstructionBase ───── v1.6.0 Installed ForwardDiff ────────── v1.3.0 Installed FillArrays ─────────── v1.15.0 Installed GenericSchur ───────── v0.5.6 Installed DataStructures ─────── v0.19.3 Installed CodecZlib ──────────── v0.7.8 Installed ExprTools ──────────── v0.1.10 Installed OrderedCollections ─── v1.8.1 Installed Compat ─────────────── v4.18.1 Installed Statistics ─────────── v1.11.1 Installed TranscodingStreams ─── v0.11.3 Installed PrecompileTools ────── v1.3.3 Installed CommonSubexpressions ─ v0.3.1 Installed ProgressMeter ──────── v1.11.0 Installed StaticArraysCore ───── v1.4.4 Installed TimerOutputs ───────── v0.5.29 Installed StaticArrays ───────── v1.9.15 Installed ChainRulesCore ─────── v1.26.0 Installed IrrationalConstants ── v0.2.6 Installed StructUtils ────────── v2.6.0 Installed CodecBzip2 ─────────── v0.8.5 Installed NaNMath ────────────── v1.1.3 Installed Hungarian ──────────── v0.7.0 Installed FrankWolfe ─────────── v0.6.2 Installed JSON3 ──────────────── v1.14.3 Installed OpenSpecFun_jll ────── v0.5.6+0 Installed Bonobo ─────────────── v0.1.4 Installed DiffRules ──────────── v1.15.1 Installed LogExpFunctions ────── v0.3.29 Installed NamedTupleTools ────── v0.14.3 Installed Arpack_jll ─────────── v3.5.2+0 Installed Parsers ────────────── v2.8.3 Installed JSON ───────────────── v1.3.0 Installed Arpack ─────────────── v0.5.4 Installed SpecialFunctions ───── v2.6.1 Installed Setfield ───────────── v1.1.2 Installed JLLWrappers ────────── v1.7.1 Installed BenchmarkTools ─────── v1.6.3 Installed MutableArithmetics ─── v1.6.7 Installed Preferences ────────── v1.5.1 Installed BlockDiagonals ─────── v0.2.0 Installed MathOptSetDistances ── v0.2.12 Installed StructTypes ────────── v1.11.0 Installed ProximalCore ───────── v0.1.2 Installed DocStringExtensions ── v0.9.5 Installed MathOptInterface ───── v1.48.0 Installed Boscia ─────────────── v0.2.4 Installing 3 artifacts Installed artifact Arpack 138.3 KiB Installed artifact OpenSpecFun 194.9 KiB Installed artifact Bzip2 503.5 KiB Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.4 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.4 [36b166db] + Boscia v0.2.4 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.15.0 [f6369f11] + ForwardDiff v1.3.0 [f55ce6ea] + FrankWolfe v0.6.2 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.3.0 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.48.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 9.53s ################################################################################ # Precompilation # ERROR: LoadError: MethodError: no method matching setindex!(::Base.ScopedValues.ScopedValue{IO}, ::Nothing) The function `setindex!` exists, but no method is defined for this combination of argument types. Stacktrace: [1] top-level scope @ /PkgEval.jl/scripts/precompile.jl:10 [2] include(mod::Module, _path::String) @ Base ./Base.jl:309 [3] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [4] _start() @ Base ./client.jl:577 in expression starting at /PkgEval.jl/scripts/precompile.jl:6 caused by: MethodError: no method matching setindex!(::Base.ScopedValues.ScopedValue{IO}, ::Base.DevNull) The function `setindex!` exists, but no method is defined for this combination of argument types. Stacktrace: [1] top-level scope @ /PkgEval.jl/scripts/precompile.jl:7 [2] include(mod::Module, _path::String) @ Base ./Base.jl:309 [3] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [4] _start() @ Base ./client.jl:577 Precompilation failed after 13.51s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_8Y22Hx/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.4 [36b166db] Boscia v0.2.4 [336ed68f] CSV v0.10.15 [0002e35e] CombinatorialLinearOracles v0.1.2 [31c24e10] Distributions v0.25.122 [497a8b3b] DoubleFloats v1.5.0 [f55ce6ea] FrankWolfe v0.6.2 [86223c79] Graphs v1.13.2 [87dc4568] HiGHS v1.20.1 [b8f27783] MathOptInterface v1.48.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_8Y22Hx/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.4 [36b166db] Boscia v0.2.4 [336ed68f] CSV v0.10.15 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.4 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.3 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.0 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.15.0 [f6369f11] ForwardDiff v1.3.0 [f55ce6ea] FrankWolfe v0.6.2 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.2 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.3.0 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.3 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.48.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.7 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.9 [4c63d2b9] StatsFuns v1.5.2 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.0 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.400+0 [e5ac4fe4] SCIP_jll v900.200.400+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.7+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.17.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests...  Downloading artifact: oneTBB 1 dependency had output during precompilation: ┌ SCIP_PaPILO_jll │ Downloading artifact: oneTBB └ Interface Tests seed = 0xeffc9650702d21f5 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##0", var"#grad!#grad!##0", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##1", var"#grad!#grad!##1", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##2", var"#grad!#grad!##2", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##8", var"#grad!#grad!##4", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##11"{Float64}, var"#grad!#grad!##5"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##20", var"#grad!#grad!##8", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##20", var"#grad!#grad!##8", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##23", var"#grad!#grad!##9", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##23", var"#grad!#grad!##9", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##26", var"#grad!#grad!##10", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##26", var"#grad!#grad!##10", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##29", var"#grad!#grad!##11", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##32"{Vector{Float64}, Matrix{Bool}}, var"#grad!#grad!##12"{Vector{Float64}, Matrix{Bool}}, Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##33"{Vector{Float64}, Matrix{Bool}}, var"#grad!#grad!##13"{Vector{Float64}, Matrix{Bool}}, Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY LMO Tests seed = 0x5abeac8434638b0b ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##34", var"#grad!#grad!##14", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##37", var"#grad!#grad!##15", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##40", var"#grad!#grad!##16", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##43", var"#grad!#grad!##17", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##43", var"#grad!#grad!##17", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##46", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##46", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0x9c5a1540ad9fc334 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##49", var"#grad!#grad!##19", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##52", var"#grad!#grad!##20", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##52", var"#grad!#grad!##20", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##55", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##55", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##58", var"#grad!#grad!##22", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##58", var"#grad!#grad!##22", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##61", var"#grad!#grad!##23", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##64", var"#grad!#grad!##24", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 [ Info: Polish solution Sparse Regression Tests seed = 0x366cb4abadf9c5d2 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##67", var"#grad!#grad!##25", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 4.717218e+00 4.932282e+00 2.150638e-01 4.559124e-02 1.079500e+01 2.779064e-01 4574 55 16 20 9 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##67", var"#grad!#grad!##25", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 25 8 4.889908e+00 4.932282e+00 4.237386e-02 8.665575e-03 1.431200e+01 2.305757e+00 7 6 150 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.094059e+01 1.272234e+00 9.668359e+00 0.000000e+00 Inf 1 LD 2 4.932282e+00 4.932282e+00 0.000000e+00 1.783421e+00 1.121440e+00 1 Last 2 4.932282e+00 4.932282e+00 0.000000e+00 1.927724e+00 1.037493e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 4.932282e+00 4.932282e+00 0.000000e+00 1.932456e+00 1.034952e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.932282028261306 Dual Bound: 4.8899081644505795 Dual Gap (relative): 0.00866557456411608 Search Statistics. Total number of nodes processed: 33 Total number of lmo calls: 155 Total time (s): 17.878 LMO calls / sec: 8.669873587649626 Nodes / sec: 1.845844054144759 LMO calls / node: 4.696969696969697 Total number of global tightenings: 38 Global tightenings / node: 1.52 Total number of local tightenings: 50 Local tightenings / node: 2.0 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##68", var"#grad!#grad!##26", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 3.859323e-01 2.416456e+00 2.030524e+00 5.261348e+00 1.318900e+01 2.274623e-01 6654 336 60 131 46 1 * 3 4 3.939265e-01 2.391084e+00 1.997158e+00 5.069874e+00 1.361000e+01 5.143277e-01 192 145 129 88 27 1 * 61 60 1.323562e+00 2.285940e+00 9.623787e-01 7.271128e-01 2.272700e+01 5.324064e+00 19 15 1556 2 0 0 * 63 60 1.326975e+00 2.281128e+00 9.541525e-01 7.190430e-01 2.282900e+01 5.387884e+00 22 17 1571 5 0 0 * 65 60 1.330298e+00 2.275753e+00 9.454554e-01 7.107096e-01 2.295000e+01 5.446623e+00 43 32 1591 13 0 0 100 61 1.352173e+00 2.275753e+00 9.235801e-01 6.830339e-01 2.462100e+01 6.539133e+00 31 23 1855 34 23 3 200 61 1.382538e+00 2.275753e+00 8.932151e-01 6.460690e-01 2.967500e+01 8.795282e+00 30 23 2674 23 18 4 300 61 1.398874e+00 2.275753e+00 8.768789e-01 6.268461e-01 3.477800e+01 1.038013e+01 52 39 3529 68 18 3 400 61 1.413333e+00 2.275753e+00 8.624200e-01 6.102028e-01 3.976600e+01 1.159282e+01 69 49 4407 91 16 3 500 61 1.426180e+00 2.275753e+00 8.495732e-01 5.956983e-01 4.476800e+01 1.253127e+01 90 64 5294 83 17 5 600 61 1.442703e+00 2.275753e+00 8.330503e-01 5.774232e-01 5.001500e+01 1.321604e+01 44 32 6195 46 12 9 700 61 1.461043e+00 2.275753e+00 8.147104e-01 5.576225e-01 5.474700e+01 1.390031e+01 71 43 7079 51 14 6 800 61 1.488398e+00 2.275753e+00 7.873553e-01 5.289952e-01 5.940500e+01 1.449373e+01 60 43 7934 62 15 14 900 61 1.521379e+00 2.275753e+00 7.543741e-01 4.958488e-01 6.386800e+01 1.504666e+01 54 39 8790 60 12 8 1000 61 1.576510e+00 2.275753e+00 6.992435e-01 4.435390e-01 6.820500e+01 1.555604e+01 50 36 9634 46 9 4 1100 61 1.668128e+00 2.275753e+00 6.076250e-01 3.642555e-01 7.256500e+01 1.599945e+01 73 50 10498 73 9 5 1200 49 1.897701e+00 2.275753e+00 3.780519e-01 1.992157e-01 7.649700e+01 1.632744e+01 13 9 11262 6 0 0 1249 0 1.996169e+00 2.275753e+00 2.795841e-01 1.400603e-01 7.764300e+01 1.608645e+01 19 13 11460 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.395289e+00 -9.649290e-01 5.360218e+00 0.000000e+00 Inf 1 LD 2 2.275761e+00 2.272116e+00 3.644664e-03 1.474480e-01 1.356410e+01 2 LD 5 2.275754e+00 2.274368e+00 1.386317e-03 3.897355e-01 1.282921e+01 3 LD 10 2.275754e+00 2.275147e+00 6.061831e-04 3.942176e-01 2.536670e+01 3 LD 15 2.275753e+00 2.275488e+00 2.651920e-04 3.984982e-01 3.764133e+01 3 LD 20 2.275753e+00 2.275637e+00 1.160409e-04 4.027341e-01 4.966056e+01 3 LD 25 2.275753e+00 2.275703e+00 5.078124e-05 4.072623e-01 6.138550e+01 3 LD 30 2.275753e+00 2.275731e+00 2.222355e-05 4.119459e-01 7.282509e+01 3 LD 35 2.275753e+00 2.275744e+00 9.725939e-06 4.163980e-01 8.405421e+01 3 LD 38 2.275753e+00 2.275752e+00 8.371291e-07 4.206801e-01 9.032992e+01 3 Last 38 2.275753e+00 2.275752e+00 8.371291e-07 4.283852e-01 8.870522e+01 3 ---------------------------------------------------------------------------------------------------------------- PP 38 2.275753e+00 2.275752e+00 8.371291e-07 4.326470e-01 8.783142e+01 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.275753331643809 Dual Bound: 2.2757524945147485 Dual Gap (relative): 3.678471462760495e-7 Search Statistics. Total number of nodes processed: 1249 Total number of lmo calls: 11474 Total time (s): 79.805 LMO calls / sec: 143.77545266587305 Nodes / sec: 15.650648455610549 LMO calls / node: 9.186549239391514 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 25 Non zero entries: 20th entry: 0.09610153838882649 50th entry: 0.09475751795815077 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 4.708929e-01 2.416456e+00 1.945564e+00 4.131648e+00 4.450000e-01 6.741573e+00 437 318 60 131 46 1 * 3 4 4.789165e-01 2.391084e+00 1.912168e+00 3.992695e+00 8.470000e-01 8.264463e+00 186 140 129 88 27 1 * 59 58 1.367130e+00 2.285940e+00 9.188105e-01 6.720726e-01 9.305000e+00 1.257389e+01 16 12 1512 2 0 0 * 61 58 1.371947e+00 2.281128e+00 9.091809e-01 6.626938e-01 9.399000e+00 1.266092e+01 20 15 1527 5 0 0 * 63 58 1.374549e+00 2.275753e+00 9.012046e-01 6.556367e-01 9.514000e+00 1.271810e+01 40 30 1547 13 0 0 100 59 1.401523e+00 2.275753e+00 8.742308e-01 6.237722e-01 1.127000e+01 1.410825e+01 56 40 1828 61 22 6 200 59 1.437194e+00 2.275753e+00 8.385589e-01 5.834693e-01 1.613000e+01 1.605704e+01 63 47 2654 71 24 4 300 59 1.456591e+00 2.275753e+00 8.191623e-01 5.623832e-01 2.130200e+01 1.685288e+01 85 58 3532 134 21 12 400 61 1.472712e+00 2.275753e+00 8.030409e-01 5.452802e-01 2.677800e+01 1.721562e+01 76 53 4452 119 23 16 500 61 1.493305e+00 2.275753e+00 7.824487e-01 5.239713e-01 3.194800e+01 1.755978e+01 57 41 5317 66 17 3 600 61 1.515499e+00 2.275753e+00 7.602540e-01 5.016524e-01 3.702100e+01 1.785473e+01 54 40 6211 49 12 5 700 56 1.549920e+00 2.275753e+00 7.258337e-01 4.683041e-01 4.207200e+01 1.796920e+01 24 17 7099 6 0 0 800 47 1.598333e+00 2.275753e+00 6.774198e-01 4.238288e-01 4.713400e+01 1.797004e+01 66 46 8001 65 13 12 900 33 1.695874e+00 2.275753e+00 5.798794e-01 3.419354e-01 5.232900e+01 1.782950e+01 53 38 8960 48 8 6 1000 17 2.062095e+00 2.275753e+00 2.136584e-01 1.036123e-01 5.846200e+01 1.739592e+01 48 34 10094 42 0 0 1017 0 2.115205e+00 2.275753e+00 1.605487e-01 7.590223e-02 5.939500e+01 1.712265e+01 54 38 10275 67 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.395289e+00 -9.649290e-01 5.360218e+00 0.000000e+00 Inf 1 LD 2 2.275761e+00 2.272116e+00 3.644664e-03 1.187399e-03 1.684354e+03 2 LD 5 2.275754e+00 2.274368e+00 1.386317e-03 8.245804e-03 6.063690e+02 3 LD 10 2.275754e+00 2.275147e+00 6.061831e-04 1.185905e-02 8.432378e+02 3 LD 15 2.275753e+00 2.275488e+00 2.651920e-04 1.543112e-02 9.720618e+02 3 LD 20 2.275753e+00 2.275637e+00 1.160409e-04 1.901412e-02 1.051850e+03 3 LD 25 2.275753e+00 2.275703e+00 5.078124e-05 2.295011e-02 1.089319e+03 3 LD 30 2.275753e+00 2.275731e+00 2.222355e-05 2.701597e-02 1.110454e+03 3 LD 35 2.275753e+00 2.275744e+00 9.725939e-06 3.077716e-02 1.137207e+03 3 LD 38 2.275753e+00 2.275752e+00 8.371291e-07 3.430231e-02 1.107797e+03 3 Last 38 2.275753e+00 2.275752e+00 8.371291e-07 4.086893e-02 9.298016e+02 3 ---------------------------------------------------------------------------------------------------------------- PP 38 2.275753e+00 2.275752e+00 8.371291e-07 4.455044e-02 8.529658e+02 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.275753331643809 Dual Bound: 2.2757524945147485 Dual Gap (relative): 3.678471462760495e-7 Search Statistics. Total number of nodes processed: 1017 Total number of lmo calls: 10289 Total time (s): 59.456 LMO calls / sec: 173.05234122712594 Nodes / sec: 17.105086114101184 LMO calls / node: 10.11701081612586 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 21 Poisson Tests seed = 0x4d7c39932a1eda8c Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##69"{Float64}, var"#grad!#grad!##27"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 -7.445642e+02 -7.146774e+02 2.988677e+01 4.181855e-02 1.443500e+01 2.078282e-01 7978 143 41 843 22 6 * 2 3 -7.445642e+02 -7.154919e+02 2.907225e+01 4.063254e-02 1.500200e+01 3.332889e-01 558 114 72 270 22 13 * 3 4 -7.437042e+02 -7.157514e+02 2.795288e+01 3.905389e-02 1.672000e+01 4.186603e-01 1710 126 107 1203 25 8 * 4 5 -7.437042e+02 -7.266051e+02 1.709916e+01 2.353294e-02 1.909500e+01 4.713276e-01 2366 127 142 1665 28 12 * 67 68 -7.393778e+02 -7.273569e+02 1.202093e+01 1.652686e-02 1.132980e+02 1.191548e+00 2117 124 2129 1640 24 8 73 74 -7.392432e+02 -7.273569e+02 1.188628e+01 1.634174e-02 1.200060e+02 1.224939e+00 477 62 2320 275 18 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.110441e+03 -1.136405e+03 2.246845e+03 0.000000e+00 Inf 1 LD 2 -7.084308e+02 -7.822823e+02 7.385152e+01 1.580944e-01 1.265067e+01 2 LD 25 -7.207634e+02 -7.533019e+02 3.253848e+01 4.557333e-01 5.485664e+01 4 LD 35 -7.308211e+02 -7.399135e+02 9.092411e+00 4.763591e-01 7.347398e+01 4 LD 58 -7.310792e+02 -7.351381e+02 4.058874e+00 5.083254e-01 1.141001e+02 5 LD 120 -7.311568e+02 -7.329345e+02 1.777682e+00 6.545698e-01 1.833265e+02 6 LD 213 -7.312533e+02 -7.320065e+02 7.531196e-01 7.664676e-01 2.778983e+02 7 LD 316 -7.312716e+02 -7.316078e+02 3.361373e-01 9.098099e-01 3.473253e+02 8 LD 450 -7.312777e+02 -7.314371e+02 1.593565e-01 1.074013e+00 4.189893e+02 8 LD 622 -7.312793e+02 -7.313064e+02 2.713526e-02 1.275663e+00 4.875895e+02 8 LD 716 -7.312794e+02 -7.312890e+02 9.652990e-03 1.385376e+00 5.168271e+02 8 LD 795 -7.312794e+02 -7.312804e+02 9.874397e-04 1.541058e+00 5.158793e+02 9 LD 891 -7.312794e+02 -7.312798e+02 4.270815e-04 1.609142e+00 5.537114e+02 9 LD 938 -7.312794e+02 -7.312795e+02 1.626322e-04 1.643421e+00 5.707605e+02 9 LD 983 -7.312794e+02 -7.312794e+02 6.797636e-05 1.676867e+00 5.862122e+02 9 P 1000 -7.312794e+02 -7.312794e+02 6.797636e-05 1.694404e+00 5.901782e+02 9 LD 1030 -7.312794e+02 -7.312794e+02 2.367603e-05 1.777164e+00 5.795750e+02 9 LD 1080 -7.312794e+02 -7.312794e+02 1.158006e-05 1.823973e+00 5.921141e+02 9 P 2000 -7.312794e+02 -7.312794e+02 1.158006e-05 2.617376e+00 7.641242e+02 9 P 3000 -7.312794e+02 -7.312794e+02 1.158006e-05 3.376873e+00 8.883959e+02 9 P 4000 -7.312794e+02 -7.312794e+02 1.158006e-05 4.062233e+00 9.846801e+02 9 P 5000 -7.312794e+02 -7.312794e+02 1.158006e-05 4.754937e+00 1.051539e+03 9 P 6000 -7.312794e+02 -7.312794e+02 1.158006e-05 5.419499e+00 1.107113e+03 9 P 7000 -7.312794e+02 -7.312794e+02 1.158006e-05 6.077068e+00 1.151871e+03 9 P 8000 -7.312794e+02 -7.312794e+02 1.158006e-05 6.758167e+00 1.183753e+03 9 P 9000 -7.312794e+02 -7.312794e+02 1.158006e-05 7.451250e+00 1.207851e+03 9 P 10000 -7.312794e+02 -7.312794e+02 1.158006e-05 8.169649e+00 1.224043e+03 9 Last 10001 -7.312794e+02 -7.312794e+02 1.158006e-05 8.174852e+00 1.223386e+03 9 ---------------------------------------------------------------------------------------------------------------- PP 10001 -7.312794e+02 -7.312794e+02 3.264935e-05 8.178529e+00 1.222836e+03 9 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -731.2793763871761 Dual Bound: -739.2431576245993 Dual Gap (relative): 0.010890203518069495 Search Statistics. Total number of nodes processed: 147 Total number of lmo calls: 2350 Total time (s): 130.033 LMO calls / sec: 18.07233548406943 Nodes / sec: 1.1304822621949815 LMO calls / node: 15.986394557823129 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##72"{Float64}, var"#grad!#grad!##28"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 -6.427658e+02 -6.405754e+02 2.190344e+00 3.419339e-03 1.646400e+01 1.822157e-01 7110 154 23 62 8 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -3.396417e+02 -6.747860e+02 3.351443e+02 0.000000e+00 Inf 1 LD 2 -6.405754e+02 -6.405754e+02 0.000000e+00 1.454568e-01 1.374979e+01 1 Last 2 -6.405754e+02 -6.405754e+02 0.000000e+00 2.917580e-01 6.854995e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.405754e+02 -6.405754e+02 0.000000e+00 2.966230e-01 6.742565e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -640.5754384706665 Dual Bound: -642.7657827876278 Dual Gap (relative): 0.0034193385906124995 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 28 Total time (s): 18.504 LMO calls / sec: 1.5131863380890618 Nodes / sec: 0.16212710765239946 LMO calls / node: 9.333333333333334 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##75"{Float64}, var"#grad!#grad!##29"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 1.822821e+02 3.556649e+02 1.733828e+02 9.511785e-01 1.281700e+01 2.340641e-01 6739 189 27 66 13 0 * 3 4 2.037103e+02 3.497745e+02 1.460642e+02 7.170193e-01 1.340100e+01 5.223491e-01 299 144 71 81 12 3 * 4 5 2.037103e+02 3.466065e+02 1.428962e+02 7.014677e-01 1.367600e+01 6.580872e-01 262 135 91 95 12 1 * 5 6 2.068543e+02 3.396980e+02 1.328437e+02 6.422090e-01 1.389400e+01 7.917087e-01 206 107 108 69 12 2 * 7 8 2.199211e+02 3.380227e+02 1.181016e+02 5.370181e-01 1.442800e+01 1.039645e+00 197 116 148 57 11 1 * 13 14 2.306579e+02 3.305987e+02 9.994078e+01 4.332857e-01 1.598700e+01 1.688872e+00 162 100 255 45 11 1 100 89 2.924964e+02 3.305987e+02 3.810236e+01 1.302661e-01 3.309600e+01 5.710660e+00 28 19 1453 6 0 0 200 67 3.171373e+02 3.305987e+02 1.346146e+01 4.244680e-02 4.458100e+01 5.989098e+00 22 17 2150 6 0 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##75"{Float64}, var"#grad!#grad!##29"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 259 22 3.274033e+02 3.305987e+02 3.195384e+00 9.759777e-03 4.673800e+01 6.012238e+00 7 5 2410 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.305987e+02 3.305987e+02 0.000000e+00 1.055085e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.305987e+02 3.305987e+02 0.000000e+00 1.508040e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 330.59872478188913 Dual Bound: 327.4033410733481 Dual Gap (relative): 0.00975977733784086 Search Statistics. Total number of nodes processed: 281 Total number of lmo calls: 2414 Total time (s): 48.44 LMO calls / sec: 49.834847233691164 Nodes / sec: 5.800990916597853 LMO calls / node: 8.590747330960854 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##78"{Float64}, var"#grad!#grad!##30"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 1.822821e+02 3.556649e+02 1.733828e+02 9.511785e-01 1.628600e+01 1.842073e-01 6898 185 27 66 13 0 * 2 3 1.822821e+02 3.484567e+02 1.661746e+02 9.116346e-01 1.746200e+01 2.863360e-01 228 136 48 66 14 2 * 4 5 1.962214e+02 3.396980e+02 1.434766e+02 7.311971e-01 2.001500e+01 4.496628e-01 373 112 87 203 12 2 * 13 14 2.306587e+02 3.318233e+02 1.011646e+02 4.385901e-01 2.931800e+01 9.209359e-01 236 109 259 85 10 1 * 70 45 2.761018e+02 3.305987e+02 5.449697e+01 1.973800e-01 6.439700e+01 1.785797e+00 115 72 987 39 5 0 100 61 2.885969e+02 3.305987e+02 4.200178e+01 1.455378e-01 7.865300e+01 2.046966e+00 60 39 1286 15 3 1 200 53 3.167436e+02 3.305987e+02 1.385508e+01 4.374225e-02 1.033720e+02 2.447471e+00 11 8 1905 0 0 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##78"{Float64}, var"#grad!#grad!##30"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 251 10 3.274910e+02 3.305987e+02 3.107683e+00 9.489367e-03 1.063810e+02 2.453446e+00 6 5 2074 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.305987e+02 3.305987e+02 0.000000e+00 1.196382e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.305987e+02 3.305987e+02 0.000000e+00 1.675666e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 330.59872478188913 Dual Bound: 327.4910421854623 Dual Gap (relative): 0.009489366718821382 Search Statistics. Total number of nodes processed: 261 Total number of lmo calls: 2078 Total time (s): 108.205 LMO calls / sec: 19.204288156739523 Nodes / sec: 2.412088165981239 LMO calls / node: 7.961685823754789 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Mean Risk Test seed = 0xbe0788a2682c145a Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##81", var"#grad!#grad!##31", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 -1.716081e+01 6.620611e+01 8.336692e+01 Inf 1.525500e+01 1.966568e-01 7392 147 43 10001 21 11 * 2 3 -1.716081e+01 5.079351e+01 6.795431e+01 Inf 1.557100e+01 3.211098e-01 309 44 61 6987 18 15 * 4 5 -1.312409e+01 3.899910e+01 5.212320e+01 Inf 1.720000e+01 5.232558e-01 1081 71 122 5208 19 17 100 75 1.946350e+01 3.899910e+01 1.953561e+01 1.003705e+00 4.178400e+01 4.188206e+00 12 9 2412 31 7 6 184 69 3.126277e+01 3.899910e+01 7.736331e+00 2.474615e-01 6.000400e+01 4.216386e+00 177 87 4406 2449 13 31 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 38.99910362330747 Dual Bound: 31.262772388554595 Dual Gap (relative): 0.24746145794750984 Search Statistics. Total number of nodes processed: 253 Total number of lmo calls: 4406 Total time (s): 60.648 LMO calls / sec: 72.64872708086004 Nodes / sec: 4.171613243635404 LMO calls / node: 17.41501976284585 Total number of global tightenings: 29 Global tightenings / node: 0.16 Total number of local tightenings: 802 Local tightenings / node: 4.36 Total number of potential local tightenings: 1059 Time Limit Test seed = 0x15b4c7eb25c2bcbd Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##82", var"#grad!#grad!##32", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 -3.667681e+00 -2.592931e+00 1.074750e+00 4.144923e-01 1.491400e+01 2.011533e-01 8431 600 31 2353 13 7 * 14 15 -3.435919e+00 -2.615266e+00 8.206528e-01 3.137932e-01 1.938700e+01 1.495848e+00 84 53 358 1467 9 26 39 40 -3.122888e+00 -2.615266e+00 5.076217e-01 1.940994e-01 3.011900e+01 2.622929e+00 545 482 954 3237 8 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -2.615266131621128 Dual Bound: -3.1228877901803673 Dual Gap (relative): 0.1940994273667206 Search Statistics. Total number of nodes processed: 79 Total number of lmo calls: 954 Total time (s): 30.876 LMO calls / sec: 30.897784687135637 Nodes / sec: 2.55862158310662 LMO calls / node: 12.075949367088608 Total number of global tightenings: 3 Global tightenings / node: 0.08 Total number of local tightenings: 101 Local tightenings / node: 2.59 Total number of potential local tightenings: 160 Strong Convexity and Sharpness Tests seed = 0xe0dd3705222e1c84 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#50#51"{Vector{Float64}}, var"#52#53"{Vector{Float64}}, Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 2.096691e+02 2.096731e+02 4.045162e-03 1.929308e-05 1.086500e+01 2.761160e-01 4704 0 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 209.67310638936473 Dual Bound: 209.66906122737532 Dual Gap (relative): 1.929308008406253e-5 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 11.571 LMO calls / sec: 0.5185377236193933 Nodes / sec: 0.25926886180969666 LMO calls / node: 2.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#61#62"{Vector{Float64}}, var"#63#64"{Vector{Float64}}, Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 1.947565e+02 1.951726e+02 4.160912e-01 2.136470e-03 1.184200e+01 2.533356e-01 5960 0 11 16 3 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 195.17255052420717 Dual Bound: 194.75645927666042 Dual Gap (relative): 0.002136469563536627 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 12.288 LMO calls / sec: 0.8951822916666666 Nodes / sec: 0.244140625 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0x367df7a02c007c24 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = get_next_node(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, ::Bonobo.BestFirstSearch) at node.jl:72 └ @ Core ~/.julia/packages/Bonobo/TTu7F/src/node.jl:72 * 1 2 -8.518325e-03 7.382204e+00 7.390722e+00 Inf 9.364000e+00 3.203759e-01 4914 41 49 3029 24 12 61 4 7.321158e+00 7.382204e+00 6.104569e-02 8.338255e-03 1.057400e+01 6.147153e+00 9 7 981 32 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321158471753056 Dual Gap (relative): 0.008338255323410919 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 981 Total time (s): 11.043 LMO calls / sec: 88.83455582722087 Nodes / sec: 5.886081680702708 LMO calls / node: 15.092307692307692 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 86 Local tightenings / node: 1.41 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.518325e-03 7.382204e+00 7.390722e+00 Inf 2.140000e-01 1.401869e+01 119 36 49 3029 24 12 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/GVHgb/src/callbacks.jl:252 100 1 7.304657e+00 7.382204e+00 7.754728e-02 1.061614e-02 1.819000e+00 5.552501e+01 8 5 1172 32 0 0 101 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.827000e+00 5.528188e+01 4 3 1177 11 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 101 Total number of lmo calls: 1177 Total time (s): 1.828 LMO calls / sec: 643.8730853391685 Nodes / sec: 55.25164113785558 LMO calls / node: 11.653465346534654 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 60 Local tightenings / node: 0.59 Total number of potential local tightenings: 114 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.518325e-03 7.382204e+00 7.390722e+00 Inf 2.020000e-01 1.485149e+01 111 37 49 3029 24 12 75 4 7.351862e+00 7.382204e+00 3.034216e-02 4.127140e-03 1.821000e+00 4.338276e+01 9 6 1060 16 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.351862000118996 Dual Gap (relative): 0.004127139523864634 Search Statistics. Total number of nodes processed: 79 Total number of lmo calls: 1060 Total time (s): 1.822 LMO calls / sec: 581.7782656421515 Nodes / sec: 43.358946212952794 LMO calls / node: 13.417721518987342 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 86 Local tightenings / node: 1.15 Total number of potential local tightenings: 171 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.518325e-03 7.382204e+00 7.390722e+00 Inf 2.270000e-01 1.321586e+01 120 37 49 3029 24 12 73 2 7.335011e+00 7.382204e+00 4.719352e-02 6.434009e-03 1.556000e+00 4.820051e+01 10 7 892 34 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.33501063612691 Dual Gap (relative): 0.0064340089698486525 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 892 Total time (s): 1.557 LMO calls / sec: 572.8965960179834 Nodes / sec: 48.16955684007707 LMO calls / node: 11.893333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 57 Local tightenings / node: 0.78 Total number of potential local tightenings: 126 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.518325e-03 7.382204e+00 7.390722e+00 Inf 2.010000e-01 1.492537e+01 119 38 49 3029 24 12 93 4 7.324917e+00 7.382204e+00 5.728716e-02 7.820862e-03 2.003000e+00 4.842736e+01 4 3 1196 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.324916998605511 Dual Gap (relative): 0.007820861555029306 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1196 Total time (s): 2.004 LMO calls / sec: 596.8063872255489 Nodes / sec: 48.40319361277445 LMO calls / node: 12.329896907216495 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 71 Local tightenings / node: 0.76 Total number of potential local tightenings: 156 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.660000e-01 1.127820e+01 259 64 60 3859 40 6 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 5.850000e-01 1.538462e+01 107 51 185 1051 27 29 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 8.060000e-01 1.612903e+01 94 42 263 958 27 34 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.246000e+00 1.845907e+01 81 43 443 685 25 15 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 3.176000e+00 2.361461e+01 52 29 1297 379 19 22 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 7.364000e+00 2.729495e+01 83 37 3291 470 23 19 200 201 1.669741e+01 2.836265e+01 1.166524e+01 6.986258e-01 1.345300e+01 2.980748e+01 54 34 6128 257 18 18 300 297 1.877956e+01 2.836265e+01 9.583087e+00 5.102935e-01 1.888100e+01 3.161909e+01 40 23 8830 262 16 7 400 393 2.048363e+01 2.836265e+01 7.879012e+00 3.846492e-01 2.427100e+01 3.267274e+01 44 26 11546 271 20 19 500 467 2.164530e+01 2.836265e+01 6.717344e+00 3.103373e-01 2.905000e+01 3.328744e+01 27 16 13972 124 0 0 600 539 2.275196e+01 2.836265e+01 5.610686e+00 2.466023e-01 3.384700e+01 3.365143e+01 39 24 16438 226 18 14 700 573 2.371222e+01 2.836265e+01 4.650425e+00 1.961193e-01 3.796000e+01 3.353530e+01 10 7 18499 21 0 0 800 569 2.442888e+01 2.836265e+01 3.933764e+00 1.610292e-01 4.148300e+01 3.300147e+01 10 7 20364 18 0 0 900 525 2.527555e+01 2.836265e+01 3.087090e+00 1.221374e-01 4.443600e+01 3.206859e+01 10 7 21875 24 0 0 1000 471 2.586641e+01 2.836265e+01 2.496239e+00 9.650504e-02 4.666100e+01 3.152526e+01 47 24 23189 160 14 7 1100 395 2.634773e+01 2.836265e+01 2.014911e+00 7.647379e-02 4.868400e+01 3.070824e+01 13 9 24404 20 0 0 1200 309 2.698683e+01 2.836265e+01 1.375818e+00 5.098111e-02 5.039900e+01 2.994107e+01 21 14 25373 63 0 0 1300 215 2.746612e+01 2.836265e+01 8.965201e-01 3.264094e-02 5.213300e+01 2.906029e+01 13 9 26324 12 0 0 1400 121 2.789306e+01 2.836265e+01 4.695868e-01 1.683526e-02 5.369500e+01 2.832666e+01 7 5 27140 9 0 0 1449 72 2.808272e+01 2.836265e+01 2.799216e-01 9.967750e-03 5.439300e+01 2.796316e+01 8 5 27528 10 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404966 Dual Bound: 28.082723456683084 Dual Gap (relative): 0.009967750070738477 Search Statistics. Total number of nodes processed: 1521 Total number of lmo calls: 27528 Total time (s): 54.394 LMO calls / sec: 506.0852299886017 Nodes / sec: 27.9626429385594 LMO calls / node: 18.09861932938856 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2471 Local tightenings / node: 1.71 Total number of potential local tightenings: 5237 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 1.238000e+00 2.423263e+00 232 69 60 3859 40 6 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 1.533000e+00 5.870841e+00 89 39 185 1051 27 29 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 1.815000e+00 7.162534e+00 170 37 263 958 27 34 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 2.180000e+00 1.055046e+01 67 34 443 685 25 15 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 4.109000e+00 1.825262e+01 58 31 1297 379 19 22 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 8.469000e+00 2.373362e+01 67 38 3291 470 23 19 200 197 1.666621e+01 2.836265e+01 1.169643e+01 7.018052e-01 1.434300e+01 2.767901e+01 33 19 6075 316 20 5 300 261 1.834644e+01 2.836265e+01 1.001621e+01 5.459482e-01 1.771400e+01 3.166987e+01 41 24 8428 249 21 14 400 313 1.984864e+01 2.836265e+01 8.514008e+00 4.289467e-01 2.113500e+01 3.373551e+01 18 13 10639 54 0 0 500 349 2.103515e+01 2.836265e+01 7.327496e+00 3.483453e-01 2.473100e+01 3.432938e+01 28 17 12581 180 12 10 600 387 2.187919e+01 2.836265e+01 6.483455e+00 2.963297e-01 2.815300e+01 3.505843e+01 23 15 14473 89 9 8 700 403 2.283223e+01 2.836265e+01 5.530411e+00 2.422194e-01 3.111300e+01 3.545142e+01 16 11 16133 36 0 0 800 419 2.364765e+01 2.836265e+01 4.714992e+00 1.993852e-01 3.409100e+01 3.575724e+01 7 5 17803 8 0 0 900 413 2.432561e+01 2.836265e+01 4.037033e+00 1.659581e-01 3.679400e+01 3.568517e+01 12 9 19353 12 0 0 1000 401 2.516302e+01 2.836265e+01 3.199625e+00 1.271558e-01 3.929600e+01 3.565248e+01 10 7 20827 24 0 0 1100 359 2.578913e+01 2.836265e+01 2.573520e+00 9.979088e-02 4.130700e+01 3.532089e+01 13 10 22060 24 0 0 1200 317 2.638587e+01 2.836265e+01 1.976771e+00 7.491776e-02 4.319800e+01 3.511737e+01 9 6 23179 8 0 0 1300 279 2.677464e+01 2.836265e+01 1.588002e+00 5.930994e-02 4.507500e+01 3.503050e+01 10 7 24140 7 0 0 1400 221 2.729205e+01 2.836265e+01 1.070597e+00 3.922742e-02 4.686800e+01 3.458650e+01 15 10 25050 32 0 0 1500 159 2.767343e+01 2.836265e+01 6.892163e-01 2.490535e-02 4.843400e+01 3.425280e+01 24 16 25909 67 0 0 1600 79 2.801452e+01 2.836265e+01 3.481295e-01 1.242675e-02 4.977700e+01 3.373044e+01 9 6 26634 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 4.996200e+01 3.360554e+01 10 7 26733 23 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404966 Dual Bound: 28.08335582175786 Dual Gap (relative): 0.009945008189894619 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26733 Total time (s): 49.963 LMO calls / sec: 535.0559413966334 Nodes / sec: 33.6048676020255 LMO calls / node: 15.921977367480643 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2289 Local tightenings / node: 1.42 Total number of potential local tightenings: 5480 Number of alternative decisions: 435 Number of stable decisions: 404 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.780000e-01 1.079137e+01 233 71 60 3859 40 6 * 12 13 1.956446e+00 3.120765e+01 2.925120e+01 1.495120e+01 1.351000e+00 1.850481e+01 64 33 471 649 26 26 * 15 16 2.818141e+00 2.929131e+01 2.647317e+01 9.393839e+00 1.551000e+00 1.998711e+01 61 32 582 605 22 31 * 25 26 4.248026e+00 2.836265e+01 2.411462e+01 5.676665e+00 2.220000e+00 2.297297e+01 60 29 903 396 20 30 100 99 1.014511e+01 2.836265e+01 1.821753e+01 1.795696e+00 6.433000e+00 3.093425e+01 49 27 3100 409 22 16 200 191 1.413169e+01 2.836265e+01 1.423095e+01 1.007024e+00 1.142300e+01 3.422919e+01 62 32 5845 528 24 10 300 285 1.633323e+01 2.836265e+01 1.202941e+01 7.364992e-01 1.645800e+01 3.554502e+01 39 21 8470 300 18 12 400 351 1.816067e+01 2.836265e+01 1.020197e+01 5.617619e-01 2.087300e+01 3.597950e+01 42 24 10820 309 21 13 500 405 1.952477e+01 2.836265e+01 8.837872e+00 4.526491e-01 2.477000e+01 3.653613e+01 28 15 13035 346 16 10 600 457 2.068790e+01 2.836265e+01 7.674748e+00 3.709777e-01 2.860500e+01 3.695158e+01 54 30 15117 427 19 21 700 487 2.170125e+01 2.836265e+01 6.661395e+00 3.069590e-01 3.196200e+01 3.713785e+01 42 24 17098 290 20 6 800 505 2.256517e+01 2.836265e+01 5.797472e+00 2.569212e-01 3.499600e+01 3.728998e+01 27 18 18820 110 10 5 900 513 2.325203e+01 2.836265e+01 5.110614e+00 2.197922e-01 3.728800e+01 3.789423e+01 7 5 20547 6 0 0 1000 501 2.408918e+01 2.836265e+01 4.273464e+00 1.774018e-01 3.981700e+01 3.769747e+01 9 6 22070 10 0 0 1100 481 2.470056e+01 2.836265e+01 3.662087e+00 1.482593e-01 4.176800e+01 3.785194e+01 3 2 23397 6 0 0 1200 453 2.538708e+01 2.836265e+01 2.975561e+00 1.172077e-01 4.403400e+01 3.753917e+01 13 9 24719 92 9 9 1300 413 2.608424e+01 2.836265e+01 2.278401e+00 8.734778e-02 4.576500e+01 3.743035e+01 22 12 25876 260 19 5 1400 347 2.656740e+01 2.836265e+01 1.795248e+00 6.757334e-02 4.704600e+01 3.713387e+01 25 14 26947 285 19 16 1500 279 2.707425e+01 2.836265e+01 1.288395e+00 4.758745e-02 4.822500e+01 3.688958e+01 4 3 27917 8 0 0 1600 205 2.748276e+01 2.836265e+01 8.798870e-01 3.201596e-02 4.927600e+01 3.663041e+01 6 4 28764 8 0 0 1700 113 2.781378e+01 2.836265e+01 5.488699e-01 1.973374e-02 5.016500e+01 3.614074e+01 7 5 29462 19 0 0 1761 54 2.809703e+01 2.836265e+01 2.656101e-01 9.453316e-03 5.071300e+01 3.578964e+01 3 2 29916 8 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404966 Dual Bound: 28.097034882801438 Dual Gap (relative): 0.009453315757746068 Search Statistics. Total number of nodes processed: 1815 Total number of lmo calls: 29916 Total time (s): 50.714 LMO calls / sec: 589.8962811058091 Nodes / sec: 35.78893402216351 LMO calls / node: 16.482644628099173 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2620 Local tightenings / node: 1.49 Total number of potential local tightenings: 6078 Number of alternative decisions: 567 Number of stable decisions: 340 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 1.790000e-01 1.675978e+01 146 42 60 3859 40 6 * 10 11 3.566798e-02 3.102006e+01 3.098440e+01 8.686894e+02 1.054000e+00 1.992410e+01 57 28 387 858 22 20 * 42 43 4.117898e+00 2.929131e+01 2.517341e+01 6.113170e+00 2.086000e+00 4.074784e+01 26 16 1246 239 12 4 100 99 7.803204e+00 2.929131e+01 2.148810e+01 2.753754e+00 4.208000e+00 4.729087e+01 12 7 2713 74 15 5 200 191 1.087295e+01 2.929131e+01 1.841836e+01 1.693961e+00 8.766000e+00 4.460415e+01 72 39 5180 541 21 3 * 277 262 1.218791e+01 2.836265e+01 1.617474e+01 1.327113e+00 1.164000e+01 4.664948e+01 20 12 7113 113 8 0 300 285 1.307679e+01 2.836265e+01 1.528586e+01 1.168931e+00 1.245000e+01 4.730924e+01 31 20 7720 238 16 12 400 365 1.571596e+01 2.836265e+01 1.264668e+01 8.047032e-01 1.524600e+01 5.043946e+01 25 15 10084 220 18 20 500 435 1.787626e+01 2.836265e+01 1.048638e+01 5.866095e-01 1.805700e+01 5.200199e+01 23 15 12358 170 18 14 600 475 1.938601e+01 2.836265e+01 8.976640e+00 4.630474e-01 2.086700e+01 5.170844e+01 57 30 14398 492 0 0 700 503 2.029854e+01 2.836265e+01 8.064109e+00 3.972754e-01 2.420300e+01 4.986985e+01 24 16 16275 68 7 5 800 537 2.138349e+01 2.836265e+01 6.979159e+00 3.263808e-01 2.773500e+01 4.835046e+01 24 16 18191 70 0 0 900 561 2.251789e+01 2.836265e+01 5.844756e+00 2.595606e-01 3.097000e+01 4.730384e+01 43 24 19955 298 20 14 1000 561 2.349055e+01 2.836265e+01 4.872095e+00 2.074066e-01 3.372400e+01 4.640612e+01 35 22 21466 179 14 5 1100 547 2.428872e+01 2.836265e+01 4.073929e+00 1.677293e-01 3.637900e+01 4.538333e+01 9 6 22893 9 0 0 1200 509 2.487672e+01 2.836265e+01 3.485925e+00 1.401280e-01 3.874600e+01 4.421102e+01 19 13 24218 38 0 0 1300 471 2.555887e+01 2.836265e+01 2.803774e+00 1.096986e-01 4.108500e+01 4.320312e+01 30 18 25476 192 15 9 1400 425 2.622889e+01 2.836265e+01 2.133757e+00 8.135140e-02 4.305600e+01 4.247956e+01 8 5 26622 48 6 1 1500 351 2.681008e+01 2.836265e+01 1.552565e+00 5.790973e-02 4.479600e+01 4.140995e+01 6 4 27545 6 0 0 1600 263 2.726683e+01 2.836265e+01 1.095812e+00 4.018846e-02 4.647800e+01 4.016954e+01 13 8 28440 36 0 0 1700 177 2.766367e+01 2.836265e+01 6.989795e-01 2.526706e-02 4.787800e+01 3.928736e+01 8 5 29203 9 0 0 1787 92 2.808981e+01 2.836265e+01 2.728353e-01 9.712964e-03 4.905400e+01 3.838627e+01 8 5 29837 22 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404966 Dual Bound: 28.08980970587148 Dual Gap (relative): 0.009712964323729657 Search Statistics. Total number of nodes processed: 1883 Total number of lmo calls: 29837 Total time (s): 49.055 LMO calls / sec: 608.2356538579146 Nodes / sec: 38.38548567933952 LMO calls / node: 15.845459373340415 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1925 Local tightenings / node: 1.08 Total number of potential local tightenings: 4365 Number of alternative decisions: 226 Number of stable decisions: 715 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.220000e-01 1.351351e+01 213 56 60 3859 40 6 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 4.770000e-01 1.886792e+01 83 39 185 1051 27 29 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 8.800000e-01 1.477273e+01 56 26 263 958 27 34 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.126000e+00 2.042629e+01 46 23 443 685 25 15 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 2.658000e+00 2.821670e+01 40 21 1297 379 19 22 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 8.351000e+00 2.406897e+01 69 40 3291 470 23 19 200 201 1.669741e+01 2.836265e+01 1.166524e+01 6.986258e-01 1.519800e+01 2.638505e+01 91 61 6128 257 18 18 300 297 1.877956e+01 2.836265e+01 9.583087e+00 5.102935e-01 2.141900e+01 2.787245e+01 49 30 8830 262 16 7 400 393 2.048363e+01 2.836265e+01 7.879012e+00 3.846492e-01 2.755000e+01 2.878403e+01 58 36 11546 271 20 19 500 467 2.164530e+01 2.836265e+01 6.717344e+00 3.103373e-01 3.325500e+01 2.907833e+01 28 18 13972 124 0 0 600 539 2.275196e+01 2.836265e+01 5.610686e+00 2.466023e-01 3.844500e+01 2.962674e+01 50 31 16438 226 18 14 700 573 2.371222e+01 2.836265e+01 4.650425e+00 1.961193e-01 4.299200e+01 2.961016e+01 10 7 18499 21 0 0 800 569 2.442888e+01 2.836265e+01 3.933764e+00 1.610292e-01 4.657200e+01 2.939534e+01 6 5 20364 18 0 0 900 527 2.527239e+01 2.836265e+01 3.090256e+00 1.222780e-01 4.946600e+01 2.884810e+01 39 23 21873 279 16 10 1000 471 2.585359e+01 2.836265e+01 2.509055e+00 9.704862e-02 5.208200e+01 2.824392e+01 16 11 23166 18 0 0 1100 399 2.633087e+01 2.836265e+01 2.031774e+00 7.716319e-02 5.463900e+01 2.743462e+01 24 17 24369 51 0 0 1200 315 2.695392e+01 2.836265e+01 1.408726e+00 5.226423e-02 5.682800e+01 2.665939e+01 15 10 25329 56 0 0 1300 227 2.742554e+01 2.836265e+01 9.371034e-01 3.416900e-02 5.889400e+01 2.592794e+01 35 22 26260 158 16 13 1363 172 2.771346e+01 2.836265e+01 6.491804e-01 2.342473e-02 6.000200e+01 2.558248e+01 6 4 26773 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 27.713464674697715 Dual Gap (relative): 0.0234247272337605 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 26773 Total time (s): 60.003 LMO calls / sec: 446.19435694881923 Nodes / sec: 25.582054230621804 LMO calls / node: 17.44169381107492 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2444 Local tightenings / node: 1.79 Total number of potential local tightenings: 5198 Number of alternative decisions: 719 Number of stable decisions: 48 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.590000e-01 1.158301e+01 253 83 60 3859 40 6 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 6.060000e-01 1.485149e+01 108 53 185 1051 27 29 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 8.330000e-01 1.560624e+01 96 47 263 958 27 34 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.301000e+00 1.767871e+01 87 48 443 685 25 15 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 3.407000e+00 2.201350e+01 62 37 1297 379 19 22 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 8.302000e+00 2.421103e+01 81 44 3291 470 23 19 200 201 1.669741e+01 2.836265e+01 1.166524e+01 6.986258e-01 1.484500e+01 2.701246e+01 61 40 6128 257 18 18 300 297 1.877956e+01 2.836265e+01 9.583087e+00 5.102935e-01 2.061100e+01 2.896512e+01 46 29 8830 262 16 7 400 393 2.048363e+01 2.836265e+01 7.879012e+00 3.846492e-01 2.702500e+01 2.934320e+01 63 39 11546 271 20 19 500 467 2.164530e+01 2.836265e+01 6.717344e+00 3.103373e-01 3.264800e+01 2.961897e+01 32 21 13972 124 0 0 600 539 2.275196e+01 2.836265e+01 5.610686e+00 2.466023e-01 3.811000e+01 2.988717e+01 45 28 16438 226 18 14 700 573 2.371222e+01 2.836265e+01 4.650425e+00 1.961193e-01 4.220600e+01 3.016159e+01 12 8 18499 21 0 0 800 569 2.442888e+01 2.836265e+01 3.933764e+00 1.610292e-01 4.604800e+01 2.972985e+01 8 6 20364 18 0 0 900 525 2.527555e+01 2.836265e+01 3.087090e+00 1.221374e-01 4.902800e+01 2.906502e+01 14 9 21875 24 0 0 1000 471 2.586641e+01 2.836265e+01 2.496239e+00 9.650504e-02 5.183100e+01 2.838070e+01 44 30 23189 160 14 7 1100 395 2.634773e+01 2.836265e+01 2.014911e+00 7.647379e-02 5.435200e+01 2.750589e+01 13 9 24404 20 0 0 1200 309 2.698683e+01 2.836265e+01 1.375818e+00 5.098111e-02 5.631300e+01 2.679665e+01 20 14 25373 63 0 0 1300 215 2.746612e+01 2.836265e+01 8.965201e-01 3.264094e-02 5.811800e+01 2.606766e+01 10 7 26324 12 0 0 1400 121 2.789306e+01 2.836265e+01 4.695868e-01 1.683526e-02 5.968700e+01 2.548294e+01 5 4 27140 9 0 0 1425 98 2.797862e+01 2.836265e+01 3.840206e-01 1.372550e-02 6.000200e+01 2.538249e+01 7 5 27332 3 8 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 27.978624441732276 Dual Gap (relative): 0.013725499067062564 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27332 Total time (s): 60.002 LMO calls / sec: 455.51814939502015 Nodes / sec: 25.382487250424983 LMO calls / node: 17.946158896913985 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2464 Local tightenings / node: 1.73 Total number of potential local tightenings: 5221 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 1.342000e+00 2.235469e+00 160 53 60 3859 40 6 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 1.546000e+00 5.821475e+00 64 30 185 1051 27 29 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 1.696000e+00 7.665094e+00 63 31 263 958 27 34 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.999000e+00 1.150575e+01 54 29 443 685 25 15 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 3.484000e+00 2.152698e+01 39 23 1297 379 19 22 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 6.489000e+00 3.097550e+01 44 26 3291 470 23 19 200 199 1.683444e+01 2.836265e+01 1.152821e+01 6.847990e-01 1.050800e+01 3.797107e+01 36 18 6152 536 19 11 300 287 1.908757e+01 2.836265e+01 9.275073e+00 4.859221e-01 1.380500e+01 4.252083e+01 24 17 8820 126 13 10 400 351 2.074756e+01 2.836265e+01 7.615082e+00 3.670350e-01 1.688800e+01 4.446945e+01 37 20 11231 504 24 13 500 401 2.224986e+01 2.836265e+01 6.112786e+00 2.747337e-01 1.970600e+01 4.572212e+01 10 7 13445 52 0 0 600 413 2.367262e+01 2.836265e+01 4.690022e+00 1.981201e-01 2.205100e+01 4.593896e+01 27 16 15335 310 16 12 700 403 2.441791e+01 2.836265e+01 3.944739e+00 1.615511e-01 2.418500e+01 4.560678e+01 11 8 17058 42 0 0 800 361 2.537897e+01 2.836265e+01 2.983676e+00 1.175649e-01 2.598900e+01 4.467275e+01 15 11 18480 40 0 0 900 307 2.613915e+01 2.836265e+01 2.223491e+00 8.506361e-02 2.754800e+01 4.381443e+01 7 5 19758 20 0 0 1000 231 2.685606e+01 2.836265e+01 1.506588e+00 5.609864e-02 2.895600e+01 4.251278e+01 7 5 20795 19 0 0 1100 143 2.762750e+01 2.836265e+01 7.351415e-01 2.660905e-02 3.028200e+01 4.104749e+01 12 9 21667 29 0 0 1193 54 2.808711e+01 2.836265e+01 2.755323e-01 9.809920e-03 3.167300e+01 3.937107e+01 9 6 22386 18 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404966 Dual Bound: 28.087112692665357 Dual Gap (relative): 0.00980992014930608 Search Statistics. Total number of nodes processed: 1247 Total number of lmo calls: 22386 Total time (s): 31.674 LMO calls / sec: 706.7626444402349 Nodes / sec: 39.36983014459809 LMO calls / node: 17.95188452285485 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2141 Local tightenings / node: 1.79 Total number of potential local tightenings: 4657 Decisions made: [(62, 1), (525, 0), (35, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.270000e-01 1.321586e+01 222 70 60 3859 40 6 * 8 9 1.956446e+00 3.184231e+01 2.988586e+01 1.527559e+01 9.850000e-01 1.725888e+01 98 48 341 1068 31 13 * 19 20 4.778378e+00 2.836265e+01 2.358427e+01 4.935622e+00 1.847000e+00 2.111532e+01 75 40 712 557 18 32 100 101 1.152084e+01 2.836265e+01 1.684180e+01 1.461855e+00 7.592000e+00 2.647524e+01 77 44 3285 553 26 28 200 201 1.510100e+01 2.836265e+01 1.326164e+01 8.781962e-01 1.383300e+01 2.898865e+01 46 29 6185 219 18 16 300 287 1.820383e+01 2.836265e+01 1.015882e+01 5.580595e-01 1.926500e+01 3.046976e+01 49 27 8857 459 18 11 400 359 2.024588e+01 2.836265e+01 8.116764e+00 4.009094e-01 2.441900e+01 3.108235e+01 33 20 11377 184 12 7 500 415 2.197019e+01 2.836265e+01 6.392451e+00 2.909601e-01 2.883700e+01 3.173007e+01 60 33 13593 479 18 14 600 447 2.324487e+01 2.836265e+01 5.117774e+00 2.201679e-01 3.282300e+01 3.189836e+01 36 25 15668 119 16 1 700 441 2.428848e+01 2.836265e+01 4.074162e+00 1.677405e-01 3.611000e+01 3.159790e+01 9 6 17354 11 0 0 800 405 2.505241e+01 2.836265e+01 3.310237e+00 1.321325e-01 3.898700e+01 3.090774e+01 11 8 18878 10 0 0 900 369 2.581226e+01 2.836265e+01 2.550385e+00 9.880520e-02 4.186900e+01 3.030882e+01 46 25 20291 319 18 9 1000 299 2.664636e+01 2.836265e+01 1.716285e+00 6.440973e-02 4.393900e+01 2.956371e+01 6 5 21414 12 0 0 1100 217 2.729234e+01 2.836265e+01 1.070304e+00 3.921628e-02 4.568700e+01 2.882658e+01 16 11 22412 16 0 0 1200 123 2.781518e+01 2.836265e+01 5.474630e-01 1.968217e-02 4.745700e+01 2.787787e+01 16 11 23254 38 0 0 1277 48 2.809534e+01 2.836265e+01 2.673071e-01 9.514286e-03 4.866000e+01 2.722976e+01 5 4 23838 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404966 Dual Bound: 28.095337949928382 Dual Gap (relative): 0.009514285820408338 Search Statistics. Total number of nodes processed: 1325 Total number of lmo calls: 23838 Total time (s): 48.661 LMO calls / sec: 489.87895850886747 Nodes / sec: 27.22919792030579 LMO calls / node: 17.990943396226417 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2183 Local tightenings / node: 1.71 Total number of potential local tightenings: 4800 Decisions made: [(78, 0), (562, 0), (22, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.460000e-01 1.219512e+01 241 73 60 3859 40 6 * 8 9 1.956446e+00 3.184231e+01 2.988586e+01 1.527559e+01 9.870000e-01 1.722391e+01 105 52 341 1068 31 13 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 154 running 1 of 1 signal (10): User defined signal 1 #is_bound_feasible#96 at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/utilities.jl:323 is_bound_feasible at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/utilities.jl:321 [inlined] #split_vertices_set!#90 at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/utilities.jl:198 split_vertices_set! at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/utilities.jl:185 [inlined] get_branching_nodes_info at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/node.jl:172 branch! at /home/pkgeval/.julia/packages/Bonobo/TTu7F/src/branching.jl:10 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/custom_bonobo.jl:97 optimize! at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/custom_bonobo.jl:29 unknown function (ip: 0x773ac5caf90a) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#109 at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/interface.jl:272 unknown function (ip: 0x773ac5c94a99) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 solve at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/GVHgb/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x773ac5c8e70c) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:757 jl_eval_toplevel_stmts at /source/src/toplevel.c:600 jl_toplevel_eval_flex at /source/src/toplevel.c:698 ijl_toplevel_eval at /source/src/toplevel.c:769 ijl_toplevel_eval_in at /source/src/toplevel.c:814 eval at ./boot.jl:489 include_string at ./loading.jl:3124 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3184 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_48260.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:757 jl_eval_toplevel_stmts at /source/src/toplevel.c:600 jl_toplevel_eval_flex at /source/src/toplevel.c:698 ijl_toplevel_eval at /source/src/toplevel.c:769 ijl_toplevel_eval_in at /source/src/toplevel.c:814 eval at ./boot.jl:489 include_string at ./loading.jl:3124 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3184 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_48260.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:757 jl_eval_toplevel_stmts at /source/src/toplevel.c:600 jl_toplevel_eval_flex at /source/src/toplevel.c:698 ijl_toplevel_eval at /source/src/toplevel.c:769 ijl_toplevel_eval_in at /source/src/toplevel.c:814 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:577 jfptr__start_79971.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2285 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x773aefc87249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) * 19 20 4.778378e+00 2.836265e+01 2.358427e+01 4.935622e+00 2.334000e+00 1.670951e+01 148 99 713 557 18 32 ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 100 101 1.217855e+01 2.836265e+01 1.618410e+01 1.328902e+00 7.569000e+00 2.655569e+01 60 37 3275 238 18 13 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_56683.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2285 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000077ef1e6843d0 Total snapshots: 324. Utilization: 0% ╎324 @Base/task.jl:1168 wait_forever() 323╎ 324 @Base/task.jl:1246 wait() 200 201 1.593668e+01 2.836265e+01 1.242596e+01 7.797080e-01 1.605200e+01 2.498131e+01 69 43 6118 372 17 22 [154] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/GVHgb/test/branching_strategy_test.jl:275 eventExecEstim at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) unknown function (ip: 0x3fffff) at (unknown file) unknown function (ip: (nil)) at (unknown file) Allocations: 5363356670 (Pool: 5363352343; Big: 4327); GC: 2887 PkgEval terminated after 2725.52s: test duration exceeded the time limit