Package evaluation to test Boscia on Julia 1.14.0-DEV.1384 (b34261b5d0*) started at 2025-12-18T17:30:53.676 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.77s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.3 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.3 [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.0 [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 5.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 14.31s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_saDfJ9/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.4 [36b166db] Boscia v0.2.3 [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_saDfJ9/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.3 [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.36 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [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.8 [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... ┌ Warning: The call to compilecache failed to create a usable precompiled cache file for SCIP [82193955-e24f-5292-bf16-6f2c5261a85f] │ exception = Required dependency Base.PkgId(Base.UUID("656ef2d0-ae68-5445-9ca0-591084a874a2"), "OpenBLAS32_jll") failed to load from a cache file. └ @ Base loading.jl:2923 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("82193955-e24f-5292-bf16-6f2c5261a85f"), "SCIP") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=0, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:44  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2845  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2697  [4] macro expansion  @ ./loading.jl:2625 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2589  [7] require  @ ./loading.jl:2565 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using  @ ./module.jl:137 [inlined]  [11] _eval_using(to::Module, path::Expr)  @ Base ./module.jl:137  [12] top-level scope  @ ~/.julia/packages/Boscia/gDHaL/ext/BosciaSCIPExt.jl:6  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:309  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3282  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3124  [18] include_string  @ ./loading.jl:3134 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [20] _start()  @ Base ./client.jl:577 in expression starting at /home/pkgeval/.julia/packages/Boscia/gDHaL/ext/BosciaSCIPExt.jl:1 in expression starting at stdin:5 1 dependency had output during precompilation: ┌ Boscia → BosciaSCIPExt │ [Output was shown above] └ ┌ Error: Error during loading of extension BosciaSCIPExt of Boscia, use `Base.retry_load_extensions()` to retry. │ exception = │ 1-element ExceptionStack: │ The following 1 package failed to precompile: │ │ BosciaSCIPExt │ Failed to precompile BosciaSCIPExt [d60314e3-8fcd-5c74-bd3d-94b98b1cab94] to "/home/pkgeval/.julia/compiled/v1.14/BosciaSCIPExt/jl_H31XeM" (ProcessExited(1)). │ └ @ Base loading.jl:1753 Interface Tests seed = 0x667020e993f276f8 ┌ 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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/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##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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/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##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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/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##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#40#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/gDHaL/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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/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##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 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/src/callbacks.jl:252 [ 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#40#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/gDHaL/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#40#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/gDHaL/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#40#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/gDHaL/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#40#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/gDHaL/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 = 0x3c387663ca66c49a ┌ 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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/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##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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/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##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#40#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/gDHaL/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#40#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/gDHaL/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0x23900351a4812e5a ┌ 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#40#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/gDHaL/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#40#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/gDHaL/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#40#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/gDHaL/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 = 0x180b09472c483864 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 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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/gDHaL/src/callbacks.jl:252 * 1 0 1.592543e+00 1.592543e+00 0.000000e+00 0.000000e+00 1.545900e+01 6.468724e-02 4639 5 2 0 1 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 1.592543e+00 1.592543e+00 0.000000e+00 3.536322e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 1.592543e+00 1.592543e+00 0.000000e+00 2.338693e+00 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 (tree empty) Primal Objective: 1.5925428288862655 Dual Bound: 1.5925428288862655 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 6 Total time (s): 24.574 LMO calls / sec: 0.24416049483193616 Nodes / sec: 0.040693415805322694 LMO calls / node: 6.0 Total number of global tightenings: 50 Global tightenings / node: 50.0 Total number of local tightenings: 50 Local tightenings / node: 50.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 1.433549e+00 3.331334e+00 1.897785e+00 1.323837e+00 1.712300e+01 1.752029e-01 9013 492 50 117 33 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/src/callbacks.jl:252 100 51 2.453122e+00 3.331334e+00 8.782123e-01 3.579978e-01 2.996300e+01 5.039549e+00 54 41 1252 20 20 0 200 51 2.559215e+00 3.331334e+00 7.721192e-01 3.017016e-01 3.436900e+01 7.303093e+00 46 34 1647 23 18 0 300 51 2.623864e+00 3.331334e+00 7.074705e-01 2.696293e-01 3.819300e+01 9.190166e+00 52 38 2061 34 11 0 400 51 2.674667e+00 3.331334e+00 6.566677e-01 2.455138e-01 4.248000e+01 1.061676e+01 67 49 2495 33 18 1 500 51 2.718192e+00 3.331334e+00 6.131422e-01 2.255698e-01 4.637100e+01 1.188243e+01 33 24 2945 27 15 1 600 51 2.763919e+00 3.331334e+00 5.674155e-01 2.052938e-01 4.955400e+01 1.313718e+01 46 33 3416 37 13 1 700 51 2.807619e+00 3.331334e+00 5.237155e-01 1.865337e-01 5.297500e+01 1.417650e+01 49 35 3927 33 13 2 800 51 2.855503e+00 3.331334e+00 4.758316e-01 1.666367e-01 5.657400e+01 1.504225e+01 21 17 4494 8 3 0 900 51 2.907752e+00 3.331334e+00 4.235826e-01 1.456736e-01 5.993800e+01 1.586640e+01 44 32 5035 45 13 5 1000 51 2.969625e+00 3.331334e+00 3.617092e-01 1.218030e-01 6.333000e+01 1.659561e+01 42 29 5590 44 10 4 1100 51 3.075399e+00 3.331334e+00 2.559352e-01 8.322014e-02 6.654900e+01 1.729553e+01 26 20 6131 12 3 0 1199 6 3.299078e+00 3.331334e+00 3.225596e-02 9.777265e-03 6.917200e+01 1.742034e+01 16 13 6561 2 2 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 7.781140e+00 -1.708302e-01 7.951970e+00 0.000000e+00 Inf 1 LD 2 3.331334e+00 3.331334e+00 0.000000e+00 1.399507e-01 1.429075e+01 1 Last 2 3.331334e+00 3.331334e+00 0.000000e+00 2.783341e-01 7.185609e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.331334e+00 3.331334e+00 0.000000e+00 2.825079e-01 7.079447e+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: 3.3313343993431763 Dual Bound: 3.2990784355724507 Dual Gap (relative): 0.009777264894015347 Search Statistics. Total number of nodes processed: 1205 Total number of lmo calls: 6566 Total time (s): 71.012 LMO calls / sec: 92.46324564862277 Nodes / sec: 16.968962992170336 LMO calls / node: 5.44896265560166 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: 22 Non zero entries: 10th entry: 0.16045138905988438 35th entry: 0.16045138905988438 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 1.577757e+00 3.331334e+00 1.753577e+00 1.111437e+00 4.150000e-01 7.228916e+00 406 325 50 117 33 1 100 34 2.520306e+00 3.331334e+00 8.110281e-01 3.217974e-01 8.817000e+00 1.519791e+01 25 18 1223 21 14 0 200 25 2.664539e+00 3.331334e+00 6.667951e-01 2.502478e-01 1.212600e+01 1.855517e+01 36 27 1709 21 8 0 300 25 2.776018e+00 3.331334e+00 5.553167e-01 2.000408e-01 1.634100e+01 1.988862e+01 32 24 2377 29 13 1 400 25 2.871705e+00 3.331334e+00 4.596290e-01 1.600544e-01 2.126600e+01 1.998495e+01 52 37 3158 80 19 6 500 25 2.977299e+00 3.331334e+00 3.540353e-01 1.189116e-01 2.667700e+01 1.967987e+01 38 28 4019 35 7 0 600 24 3.167388e+00 3.331334e+00 1.639469e-01 5.176091e-02 3.144600e+01 1.984354e+01 29 22 4849 12 3 0 636 5 3.299909e+00 3.331334e+00 3.142553e-02 9.523152e-03 3.296600e+01 1.944428e+01 33 25 5118 26 5 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 7.781140e+00 -1.708302e-01 7.951970e+00 0.000000e+00 Inf 1 LD 2 3.331334e+00 3.331334e+00 0.000000e+00 1.229418e-03 1.626786e+03 1 Last 2 3.331334e+00 3.331334e+00 0.000000e+00 9.053404e-03 2.209114e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.331334e+00 3.331334e+00 0.000000e+00 1.339332e-02 1.493281e+02 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: 3.3313343993431763 Dual Bound: 3.299908866826557 Dual Gap (relative): 0.009523151633832985 Search Statistics. Total number of nodes processed: 641 Total number of lmo calls: 5123 Total time (s): 32.994 LMO calls / sec: 155.27065527065528 Nodes / sec: 19.427774746923685 LMO calls / node: 7.99219968798752 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: 20 Poisson Tests seed = 0x10a12115b0f6d6c3 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 -1.598840e+03 -1.553012e+03 4.582845e+01 2.950940e-02 1.358600e+01 2.208155e-01 7593 136 42 943 8 9 * 3 4 -1.597250e+03 -1.565555e+03 3.169526e+01 2.024539e-02 1.555100e+01 4.501318e-01 1076 76 96 795 12 12 * 5 6 -1.596089e+03 -1.565564e+03 3.052478e+01 1.949763e-02 1.810700e+01 6.074999e-01 1121 87 148 778 6 4 * 65 0 -1.589579e+03 -1.589578e+03 6.662010e-04 4.191055e-07 7.977200e+01 1.617109e+00 209 40 1702 149 9 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 2.039553e+03 -2.065510e+03 4.105063e+03 0.000000e+00 Inf 1 LD 2 -1.586114e+03 -1.642975e+03 5.686101e+01 1.431582e-01 1.397056e+01 2 LD 16 -1.589032e+03 -1.598731e+03 9.699595e+00 3.916065e-01 4.085734e+01 2 LD 48 -1.589502e+03 -1.593310e+03 3.807368e+00 4.350443e-01 1.103336e+02 4 LD 61 -1.589562e+03 -1.591312e+03 1.749990e+00 4.508730e-01 1.352931e+02 3 LD 69 -1.589570e+03 -1.590422e+03 8.520380e-01 4.644607e-01 1.485594e+02 4 LD 101 -1.589577e+03 -1.589873e+03 2.963031e-01 5.060019e-01 1.996040e+02 6 LD 141 -1.589578e+03 -1.589690e+03 1.114768e-01 5.516072e-01 2.556167e+02 7 LD 173 -1.589578e+03 -1.589616e+03 3.779724e-02 5.843177e-01 2.960718e+02 7 LD 213 -1.589578e+03 -1.589594e+03 1.573417e-02 6.315063e-01 3.372888e+02 7 LD 239 -1.589578e+03 -1.589583e+03 5.185995e-03 6.635999e-01 3.601568e+02 7 LD 274 -1.589578e+03 -1.589581e+03 2.477992e-03 7.019944e-01 3.903165e+02 7 LD 306 -1.589578e+03 -1.589579e+03 1.187270e-03 7.333122e-01 4.172847e+02 7 LD 336 -1.589578e+03 -1.589579e+03 5.028227e-04 7.622989e-01 4.407720e+02 7 LD 371 -1.589578e+03 -1.589579e+03 1.980266e-04 7.939697e-01 4.672723e+02 7 LD 404 -1.589578e+03 -1.589578e+03 9.352923e-05 8.249390e-01 4.897332e+02 7 LD 440 -1.589578e+03 -1.589578e+03 3.379685e-05 8.609881e-01 5.110407e+02 8 LD 478 -1.589578e+03 -1.589578e+03 1.255008e-05 8.954943e-01 5.337834e+02 8 P 1000 -1.589578e+03 -1.589578e+03 1.255008e-05 1.362897e+00 7.337314e+02 8 P 2000 -1.589578e+03 -1.589578e+03 1.255008e-05 2.155978e+00 9.276533e+02 8 P 3000 -1.589578e+03 -1.589578e+03 1.255008e-05 2.862895e+00 1.047890e+03 8 P 4000 -1.589578e+03 -1.589578e+03 1.255008e-05 3.507595e+00 1.140382e+03 8 P 5000 -1.589578e+03 -1.589578e+03 1.255008e-05 4.170220e+00 1.198977e+03 8 P 6000 -1.589578e+03 -1.589578e+03 1.255008e-05 4.858017e+00 1.235072e+03 8 P 7000 -1.589578e+03 -1.589578e+03 1.255008e-05 5.539114e+00 1.263740e+03 8 P 8000 -1.589578e+03 -1.589578e+03 1.255008e-05 6.235061e+00 1.283067e+03 8 P 9000 -1.589578e+03 -1.589578e+03 1.255008e-05 6.895228e+00 1.305250e+03 8 P 10000 -1.589578e+03 -1.589578e+03 1.255008e-05 7.562698e+00 1.322279e+03 8 Last 10001 -1.589578e+03 -1.589578e+03 1.234900e-05 7.567588e+00 1.321557e+03 8 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.589578e+03 -1.589578e+03 1.234900e-05 7.570558e+00 1.321039e+03 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: -1589.578309697487 Dual Bound: -1589.5783220464868 Dual Gap (relative): 7.768726989749267e-9 Search Statistics. Total number of nodes processed: 129 Total number of lmo calls: 1731 Total time (s): 89.007 LMO calls / sec: 19.447908591459097 Nodes / sec: 1.4493242104553574 LMO calls / node: 13.418604651162791 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 -1.246811e+03 -1.245525e+03 1.285413e+00 1.032025e-03 1.365500e+01 2.196997e-01 5253 34 6 4 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 -6.470063e+02 -1.279975e+03 6.329687e+02 0.000000e+00 Inf 1 LD 2 -1.245525e+03 -1.245525e+03 0.000000e+00 1.379821e-01 1.449463e+01 1 Last 2 -1.245525e+03 -1.245525e+03 0.000000e+00 2.819394e-01 7.093723e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.245525e+03 -1.245525e+03 0.000000e+00 2.867147e-01 6.975576e+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: -1245.5253172295663 Dual Bound: -1246.8107307001703 Dual Gap (relative): 0.001032025164661571 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 15.694 LMO calls / sec: 0.700904804383841 Nodes / sec: 0.19115585574104751 LMO calls / node: 3.6666666666666665 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.919818e+02 3.624384e+02 1.704566e+02 8.878788e-01 1.052800e+01 2.849544e-01 5835 158 25 84 9 0 * 2 3 1.919818e+02 3.619406e+02 1.699588e+02 8.852858e-01 1.073900e+01 4.655927e-01 198 115 45 63 8 0 * 3 4 2.117124e+02 3.502595e+02 1.385470e+02 6.544113e-01 1.099800e+01 6.364794e-01 251 125 67 103 6 0 * 25 26 2.622301e+02 3.489097e+02 8.667963e+01 3.305480e-01 1.576000e+01 3.236041e+00 257 99 450 118 6 0 100 91 3.052700e+02 3.489097e+02 4.363975e+01 1.429546e-01 2.686300e+01 7.110152e+00 278 76 1439 161 4 0 200 77 3.339487e+02 3.489097e+02 1.496103e+01 4.480038e-02 3.397700e+01 8.152574e+00 28 18 2180 6 2 1 269 18 3.457819e+02 3.489097e+02 3.127860e+00 9.045759e-03 3.660400e+01 7.840673e+00 38 26 2501 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.489097e+02 3.489097e+02 0.000000e+00 1.302040e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.489097e+02 3.489097e+02 0.000000e+00 1.502968e-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: 348.90973716021506 Dual Bound: 345.78187763130995 Dual Gap (relative): 0.009045758992147606 Search Statistics. Total number of nodes processed: 287 Total number of lmo calls: 2505 Total time (s): 38.294 LMO calls / sec: 65.41494751135949 Nodes / sec: 7.494646680942185 LMO calls / node: 8.72822299651568 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.919818e+02 3.624384e+02 1.704566e+02 8.878788e-01 1.493300e+01 2.008973e-01 6503 162 25 84 4 0 * 7 8 2.221537e+02 3.621882e+02 1.400345e+02 6.303496e-01 2.170600e+01 6.910532e-01 277 138 157 107 6 2 * 12 13 2.336592e+02 3.521100e+02 1.184509e+02 5.069386e-01 2.691300e+01 9.289191e-01 211 93 253 100 3 0 * 16 17 2.442731e+02 3.502595e+02 1.059864e+02 4.338848e-01 3.057600e+01 1.079278e+00 96 55 319 54 4 0 * 53 50 2.859417e+02 3.489097e+02 6.296802e+01 2.202128e-01 6.013200e+01 1.712898e+00 107 65 861 28 1 1 100 69 3.058460e+02 3.489097e+02 4.306377e+01 1.408021e-01 8.465500e+01 1.996338e+00 79 49 1359 31 4 0 200 65 3.343930e+02 3.489097e+02 1.451670e+01 4.341208e-02 1.146820e+02 2.310738e+00 13 10 2009 2 1 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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/gDHaL/src/callbacks.jl:252 249 28 3.457021e+02 3.489097e+02 3.207595e+00 9.278494e-03 1.190350e+02 2.327047e+00 13 10 2185 2 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.489097e+02 3.489097e+02 0.000000e+00 7.452359e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.489097e+02 3.489097e+02 0.000000e+00 1.061537e-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: 348.90973716021506 Dual Bound: 345.7021419397927 Dual Gap (relative): 0.009278493915091246 Search Statistics. Total number of nodes processed: 277 Total number of lmo calls: 2189 Total time (s): 120.176 LMO calls / sec: 18.214951404606577 Nodes / sec: 2.304952735987219 LMO calls / node: 7.902527075812275 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 = 0xf5d12b2b12f2b934 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 -2.808341e+01 3.623562e+01 6.431903e+01 Inf 9.467000e+00 3.168903e-01 4777 90 40 10001 18 7 * 15 16 -1.504748e+01 1.764706e+01 3.269455e+01 Inf 1.918900e+01 1.615509e+00 810 121 468 10001 15 6 84 75 -2.546686e+00 1.764706e+01 2.019375e+01 Inf 6.000300e+01 2.649868e+00 822 57 2429 9525 17 13 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 17.64706460620866 Dual Bound: -2.5466855505004133 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 159 Total number of lmo calls: 2429 Total time (s): 60.562 LMO calls / sec: 40.10765826756052 Nodes / sec: 2.62540867210462 LMO calls / node: 15.276729559748428 Total number of global tightenings: 10 Global tightenings / node: 0.12 Total number of local tightenings: 582 Local tightenings / node: 6.93 Total number of potential local tightenings: 877 Time Limit Test seed = 0x7a998cde1f06c124 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 -1.073875e+00 0.000000e+00 1.073875e+00 Inf 9.706000e+00 3.090872e-01 5445 73 27 1420 10 4 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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##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}}}, 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/gDHaL/src/callbacks.jl:252 33 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.149800e+01 2.870064e+00 2 2 419 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: 0.0 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 33 Total number of lmo calls: 419 Total time (s): 11.98 LMO calls / sec: 34.974958263772955 Nodes / sec: 2.7545909849749584 LMO calls / node: 12.696969696969697 Total number of global tightenings: 4 Global tightenings / node: 0.12 Total number of local tightenings: 41 Local tightenings / node: 1.24 Total number of potential local tightenings: 45 Strong Convexity and Sharpness Tests seed = 0x4bccff029844c536 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 1 1.865256e+02 1.865262e+02 5.786684e-04 3.102353e-06 1.045000e+01 1.913876e-01 4479 0 6 4 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 186.5262275425674 Dual Bound: 186.5256488741923 Dual Gap (relative): 3.1023528323144162e-6 Search Statistics. Total number of nodes processed: 2 Total number of lmo calls: 6 Total time (s): 11.173 LMO calls / sec: 0.5370088606462007 Nodes / sec: 0.17900295354873355 LMO calls / node: 3.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 2.090198e+02 2.093563e+02 3.365021e-01 1.609905e-03 1.150700e+01 2.607109e-01 5496 0 10 13 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 209.35631426347348 Dual Bound: 209.01981217997505 Dual Gap (relative): 0.0016099052046257124 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 10 Total time (s): 12.11 LMO calls / sec: 0.8257638315441784 Nodes / sec: 0.24772914946325353 LMO calls / node: 3.3333333333333335 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0x4dc74bb1d43c9116 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 1.207000e+01 2.485501e-01 6319 57 49 3029 17 8 61 4 7.321158e+00 7.382204e+00 6.104569e-02 8.338255e-03 1.396700e+01 4.653827e+00 9 7 981 32 1 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): 14.471 LMO calls / sec: 67.79075392163638 Nodes / sec: 4.491742104899454 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 3.180000e-01 9.433962e+00 189 44 49 3029 1 4 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#40#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/gDHaL/src/callbacks.jl:252 100 1 7.304657e+00 7.382204e+00 7.754728e-02 1.061614e-02 2.136000e+00 4.728464e+01 11 7 1172 32 7 5 101 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 2.147000e+00 4.704238e+01 6 4 1177 11 7 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 2.148 LMO calls / sec: 547.9515828677839 Nodes / sec: 47.02048417132216 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 4.030000e-01 7.444169e+00 292 44 49 3029 1 4 75 4 7.351862e+00 7.382204e+00 3.034216e-02 4.127140e-03 1.945000e+00 4.061697e+01 7 5 1060 16 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.946 LMO calls / sec: 544.7070914696814 Nodes / sec: 40.59609455292909 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.970000e-01 1.010101e+01 191 37 49 3029 5 3 73 2 7.335011e+00 7.382204e+00 4.719352e-02 6.434009e-03 1.782000e+00 4.208754e+01 9 6 892 34 9 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.782 LMO calls / sec: 500.5611672278339 Nodes / sec: 42.08754208754209 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.120000e-01 1.415094e+01 143 28 49 3029 5 3 93 4 7.324917e+00 7.382204e+00 5.728716e-02 7.820862e-03 1.768000e+00 5.486425e+01 2 2 1196 2 1 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): 1.768 LMO calls / sec: 676.4705882352941 Nodes / sec: 54.86425339366516 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 3.460000e-01 8.670520e+00 342 56 60 3859 32 3 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 7.720000e-01 1.165803e+01 134 43 185 1051 17 16 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 1.126000e+00 1.154529e+01 130 42 263 958 17 25 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.728000e+00 1.331019e+01 158 44 443 685 14 7 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 3.969000e+00 1.889645e+01 62 27 1297 379 7 11 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 9.738000e+00 2.064079e+01 83 34 3291 470 7 3 200 201 1.669741e+01 2.836265e+01 1.166524e+01 6.986258e-01 1.752500e+01 2.288160e+01 70 38 6128 257 9 7 300 297 1.877956e+01 2.836265e+01 9.583087e+00 5.102935e-01 2.316300e+01 2.577386e+01 31 14 8830 262 6 4 400 393 2.048363e+01 2.836265e+01 7.879012e+00 3.846492e-01 2.851300e+01 2.781188e+01 101 29 11546 271 3 7 500 467 2.164530e+01 2.836265e+01 6.717344e+00 3.103373e-01 3.349900e+01 2.886653e+01 25 13 13972 124 10 17 600 539 2.275196e+01 2.836265e+01 5.610686e+00 2.466023e-01 3.880200e+01 2.935416e+01 45 22 16438 226 12 9 700 573 2.371222e+01 2.836265e+01 4.650425e+00 1.961193e-01 4.357800e+01 2.921199e+01 10 6 18499 21 9 12 800 569 2.442888e+01 2.836265e+01 3.933764e+00 1.610292e-01 4.687800e+01 2.920346e+01 8 5 20364 18 6 14 900 525 2.527555e+01 2.836265e+01 3.087090e+00 1.221374e-01 5.001900e+01 2.848917e+01 11 8 21875 24 11 11 1000 471 2.586641e+01 2.836265e+01 2.496239e+00 9.650504e-02 5.244900e+01 2.804629e+01 31 17 23189 160 12 1 1100 395 2.634773e+01 2.836265e+01 2.014911e+00 7.647379e-02 5.449900e+01 2.743170e+01 11 7 24404 20 7 4 1200 309 2.698683e+01 2.836265e+01 1.375818e+00 5.098111e-02 5.634000e+01 2.678381e+01 24 15 25373 63 12 8 1300 215 2.746612e+01 2.836265e+01 8.965201e-01 3.264094e-02 5.828400e+01 2.599341e+01 8 5 26324 12 7 5 1400 121 2.789306e+01 2.836265e+01 4.695868e-01 1.683526e-02 5.983300e+01 2.542075e+01 6 4 27140 9 5 4 1412 111 2.794729e+01 2.836265e+01 4.153522e-01 1.486198e-02 6.000200e+01 2.538249e+01 2 2 27233 1 4 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 27.947292864278015 Dual Gap (relative): 0.014861981915173255 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27233 Total time (s): 60.003 LMO calls / sec: 453.86064030131826 Nodes / sec: 25.382064230121827 LMO calls / node: 17.881155613919894 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2460 Local tightenings / node: 1.74 Total number of potential local tightenings: 5216 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.511000e+00 1.985440e+00 467 71 60 3859 32 3 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 1.975000e+00 4.556962e+00 156 44 185 1051 17 16 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 2.316000e+00 5.613126e+00 158 45 263 958 17 25 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 3.019000e+00 7.618417e+00 112 42 443 685 14 7 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 5.642000e+00 1.329316e+01 122 31 1297 379 7 11 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 1.103600e+01 1.821312e+01 81 33 3291 470 7 3 200 197 1.666621e+01 2.836265e+01 1.169643e+01 7.018052e-01 1.904200e+01 2.084865e+01 68 31 6075 316 15 3 300 261 1.834644e+01 2.836265e+01 1.001621e+01 5.459482e-01 2.490000e+01 2.253012e+01 53 25 8428 249 7 8 400 313 1.984864e+01 2.836265e+01 8.514008e+00 4.289467e-01 3.014200e+01 2.365470e+01 21 13 10639 54 8 10 500 349 2.103515e+01 2.836265e+01 7.327496e+00 3.483453e-01 3.454500e+01 2.457664e+01 41 20 12581 180 1 2 600 387 2.187919e+01 2.836265e+01 6.483455e+00 2.963297e-01 3.879300e+01 2.544273e+01 24 14 14473 89 2 5 700 403 2.283223e+01 2.836265e+01 5.530411e+00 2.422194e-01 4.218400e+01 2.614735e+01 26 17 16133 36 8 6 800 419 2.364765e+01 2.836265e+01 4.714992e+00 1.993852e-01 4.571400e+01 2.666579e+01 7 4 17803 8 7 2 900 413 2.432561e+01 2.836265e+01 4.037033e+00 1.659581e-01 4.899800e+01 2.679701e+01 10 7 19353 12 6 2 1000 401 2.516302e+01 2.836265e+01 3.199625e+00 1.271558e-01 5.209300e+01 2.689421e+01 13 9 20827 24 10 7 1100 359 2.578913e+01 2.836265e+01 2.573520e+00 9.979088e-02 5.468700e+01 2.667910e+01 19 13 22060 24 7 4 1200 317 2.638587e+01 2.836265e+01 1.976771e+00 7.491776e-02 5.681100e+01 2.670258e+01 7 5 23179 8 7 4 1300 279 2.677464e+01 2.836265e+01 1.588002e+00 5.930994e-02 5.861300e+01 2.693942e+01 8 6 24140 7 5 3 1378 235 2.715081e+01 2.836265e+01 1.211830e+00 4.463330e-02 6.001500e+01 2.687661e+01 55 52 24846 11 6 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 27.150814651523035 Dual Gap (relative): 0.04463329699073883 Search Statistics. Total number of nodes processed: 1613 Total number of lmo calls: 24846 Total time (s): 60.017 LMO calls / sec: 413.98270490027824 Nodes / sec: 26.87571854641185 LMO calls / node: 15.403595784252945 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2195 Local tightenings / node: 1.59 Total number of potential local tightenings: 5338 Number of alternative decisions: 435 Number of stable decisions: 371 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 4.230000e-01 7.092199e+00 377 65 60 3859 35 4 * 12 13 1.956446e+00 3.120765e+01 2.925120e+01 1.495120e+01 2.051000e+00 1.218918e+01 96 34 471 649 4 13 * 15 16 2.818141e+00 2.929131e+01 2.647317e+01 9.393839e+00 2.315000e+00 1.339093e+01 91 32 582 605 20 19 * 25 26 4.248026e+00 2.836265e+01 2.411462e+01 5.676665e+00 3.347000e+00 1.523753e+01 62 25 903 396 15 18 100 99 1.014511e+01 2.836265e+01 1.821753e+01 1.795696e+00 9.065000e+00 2.195256e+01 74 30 3100 409 6 9 200 191 1.413169e+01 2.836265e+01 1.423095e+01 1.007024e+00 1.621200e+01 2.411794e+01 87 33 5845 528 3 3 300 285 1.633323e+01 2.836265e+01 1.202941e+01 7.364992e-01 2.327300e+01 2.513642e+01 63 26 8470 300 9 8 400 351 1.816067e+01 2.836265e+01 1.020197e+01 5.617619e-01 2.936300e+01 2.557641e+01 58 27 10820 309 15 6 500 405 1.952477e+01 2.836265e+01 8.837872e+00 4.526491e-01 3.492700e+01 2.591119e+01 52 20 13035 346 6 5 600 457 2.068790e+01 2.836265e+01 7.674748e+00 3.709777e-01 3.970300e+01 2.662267e+01 72 29 15117 427 10 8 700 487 2.170125e+01 2.836265e+01 6.661395e+00 3.069590e-01 4.429000e+01 2.680063e+01 65 31 17098 290 15 4 800 505 2.256517e+01 2.836265e+01 5.797472e+00 2.569212e-01 4.849700e+01 2.690888e+01 42 25 18820 110 1 0 900 513 2.325203e+01 2.836265e+01 5.110614e+00 2.197922e-01 5.225400e+01 2.704099e+01 5 4 20547 6 4 0 1000 501 2.408918e+01 2.836265e+01 4.273464e+00 1.774018e-01 5.556600e+01 2.701292e+01 9 7 22070 10 7 2 1100 481 2.470056e+01 2.836265e+01 3.662087e+00 1.482593e-01 5.881100e+01 2.688273e+01 5 4 23397 6 6 4 1139 472 2.493861e+01 2.836265e+01 3.424037e+00 1.372986e-01 6.000200e+01 2.684911e+01 10 7 23923 14 5 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 24.93860840346271 Dual Gap (relative): 0.13729862414724117 Search Statistics. Total number of nodes processed: 1611 Total number of lmo calls: 23923 Total time (s): 60.003 LMO calls / sec: 398.6967318300752 Nodes / sec: 26.848657567121645 LMO calls / node: 14.849782743637492 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2190 Local tightenings / node: 1.92 Total number of potential local tightenings: 5520 Number of alternative decisions: 510 Number of stable decisions: 295 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 4.640000e-01 6.465517e+00 416 71 60 3859 2 1 * 10 11 3.566798e-02 3.102006e+01 3.098440e+01 8.686894e+02 4.141000e+00 5.071239e+00 165 62 387 858 21 16 * 42 43 4.117898e+00 2.929131e+01 2.517341e+01 6.113170e+00 7.061000e+00 1.203795e+01 66 36 1246 239 1 3 100 99 7.803204e+00 2.929131e+01 2.148810e+01 2.753754e+00 1.162200e+01 1.712270e+01 23 15 2713 74 5 3 200 191 1.087295e+01 2.929131e+01 1.841836e+01 1.693961e+00 1.889900e+01 2.068893e+01 109 48 5180 541 1 2 * 277 262 1.218791e+01 2.836265e+01 1.617474e+01 1.327113e+00 2.474700e+01 2.194205e+01 29 16 7113 113 1 0 300 285 1.307679e+01 2.836265e+01 1.528586e+01 1.168931e+00 2.670100e+01 2.205910e+01 75 41 7720 238 4 4 400 365 1.571596e+01 2.836265e+01 1.264668e+01 8.047032e-01 3.449500e+01 2.229309e+01 78 46 10084 220 16 15 500 435 1.787626e+01 2.836265e+01 1.048638e+01 5.866095e-01 4.168300e+01 2.252717e+01 54 31 12358 170 6 5 600 475 1.938601e+01 2.836265e+01 8.976640e+00 4.630474e-01 4.742900e+01 2.274979e+01 95 42 14398 492 21 10 700 503 2.029854e+01 2.836265e+01 8.064109e+00 3.972754e-01 5.283900e+01 2.284298e+01 33 21 16275 68 4 3 800 537 2.138349e+01 2.836265e+01 6.979159e+00 3.263808e-01 5.821500e+01 2.303530e+01 35 22 18191 70 10 7 833 552 2.180108e+01 2.836265e+01 6.561565e+00 3.009743e-01 6.000200e+01 2.314923e+01 29 18 18865 64 8 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 21.80107965329792 Dual Gap (relative): 0.30097433138429264 Search Statistics. Total number of nodes processed: 1389 Total number of lmo calls: 18865 Total time (s): 60.003 LMO calls / sec: 314.4009466193357 Nodes / sec: 23.148842557872108 LMO calls / node: 13.581713462922966 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1212 Local tightenings / node: 1.45 Total number of potential local tightenings: 3358 Number of alternative decisions: 226 Number of stable decisions: 468 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 4.550000e-01 6.593407e+00 448 75 60 3859 32 3 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 9.150000e-01 9.836066e+00 151 48 185 1051 17 16 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 1.294000e+00 1.004637e+01 178 45 263 958 17 25 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.878000e+00 1.224707e+01 118 48 443 685 14 7 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 4.601000e+00 1.630080e+01 78 36 1297 379 7 11 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 1.082200e+01 1.857328e+01 90 38 3291 470 7 3 200 201 1.669741e+01 2.836265e+01 1.166524e+01 6.986258e-01 1.949600e+01 2.056832e+01 116 41 6128 257 9 7 300 297 1.877956e+01 2.836265e+01 9.583087e+00 5.102935e-01 2.704300e+01 2.207595e+01 59 28 8830 262 6 4 400 393 2.048363e+01 2.836265e+01 7.879012e+00 3.846492e-01 3.491700e+01 2.271100e+01 73 37 11546 271 3 7 500 467 2.164530e+01 2.836265e+01 6.717344e+00 3.103373e-01 4.167400e+01 2.320392e+01 35 20 13972 124 10 17 600 539 2.275196e+01 2.836265e+01 5.610686e+00 2.466023e-01 4.831400e+01 2.357495e+01 58 30 16438 226 12 9 700 573 2.371222e+01 2.836265e+01 4.650425e+00 1.961193e-01 5.343400e+01 2.382378e+01 13 9 18499 21 9 12 800 569 2.442888e+01 2.836265e+01 3.933764e+00 1.610292e-01 5.814500e+01 2.354459e+01 9 6 20364 18 6 14 852 559 2.501384e+01 2.836265e+01 3.348809e+00 1.338782e-01 6.000400e+01 2.351510e+01 3 2 21224 1 3 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 25.013836401245385 Dual Gap (relative): 0.133878249239403 Search Statistics. Total number of nodes processed: 1411 Total number of lmo calls: 21224 Total time (s): 60.005 LMO calls / sec: 353.7038580118323 Nodes / sec: 23.51470710774102 LMO calls / node: 15.041814316087882 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1905 Local tightenings / node: 2.24 Total number of potential local tightenings: 4534 Number of alternative decisions: 676 Number of stable decisions: 29 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 4.080000e-01 7.352941e+00 402 67 60 3859 32 3 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 9.210000e-01 9.771987e+00 135 40 185 1051 17 16 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 1.202000e+00 1.081531e+01 125 38 263 958 17 25 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 1.758000e+00 1.308305e+01 108 41 443 685 14 7 * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 4.388000e+00 1.709207e+01 80 38 1297 379 7 11 100 101 1.300645e+01 2.836265e+01 1.535619e+01 1.180660e+00 1.103300e+01 1.821807e+01 105 50 3291 470 7 3 200 201 1.669741e+01 2.836265e+01 1.166524e+01 6.986258e-01 2.089900e+01 1.918752e+01 88 52 6128 257 9 7 300 297 1.877956e+01 2.836265e+01 9.583087e+00 5.102935e-01 2.944500e+01 2.027509e+01 65 33 8830 262 6 4 400 393 2.048363e+01 2.836265e+01 7.879012e+00 3.846492e-01 3.778300e+01 2.098828e+01 73 38 11546 271 3 7 500 467 2.164530e+01 2.836265e+01 6.717344e+00 3.103373e-01 4.507100e+01 2.145504e+01 41 24 13972 124 10 17 600 539 2.275196e+01 2.836265e+01 5.610686e+00 2.466023e-01 5.161100e+01 2.206894e+01 49 26 16438 226 12 9 700 573 2.371222e+01 2.836265e+01 4.650425e+00 1.961193e-01 5.697200e+01 2.234431e+01 14 9 18499 21 9 12 762 573 2.410176e+01 2.836265e+01 4.260886e+00 1.767874e-01 6.000200e+01 2.224926e+01 8 6 19631 9 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404966 Dual Bound: 24.10175869120978 Dual Gap (relative): 0.1767873618180894 Search Statistics. Total number of nodes processed: 1335 Total number of lmo calls: 19631 Total time (s): 60.003 LMO calls / sec: 327.1669749845841 Nodes / sec: 22.24888755562222 LMO calls / node: 14.704868913857679 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1720 Local tightenings / node: 2.26 Total number of potential local tightenings: 4314 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ====================================================================================== 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 14 running 1 of 1 signal (10): User defined signal 1 _ZN4llvm12DenseMapBaseINS_8DenseMapINS_7GVNPass10ExpressionEjNS_12DenseMapInfoIS3_vEENS_6detail12DenseMapPairIS3_jEEEES3_jS5_S8_E15LookupBucketForIS3_EEbRKT_RPS8_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass10ValueTable20assignExpNewValueNumERNS0_10ExpressionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass17propagateEqualityEPNS_5ValueES2_RKNS_14BasicBlockEdgeEb at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass18processInstructionEPNS_11InstructionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass12processBlockEPNS_10BasicBlockE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass17iterateOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass7runImplERNS_8FunctionERNS_15AssumptionCacheERNS_13DominatorTreeERKNS_17TargetLibraryInfoERNS_9AAResultsEPNS_23MemoryDependenceResultsERNS_8LoopInfoEPNS_25OptimizationRemarkEmitterEPNS_9MemorySSAE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm7GVNPass3runERNS_8FunctionERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_8FunctionENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm27ModuleToFunctionPassAdaptor3runERNS_6ModuleERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/src/pipeline.cpp:787 operator() at /source/src/jitlayers.cpp:1516 withModuleDo<(anonymous namespace)::sizedOptimizerT::operator()(llvm::orc::ThreadSafeModule) [with long unsigned int N = 4]:: > at /source/usr/include/llvm/ExecutionEngine/Orc/ThreadSafeModule.h:136 [inlined] operator() at /source/src/jitlayers.cpp:1477 [inlined] operator() at /source/src/jitlayers.cpp:1652 [inlined] addModule at /source/src/jitlayers.cpp:2110 jl_compile_codeinst_now at /source/src/jitlayers.cpp:685 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:879 jl_compile_method_internal at /source/src/gf.c:3648 _jl_invoke at /source/src/gf.c:4108 [inlined] ijl_apply_generic at /source/src/gf.c:4313 print at ./strings/io.jl:46 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 println at ./coreio.jl:6 unknown function (ip: 0x7fbc5379a826) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/interface.jl:63 unknown function (ip: 0x7fbc5372bda9) 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/gDHaL/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7fbc5372575c) 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 ["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 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_65787.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_65787.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_62300.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: 0x7fbc8ffc2249) 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) #= 75.7 ms =# precompile(Tuple{typeof(Core.kwcall), NamedTuple{(:traverse_strategy, :Node, :Value, :Solution, :root, :branch_strategy, :dual_gap_limit, :abs_gap_limit), Tuple{Bonobo.BestFirstSearch, typeof(DataType), typeof(DataType), UnionAll, NamedTuple{(:problem, :current_node_id, :updated_incumbent, :global_tightening_rhs, :global_tightening_root_info, :global_tightenings, :options, :result), Tuple{Boscia.SimpleOptimizationProblem{Main.var"#f#build_examples##0"{Array{Float64, 1}}, Main.var"#grad!#build_examples##1"{Array{Float64, 1}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, Dates.DateTime}, Boscia.IntegerBounds}, Base.RefValue{Int64}, Base.RefValue{Bool}, Base.RefValue{Float64}, NamedTuple{(:lower_bounds, :upper_bounds), Tuple{Base.Dict{Int64, Tuple{Float64, Float64}}, Base.Dict{Int64, Tuple{Float64, Float64}}}}, Boscia.IntegerBounds, Base.Dict{Symbol, Any}, Base.Dict{Symbol, Any}}}, Boscia.Hierarchy, Float64, Float64}}, typeof(Bonobo.initialize)}) ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== * 1 2 -9.038715e-03 3.396650e+01 3.397554e+01 Inf 2.336000e+00 1.284247e+00 564 140 60 3859 32 3 * 4 5 4.053215e-01 3.102006e+01 3.061474e+01 7.553199e+01 3.000000e+00 3.000000e+00 314 60 185 1051 17 16 * 6 7 8.985124e-01 2.977156e+01 2.887305e+01 3.213428e+01 5.675000e+00 2.290749e+00 153 52 263 958 17 25 * 11 12 3.828182e+00 2.929131e+01 2.546313e+01 6.651494e+00 6.547000e+00 3.513059e+00 157 67 443 685 14 7 ====================================================================================== 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_52783.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 0x00007fbc75ffc010 Total snapshots: 65. Utilization: 100% ╎58 @Base/client.jl:577 _start() ╎ 58 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 58 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 58 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 58 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::Str… ╎ 58 @Base/loading.jl:3184 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 58 @Base/loading.jl:3124 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 58 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 58 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 58 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 58 @Base/loading.jl:3184 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 58 @Base/loading.jl:3124 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 58 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 58 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 58 @Boscia/…oracle.jl:834 #solve#145 ╎ ╎ ╎ 58 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Nam… 7╎ ╎ ╎ ╎ 8 @Boscia/…erface.jl:158 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 1 @Boscia/…erface.jl:231 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 1 @Boscia/…backs.jl:230 build_bnb_callback(tree::BnBTree{… ╎ ╎ ╎ ╎ 1 @FrankWolfe/…k.jl:22 print_callback ╎ ╎ ╎ ╎ 1 @FrankWolfe/…k.jl:37 print_callback(data::Vector{Stri… ╎ ╎ ╎ ╎ 1 @FrankWolfe/….jl:23 (::FrankWolfe.var"#print_formatt… ╎ ╎ ╎ ╎ ╎ 1 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ ╎ ╎ 1 @Base/…ontend.jl:24 fl_lower(ex::Expr, mod::Module… ╎ ╎ ╎ ╎ ╎ 1 @Printf/…tf.jl:1011 var"@printf"(__source__::Line… ╎ ╎ ╎ ╎ ╎ 1 @Printf/…tf.jl:274 Printf.Format(f::String) ╎ ╎ ╎ ╎ ╎ 1 @Base/tuple.jl:450 Tuple 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/tuple.jl:487 _totuple ╎ ╎ ╎ ╎ 49 @Boscia/…erface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 49 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 49 @Boscia/…onobo.jl:35 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 49 @Boscia/…node.jl:353 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 49 @Boscia/…ants.jl:138 kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ ╎ 49 @Boscia/…ants.jl:158 #solve_frank_wolfe#6 ╎ ╎ ╎ ╎ ╎ 49 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:76 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:54 simd_index 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:87 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:355 active_set_argminmax ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:361 active_set_argminmax(active_… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:214 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:52 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:72 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:75 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:80 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:706 gemv!(y::Vector{Float6… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:732 cconvert ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:113 convert 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ue.jl:8 RefValue 2╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…jl:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 20 @FrankWolfe/…jl:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 20 @Boscia/…cks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 20 @Boscia/…ks.jl:59 process_FW_callback_logic 1╎ ╎ ╎ ╎ ╎ ╎ 20 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 19 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 14 @Boscia/…e.jl:612 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect(itr::Base.Generato… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #find_best_solution##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ts.jl:92 get(o::SCIP.Optimizer, a… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…ay.jl:838 collect(itr::Base.Generato… ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…ay.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 none:? #find_best_solution##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ts.jl:89 get(o::SCIP.Optimizer,… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ts.jl:63 assert_solved ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ts.jl:53 assert_stage 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:10588 SCIPgetStage ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…ts.jl:91 get(o::SCIP.Optimizer,… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…er.jl:111 unsafe_wrap 5╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…er.jl:113 #unsafe_wrap#61 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18296 SCIPgetSols ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…ts.jl:92 get(o::SCIP.Optimizer,… 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:244 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:130 hashindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:86 - ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:614 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:38 - ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:13 _broadcast_preserving_zer… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3544 map ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:890 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1020 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1025 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…t.jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1045 dot(x::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:0 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:76 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:54 simd_index 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:87 + ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1046 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 22 @FrankWolfe/…jl:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 22 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 22 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 22 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:32 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…ive.jl:58 modify(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…er.jl:201 allow_modification ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…er.jl:16 macro expansion 6╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ ╎ 16 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 16 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 16 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 16 @SCIP/…er.jl:16 macro expansion 16╎ ╎ ╎ ╎ ╎ ╎ ╎ 16 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:612 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect(itr::Base.Generato… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #find_best_solution##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ts.jl:91 get(o::SCIP.Optimizer,… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:111 unsafe_wrap 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:113 #unsafe_wrap#61 ┌ 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 0x00007799aed64790 Total snapshots: 323. Utilization: 0% ╎323 @Base/task.jl:1168 wait_forever() 322╎ 323 @Base/task.jl:1246 wait() * 37 38 8.271834e+00 2.836265e+01 2.009081e+01 2.428822e+00 1.514500e+01 4.952129e+00 88 42 1297 379 7 11 [14] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/gDHaL/test/branching_strategy_test.jl:275 + at ./float.jl:492 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1046 [inlined] macro expansion at ./simdloop.jl:77 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1045 unknown function (ip: 0x7fbc57906641) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 f at /home/pkgeval/.julia/packages/Boscia/gDHaL/test/branching_strategy_test.jl:45 find_best_solution at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:614 unknown function (ip: 0x7fbc53766022) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 find_best_solution at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x7fbc5376594d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #process_FW_callback_logic#36 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/callbacks.jl:59 [inlined] #32 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/callbacks.jl:24 unknown function (ip: 0x7fbc5376d382) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/blended_pairwise.jl:261 unknown function (ip: 0x7fbc5375b215) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/blended_pairwise.jl:76 #solve_frank_wolfe#6 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/frank_wolfe_variants.jl:158 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/frank_wolfe_variants.jl:138 unknown function (ip: 0x7fbc53748917) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/node.jl:353 #optimize!#12 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/custom_bonobo.jl:35 optimize! at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/custom_bonobo.jl:29 unknown function (ip: 0x7fbc53734e1a) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/interface.jl:270 unknown function (ip: 0x7fbc5372bda9) 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/gDHaL/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7fbc5372575c) 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_65787.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_65787.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_62300.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: 0x7fbc8ffc2249) 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) Allocations: 6118640253 (Pool: 6118636169; Big: 4084); GC: 2559 [scip_solve.c:3399] ERROR: invalid SCIP stage <12> [scip_prob.c:706] ERROR: Error <-8> in function call [scip_general.c:359] ERROR: Error <-8> in function call error in running finalizer: ErrorException("SCIPfree(scipd.scip) yielded SCIP code SCIP_INVALIDCALL") error at ./error.jl:44 macro expansion at /home/pkgeval/.julia/packages/SCIP/4grSV/src/wrapper.jl:19 [inlined] free_scip at /home/pkgeval/.julia/packages/SCIP/4grSV/src/scip_data.jl:107 unknown function (ip: 0x7fbc8e79f8a2) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 run_finalizer at /source/src/gc-common.c:180 jl_gc_run_finalizers_in_list at /source/src/gc-common.c:270 run_finalizers at /source/src/gc-common.c:316 ijl_atexit_hook at /source/src/init.c:296 jl_exit_thread0_cb at /source/src/signals-unix.c:678 jl_fake_signal_return at /opt/julia/bin/../lib/julia/libjulia-internal.so.1.14 (unknown line) _ZNSt23_Sp_counted_ptr_inplaceIN6soplex10TolerancesESaIvELN9__gnu_cxx12_Lock_policyE2EED2Ev at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) _ZNSt16_Sp_counted_baseILN9__gnu_cxx12_Lock_policyE2EE10_M_releaseEv at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdED1Ev at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPlpiFree at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPlpFree at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/packages/SCIP/4grSV/src/LibSCIP.jl:18686 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/4grSV/src/wrapper.jl:16 [inlined] allow_modification at /home/pkgeval/.julia/packages/SCIP/4grSV/src/MOI_wrapper.jl:201 [inlined] modify at /home/pkgeval/.julia/packages/SCIP/4grSV/src/MOI_wrapper/objective.jl:58 #compute_extreme_point#109 at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/moi_oracle.jl:32 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/moi_oracle.jl:24 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/blended_pairwise.jl:291 unknown function (ip: 0x7fbc5375b215) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/blended_pairwise.jl:76 #solve_frank_wolfe#6 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/frank_wolfe_variants.jl:158 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/frank_wolfe_variants.jl:138 unknown function (ip: 0x7fbc53748917) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/node.jl:353 #optimize!#12 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/custom_bonobo.jl:35 optimize! at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/custom_bonobo.jl:29 unknown function (ip: 0x7fbc53734e1a) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/interface.jl:270 unknown function (ip: 0x7fbc5372bda9) 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/gDHaL/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7fbc5372575c) 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_65787.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 PkgEval terminated after 2723.77s: test duration exceeded the time limit