Package evaluation to test Boscia on Julia 1.14.0-DEV.1893 (b4aba01002*) started at 2026-03-15T19:21:00.731 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.46s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.10 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.5 [36b166db] + Boscia v0.2.10 [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.16.0 [f6369f11] + ForwardDiff v1.3.2 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.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.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.1 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.3 [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 [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.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [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.99s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2266.1 ms ✓ Bonobo 2142.2 ms ✓ MUMPS_seq_jll 1508.8 ms ✓ LEMON_jll 2150.8 ms ✓ bliss_jll 2026.7 ms ✓ SPRAL_jll 33252.9 ms ✓ FrankWolfe ERROR: LoadError: UndefVarError: `get_liblemoncxxwrap_path` not defined in `LEMON_jll` Suggestion: check for spelling errors or missing imports. Stacktrace:  [1] getproperty(x::Module, f::Symbol)  @ Base ./Base_compiler.jl:51  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [4] 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:3289  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3131  [8] include_string  @ ./loading.jl:3141 [inlined]  [9] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [10] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 in expression starting at stdin:5 ✗ LEMONGraphs 2376.2 ms ✓ Ipopt_jll 13639.2 ms ✓ Boscia ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14b1564f-c77f-4800-9e89-efd961faef7c"), "LEMONGraphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2841  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2695  [4] macro expansion  @ ./loading.jl:2622 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2586  [7] require  @ ./loading.jl:2562 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] _eval_import(imported::Bool, to::Module, from::Nothing, paths::Expr)  @ Base ./module.jl:111  [10] top-level scope  @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10  [11] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [12] 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:3289  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3131  [16] include_string  @ ./loading.jl:3141 [inlined]  [17] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [18] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 in expression starting at stdin:5 ✗ GraphsMatching 6225.9 ms ✓ SCIP_PaPILO_jll 2417.1 ms ✓ SCIP_jll 11287.4 ms ✓ Boscia → BosciaHiGHSExt ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("c3af3a8c-b79e-4b01-bf44-c718d7e0e0d6"), "GraphsMatching") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2841  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2695  [4] macro expansion  @ ./loading.jl:2622 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2586  [7] require  @ ./loading.jl:2562 [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/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:6  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [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:3289  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3131  [18] include_string  @ ./loading.jl:3141 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [20] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 24392.5 ms ✓ SCIP 16723.1 ms ✓ Boscia → BosciaSCIPExt 13 dependencies successfully precompiled in 163 seconds. 163 already precompiled. 26 dependencies precompiled but different versions are currently loaded (ArgTools, Base64, Dates, Downloads, JuliaSyntaxHighlighting, LibCURL, LibCURL_jll, LibGit2, LibGit2_jll, LibSSH2_jll, Logging, Markdown, MozillaCACerts_jll, NetworkOptions, OpenSSL_jll, PCRE2_jll, Pkg, Printf, StyledStrings, TOML, Tar, UUIDs, Zlib_jll, Zstd_jll, nghttp2_jll and p7zip_jll). Restart julia to access the new versions. Otherwise, 98 dependents of these packages may trigger further precompilation to work with the unexpected versions. Precompilation completed after 192.48s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_QMyFl1/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.10 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.6.2 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.22.1 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [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_QMyFl1/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.5 [36b166db] Boscia v0.2.10 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [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.123 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.6.2 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.2 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.22.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.4.0 [4076af6c] JuMP v1.30.0 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.2 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.3 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.6.3 [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.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+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.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+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.9+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.18.0+1 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [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.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x2bf565e1aa0a59a8 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##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/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##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/F2hrt/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 = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##32", var"#grad!#grad!##12", 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/F2hrt/src/callbacks.jl:252 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 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 Callback Tests seed = 0x86bf2e0bc5800d63 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##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/F2hrt/src/callbacks.jl:252 LMO Tests seed = 0x1f1f08eddf6a4f2b ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##38", var"#grad!#grad!##16", 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/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##44", var"#grad!#grad!##18", 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/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##50", 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/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##53", var"#grad!#grad!##21", 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/F2hrt/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xb6ae56419c4bb8f7 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##59", var"#grad!#grad!##23", 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/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##62", var"#grad!#grad!##24", 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/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##65", var"#grad!#grad!##25", 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/F2hrt/src/callbacks.jl:252 Sparse Regression Tests seed = 0x92c6810793804bea 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 3.746893e+00 3.928001e+00 1.811076e-01 4.833541e-02 2.400000e+01 1.250000e-01 9963 41 13 19 7 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##74", var"#grad!#grad!##28", 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/F2hrt/src/callbacks.jl:252 17 8 3.893494e+00 3.928001e+00 3.450725e-02 8.862799e-03 2.815600e+01 8.879102e-01 5 3 94 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.903512e+00 1.991090e-01 9.704403e+00 0.000000e+00 Inf 1 LD 2 3.928001e+00 3.928001e+00 0.000000e+00 2.404670e+00 8.317151e-01 1 Last 2 3.928001e+00 3.928001e+00 0.000000e+00 2.568715e+00 7.785995e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.928001e+00 3.928001e+00 0.000000e+00 2.572019e+00 7.775993e-01 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.9280008360504524 Dual Bound: 3.8934935863041704 Dual Gap (relative): 0.008862798661763647 Search Statistics. Total number of nodes processed: 25 Total number of lmo calls: 99 Total time (s): 33.494 LMO calls / sec: 2.9557532692422526 Nodes / sec: 0.7464023407177405 LMO calls / node: 3.96 Total number of global tightenings: 41 Global tightenings / node: 2.41 Total number of local tightenings: 48 Local tightenings / node: 2.82 Total number of potential local tightenings: 48 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.192057e+00 1.447142e+00 2.550847e-01 2.139869e-01 2.097400e+01 1.430342e-01 9899 107 22 36 12 1 * 3 4 1.212753e+00 1.435501e+00 2.227480e-01 1.836714e-01 2.125400e+01 3.293498e-01 174 46 51 23 9 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##75", var"#grad!#grad!##29", 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/F2hrt/src/callbacks.jl:252 81 16 1.421664e+00 1.435501e+00 1.383718e-02 9.733085e-03 2.404000e+01 4.034942e+00 7 4 535 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.875783e+00 -8.099339e-01 5.685717e+00 0.000000e+00 Inf 1 LD 2 1.435501e+00 1.435501e+00 0.000000e+00 1.610061e-01 1.242189e+01 1 Last 2 1.435501e+00 1.435501e+00 0.000000e+00 3.219576e-01 6.211999e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.435501e+00 1.435501e+00 0.000000e+00 3.257512e-01 6.139655e+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: 1.4355010877260015 Dual Bound: 1.4216639117464842 Dual Gap (relative): 0.009733085200508888 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 540 Total time (s): 27.062 LMO calls / sec: 19.954179291996155 Nodes / sec: 3.584361835784495 LMO calls / node: 5.56701030927835 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 Non zero entries: 3th entry: 0.16120591848515006 47th entry: 0.16120591848515006 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.228642e+00 1.447142e+00 2.185001e-01 1.778387e-01 1.410000e-01 2.127660e+01 134 103 22 36 12 1 * 3 4 1.249767e+00 1.435501e+00 1.857336e-01 1.486145e-01 3.090000e-01 2.265372e+01 62 43 51 23 9 0 52 6 1.422252e+00 1.435501e+00 1.324958e-02 9.315917e-03 2.392000e+00 2.424749e+01 109 79 411 70 25 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.875783e+00 -8.099339e-01 5.685717e+00 0.000000e+00 Inf 1 LD 2 1.435501e+00 1.435501e+00 0.000000e+00 1.013141e-03 1.974059e+03 1 Last 2 1.435501e+00 1.435501e+00 0.000000e+00 7.178283e-03 2.786182e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.435501e+00 1.435501e+00 0.000000e+00 1.049515e-02 1.905642e+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: 1.4355010877260015 Dual Bound: 1.4222515104022766 Dual Gap (relative): 0.009315917210717053 Search Statistics. Total number of nodes processed: 58 Total number of lmo calls: 416 Total time (s): 2.414 LMO calls / sec: 172.32808616404307 Nodes / sec: 24.026512013256006 LMO calls / node: 7.172413793103448 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 Poisson Tests seed = 0xdc87b03f6c15f8bb 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -4.684038e+02 -4.415349e+02 2.686892e+01 6.085345e-02 2.350100e+01 1.276541e-01 12226 117 43 1166 24 6 * 2 3 -4.684038e+02 -4.486433e+02 1.976051e+01 4.404505e-02 2.536900e+01 1.970909e-01 1863 87 75 1169 22 9 * 15 16 -4.662606e+02 -4.518440e+02 1.441655e+01 3.190603e-02 5.136500e+01 6.035238e-01 2145 86 517 1415 26 13 47 48 -4.649587e+02 -4.518440e+02 1.311463e+01 2.902469e-02 1.200050e+02 7.916337e-01 1345 51 1572 848 19 9 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.236953e+02 -7.496490e+02 1.473344e+03 0.000000e+00 Inf 1 LD 2 -4.380530e+02 -5.115998e+02 7.354688e+01 1.624320e-01 1.231284e+01 2 LD 25 -4.494491e+02 -4.708422e+02 2.139315e+01 4.841335e-01 5.163865e+01 2 LD 38 -4.540769e+02 -4.623218e+02 8.244896e+00 5.115894e-01 7.427832e+01 4 LD 73 -4.566242e+02 -4.579486e+02 1.324349e+00 5.726027e-01 1.274880e+02 6 LD 113 -4.569119e+02 -4.572114e+02 2.995042e-01 6.229170e-01 1.814046e+02 5 LD 184 -4.569333e+02 -4.570080e+02 7.466904e-02 7.158324e-01 2.570434e+02 7 LD 220 -4.569336e+02 -4.569557e+02 2.202839e-02 7.629896e-01 2.883394e+02 7 LD 244 -4.569336e+02 -4.569403e+02 6.623684e-03 7.957661e-01 3.066228e+02 7 LD 263 -4.569336e+02 -4.569344e+02 7.332503e-04 8.194422e-01 3.209500e+02 7 LD 317 -4.569336e+02 -4.569338e+02 1.658510e-04 8.755637e-01 3.620525e+02 7 LD 363 -4.569336e+02 -4.569337e+02 2.465317e-05 9.570863e-01 3.792761e+02 7 LD 416 -4.569336e+02 -4.569336e+02 4.812135e-06 9.994609e-01 4.162244e+02 7 LD 484 -4.569336e+02 -4.569336e+02 7.797349e-07 1.053585e+00 4.593841e+02 7 Last 484 -4.569336e+02 -4.569336e+02 7.797349e-07 1.059573e+00 4.567877e+02 7 ---------------------------------------------------------------------------------------------------------------- PP 484 -4.569336e+02 -4.569336e+02 7.797349e-07 1.062549e+00 4.555084e+02 7 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -456.93364499178267 Dual Bound: -464.95866421124106 Dual Gap (relative): 0.017562767170718422 Search Statistics. Total number of nodes processed: 95 Total number of lmo calls: 1597 Total time (s): 123.841 LMO calls / sec: 12.895567703749164 Nodes / sec: 0.7671126686638513 LMO calls / node: 16.810526315789474 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -4.168683e+02 -4.147398e+02 2.128450e+00 5.132014e-03 2.565300e+01 1.169454e-01 10327 105 21 45 7 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.121905e+02 -4.431234e+02 2.309329e+02 0.000000e+00 Inf 1 LD 2 -4.147398e+02 -4.147398e+02 0.000000e+00 1.740948e-01 1.148799e+01 1 Last 2 -4.147398e+02 -4.147398e+02 0.000000e+00 3.558763e-01 5.619930e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -4.147398e+02 -4.147398e+02 0.000000e+00 3.602480e-01 5.551731e+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: -414.7398103656075 Dual Bound: -416.8682606853015 Dual Gap (relative): 0.0051320135335396555 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 26 Total time (s): 28.76 LMO calls / sec: 0.9040333796940194 Nodes / sec: 0.1043115438108484 LMO calls / node: 8.666666666666666 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.189356e+02 3.668798e+02 1.479442e+02 6.757429e-01 2.293600e+01 1.307987e-01 10812 154 31 179 14 0 * 4 5 2.342858e+02 3.455827e+02 1.112968e+02 4.750472e-01 2.402400e+01 3.746254e-01 280 97 91 134 10 2 65 8 3.423977e+02 3.455827e+02 3.184929e+00 9.301839e-03 3.037500e+01 2.403292e+00 8 5 690 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.455827e+02 3.455827e+02 0.000000e+00 9.552360e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.455827e+02 3.455827e+02 0.000000e+00 1.582984e-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: 345.5826642060795 Dual Bound: 342.3977356300744 Dual Gap (relative): 0.009301838898391864 Search Statistics. Total number of nodes processed: 73 Total number of lmo calls: 694 Total time (s): 33.157 LMO calls / sec: 20.930723527460266 Nodes / sec: 2.2016467111017284 LMO calls / node: 9.506849315068493 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.189356e+02 3.668798e+02 1.479442e+02 6.757429e-01 2.299600e+01 1.304575e-01 10252 159 31 179 14 0 * 2 3 2.189356e+02 3.455827e+02 1.266471e+02 5.784672e-01 2.426700e+01 2.060411e-01 281 100 51 132 11 1 59 10 3.423977e+02 3.455827e+02 3.184929e+00 9.301839e-03 4.847300e+01 1.423473e+00 13 9 596 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.455827e+02 3.455827e+02 0.000000e+00 8.637658e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.455827e+02 3.455827e+02 0.000000e+00 1.516362e-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: 345.5826642060795 Dual Bound: 342.3977356300744 Dual Gap (relative): 0.009301838898391864 Search Statistics. Total number of nodes processed: 69 Total number of lmo calls: 600 Total time (s): 51.254 LMO calls / sec: 11.706403402661255 Nodes / sec: 1.3462363913060444 LMO calls / node: 8.695652173913043 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 = 0xd56bd807a1e26b5f 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 -2.698926e+01 3.179397e+01 5.878323e+01 Inf 2.239500e+01 1.339585e-01 11158 186 47 9882 22 9 * 13 14 -1.283096e+01 2.031773e+01 3.314869e+01 Inf 2.543300e+01 1.061613e+00 435 81 399 10001 21 9 100 81 4.303302e+00 2.031773e+01 1.601443e+01 3.721428e+00 4.552000e+01 3.976274e+00 244 48 2767 5354 20 18 163 112 1.036256e+01 2.031773e+01 9.955170e+00 9.606864e-01 6.000300e+01 4.583104e+00 231 62 4496 4900 17 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 20.31773063670073 Dual Bound: 10.362560326363173 Dual Gap (relative): 0.960686355186837 Search Statistics. Total number of nodes processed: 275 Total number of lmo calls: 4496 Total time (s): 61.045 LMO calls / sec: 73.65058563354901 Nodes / sec: 4.504873454009338 LMO calls / node: 16.349090909090908 Total number of global tightenings: 9 Global tightenings / node: 0.06 Total number of local tightenings: 809 Local tightenings / node: 4.96 Total number of potential local tightenings: 1117 Time Limit Test seed = 0x6d764904511baf06 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -5.390314e+00 0.000000e+00 5.390314e+00 Inf 2.145900e+01 1.398015e-01 10840 49 18 342 10 1 * 4 5 -5.351449e+00 -4.719049e+00 6.323999e-01 1.340100e-01 2.213400e+01 4.066143e-01 57 38 82 416 8 20 * 8 9 -5.271508e+00 -4.833557e+00 4.379506e-01 9.060628e-02 2.312700e+01 7.350716e-01 56 33 179 768 7 28 * 9 10 -5.263805e+00 -4.980435e+00 2.833702e-01 5.689668e-02 2.321300e+01 8.185069e-01 83 56 206 682 8 11 * 10 11 -5.263805e+00 -4.984362e+00 2.794431e-01 5.606397e-02 2.342100e+01 8.966312e-01 205 128 227 2808 7 18 65 28 -5.033190e+00 -4.984362e+00 4.882733e-02 9.796103e-03 2.881800e+01 3.227150e+00 25 19 1069 28 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -4.984362292381365 Dual Bound: -5.033189619679463 Dual Gap (relative): 0.009796103179082923 Search Statistics. Total number of nodes processed: 93 Total number of lmo calls: 1069 Total time (s): 29.968 LMO calls / sec: 35.671382808328886 Nodes / sec: 3.103310197544047 LMO calls / node: 11.494623655913978 Total number of global tightenings: 5 Global tightenings / node: 0.08 Total number of local tightenings: 147 Local tightenings / node: 2.26 Total number of potential local tightenings: 192 Strong Convexity and Sharpness Tests seed = 0xdb4f70898b139659 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.906765e+02 1.907083e+02 3.184978e-02 1.670357e-04 1.878400e+01 1.597104e-01 7602 0 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 190.7083211848555 Dual Bound: 190.67647140269435 Dual Gap (relative): 0.0001670357224824112 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 19.982 LMO calls / sec: 0.300270243218897 Nodes / sec: 0.1501351216094485 LMO calls / node: 2.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.947780e+02 1.949097e+02 1.317766e-01 6.765477e-04 2.048100e+01 1.464772e-01 9748 0 11 16 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 194.90974694846696 Dual Bound: 194.777970360519 Dual Gap (relative): 0.0006765477004615034 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 21.7 LMO calls / sec: 0.5069124423963134 Nodes / sec: 0.1382488479262673 LMO calls / node: 3.6666666666666665 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: 16 Branching Strategy Tests seed = 0xe1b39f20f3310ddc 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 2.089300e+01 1.435888e-01 10491 45 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.225900e+01 2.920167e+00 8 5 953 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 23.293 LMO calls / sec: 40.91357918688018 Nodes / sec: 2.79053792985017 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 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.975192e-03 7.382204e+00 7.391179e+00 Inf 3.520000e-01 8.522727e+00 220 41 48 3749 24 11 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.822000e+00 4.774973e+01 3 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.823 LMO calls / sec: 556.7745474492594 Nodes / sec: 47.723532638507955 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 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.975192e-03 7.382204e+00 7.391179e+00 Inf 3.700000e-01 8.108108e+00 228 43 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.608000e+00 3.669154e+01 3 2 859 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.61 LMO calls / sec: 533.5403726708074 Nodes / sec: 36.64596273291925 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 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.975192e-03 7.382204e+00 7.391179e+00 Inf 3.730000e-01 8.042895e+00 223 43 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.518000e+00 4.940711e+01 7 5 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.519 LMO calls / sec: 593.8117182356814 Nodes / sec: 49.37458854509546 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 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.975192e-03 7.382204e+00 7.391179e+00 Inf 3.020000e-01 9.933775e+00 208 34 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.862000e+00 5.209452e+01 3 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 1.863 LMO calls / sec: 630.1663982823403 Nodes / sec: 52.06655931293613 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 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.641193e-03 3.396650e+01 3.397614e+01 Inf 4.810000e-01 6.237006e+00 477 59 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.910000e-01 1.137800e+01 98 40 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.200000e-01 1.195652e+01 126 40 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.296000e+00 2.422854e+01 85 31 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.881000e+00 2.443419e+01 61 22 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.444600e+01 2.775855e+01 49 22 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.045600e+01 2.918459e+01 50 18 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.603600e+01 3.045783e+01 51 22 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.096100e+01 3.123284e+01 19 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.633400e+01 3.134805e+01 68 25 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.062300e+01 3.133693e+01 13 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.412800e+01 3.102339e+01 7 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.661000e+01 3.057284e+01 7 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.867500e+01 3.022085e+01 27 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.047800e+01 2.961686e+01 7 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.182100e+01 2.915806e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.317000e+01 2.853113e+01 13 8 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.420600e+01 2.809652e+01 10 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.474100e+01 2.782193e+01 6 3 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 54.742 LMO calls / sec: 502.8131964487962 Nodes / sec: 27.82141682802967 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 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.641193e-03 3.396650e+01 3.397614e+01 Inf 2.103000e+00 1.426534e+00 456 66 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.417000e+00 3.723624e+00 87 34 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.545000e+00 4.322200e+00 125 40 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.031000e+01 1.949564e+01 86 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.087900e+01 1.994669e+01 60 22 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.725200e+01 2.301182e+01 86 26 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.216600e+01 2.530903e+01 46 21 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.660700e+01 2.679746e+01 23 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.037500e+01 2.795062e+01 45 20 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.402100e+01 2.901149e+01 23 13 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.722700e+01 2.968276e+01 9 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.055900e+01 3.010429e+01 7 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.345300e+01 3.026258e+01 9 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.606300e+01 3.045829e+01 12 7 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.800400e+01 3.043496e+01 10 6 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.982300e+01 3.048793e+01 7 4 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.118300e+01 3.081101e+01 9 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.259700e+01 3.081925e+01 12 7 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.383200e+01 3.081810e+01 11 6 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.488200e+01 3.059291e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.502500e+01 3.051340e+01 14 8 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 55.026 LMO calls / sec: 485.9520953730963 Nodes / sec: 30.51284847163159 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 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.641193e-03 3.396650e+01 3.397614e+01 Inf 5.270000e-01 5.692600e+00 460 63 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.251000e+00 1.039169e+01 98 33 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 7.467000e+00 1.727601e+01 61 25 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 1.029300e+01 1.952783e+01 74 31 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.692400e+01 2.369416e+01 80 35 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.275600e+01 2.614695e+01 52 28 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.768900e+01 2.762830e+01 18 11 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.243700e+01 2.870179e+01 74 34 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.697000e+01 2.923992e+01 54 21 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.095000e+01 2.952381e+01 62 31 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.477400e+01 2.981641e+01 7 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.784600e+01 3.020106e+01 52 24 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.088000e+01 3.024764e+01 36 18 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.350100e+01 3.041065e+01 7 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.562200e+01 3.032973e+01 12 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.775200e+01 3.031930e+01 33 15 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.949400e+01 3.017111e+01 8 5 27751 16 0 0 1433 374 2.636038e+01 2.836265e+01 2.002265e+00 7.595735e-02 6.000200e+01 3.011566e+01 16 9 28088 45 11 9 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.360380360251305 Dual Gap (relative): 0.07595735106208394 Search Statistics. Total number of nodes processed: 1807 Total number of lmo calls: 28088 Total time (s): 60.003 LMO calls / sec: 468.1099278369415 Nodes / sec: 30.115160908621235 LMO calls / node: 15.543995572772552 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2465 Local tightenings / node: 1.72 Total number of potential local tightenings: 5899 Number of alternative decisions: 543 Number of stable decisions: 360 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.641193e-03 3.396650e+01 3.397614e+01 Inf 5.330000e-01 5.628518e+00 469 68 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.543000e+00 1.612269e+01 85 35 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.254000e+00 1.936079e+01 65 31 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.716000e+00 2.604977e+01 15 7 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.234200e+01 3.103225e+01 33 15 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.673700e+01 3.387704e+01 24 13 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.094400e+01 3.509358e+01 28 13 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.567400e+01 3.556127e+01 44 21 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.969500e+01 3.606668e+01 33 17 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.362800e+01 3.636850e+01 20 11 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.671100e+01 3.685544e+01 66 47 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.016700e+01 3.667189e+01 15 9 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.347100e+01 3.673714e+01 60 23 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.609900e+01 3.676869e+01 11 7 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.840900e+01 3.654279e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.043700e+01 3.626306e+01 15 10 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.214800e+01 3.576360e+01 7 4 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.367500e+01 3.526782e+01 10 6 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.496700e+01 3.469354e+01 18 10 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.619400e+01 3.418514e+01 7 4 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.728300e+01 3.367491e+01 7 4 29805 14 0 0 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.792800e+01 3.333448e+01 6 3 30260 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 57.929 LMO calls / sec: 522.3635830067841 Nodes / sec: 33.333908750366824 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 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.641193e-03 3.396650e+01 3.397614e+01 Inf 4.970000e-01 6.036217e+00 493 88 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.080000e-01 1.113861e+01 87 35 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.380000e-01 1.172708e+01 128 42 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.488000e+00 2.368049e+01 92 36 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.036000e+00 2.401505e+01 58 21 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.482100e+01 2.705620e+01 49 21 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.098800e+01 2.844483e+01 53 21 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.700500e+01 2.936493e+01 56 23 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.208100e+01 3.014245e+01 20 11 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.652700e+01 3.118241e+01 39 15 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.931900e+01 3.237620e+01 9 5 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.162200e+01 3.289126e+01 5 3 20396 14 0 0 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.338300e+01 3.289307e+01 39 16 21910 381 13 9 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.483700e+01 3.280773e+01 9 6 23162 19 0 0 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 4.622700e+01 3.242694e+01 36 18 24363 145 16 10 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 4.773400e+01 3.173838e+01 10 6 25359 25 0 0 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 4.908600e+01 3.110867e+01 36 17 26283 172 13 8 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.025900e+01 3.050200e+01 13 7 27090 27 0 0 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.099000e+01 3.010394e+01 6 4 27580 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27580 Total time (s): 50.991 LMO calls / sec: 540.8797630954482 Nodes / sec: 30.103351571846012 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 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.641193e-03 3.396650e+01 3.397614e+01 Inf 4.640000e-01 6.465517e+00 460 68 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.810000e-01 1.152369e+01 92 37 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.130000e-01 1.204819e+01 129 42 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.568000e+00 2.655920e+01 89 35 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.152000e+00 2.661923e+01 63 23 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.405500e+01 2.853077e+01 52 24 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.025200e+01 2.947857e+01 62 22 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.563400e+01 3.093548e+01 57 26 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.051000e+01 3.169453e+01 12 7 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.530200e+01 3.226446e+01 63 26 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.953800e+01 3.219687e+01 13 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.296000e+01 3.186685e+01 7 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.565100e+01 3.121509e+01 9 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.779300e+01 3.077857e+01 28 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.967200e+01 3.009744e+01 8 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.110900e+01 2.956426e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.248400e+01 2.890405e+01 17 9 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.364400e+01 2.839087e+01 10 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.419300e+01 2.810326e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 54.194 LMO calls / sec: 507.8975532346754 Nodes / sec: 28.102742000959516 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 3.224000e+00 9.305211e-01 356 50 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.543000e+00 2.540220e+00 92 38 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.682000e+00 2.987507e+00 137 46 217 944 28 30 ====================================================================================== 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 66 running 1 of 1 signal (10): User defined signal 1 + at ./float.jl:492 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1049 [inlined] macro expansion at ./simdloop.jl:77 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1048 unknown function (ip: 0x7bd5e8558151) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 f at /home/pkgeval/.julia/packages/Boscia/F2hrt/test/branching_strategy_test.jl:45 find_best_solution at /home/pkgeval/.julia/packages/Boscia/F2hrt/ext/BosciaSCIPExt.jl:30 unknown function (ip: 0x7bd5e824a3e2) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 find_best_solution at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x7bd5e824963d) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:59 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:24 unknown function (ip: 0x7bd5e8252782) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:261 unknown function (ip: 0x7bd5e823cd55) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x7bd5e82297d7) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:29 unknown function (ip: 0x7bd5e8204efa) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #solve#109 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:270 unknown function (ip: 0x7bd5e82021d9) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7bd5e81faa0c) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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:693 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 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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:693 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 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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: 0x7bd660a7b249) 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) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.177700e+01 1.706716e+01 54 21 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.214700e+01 1.786449e+01 42 15 3485 420 20 24 ====================================================================================== 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_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] start_task at /source/src/task.c:1275 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 0x00007f96c9a9ba30 Total snapshots: 574. Utilization: 0% ╎574 @Base/task.jl:1168 wait_forever() 573╎ 574 @Base/task.jl:1246 wait() 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 2.277800e+01 1.751690e+01 74 28 6090 444 23 10 [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 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_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) Allocations: 18675037 (Pool: 18674355; Big: 682); GC: 16 [66] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/F2hrt/test/branching_strategy_test.jl:275 getindex at ./essentials.jl:1027 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1049 [inlined] macro expansion at ./simdloop.jl:77 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1048 unknown function (ip: 0x7bd5e8558151) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 f at /home/pkgeval/.julia/packages/Boscia/F2hrt/test/branching_strategy_test.jl:45 find_best_solution at /home/pkgeval/.julia/packages/Boscia/F2hrt/ext/BosciaSCIPExt.jl:30 unknown function (ip: 0x7bd5e824a3e2) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 find_best_solution at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x7bd5e824963d) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:59 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:24 unknown function (ip: 0x7bd5e8252782) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:261 unknown function (ip: 0x7bd5e823cd55) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x7bd5e82297d7) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:29 unknown function (ip: 0x7bd5e8204efa) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #solve#109 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:270 unknown function (ip: 0x7bd5e82021d9) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7bd5e81faa0c) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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:693 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 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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:693 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 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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: 0x7bd660a7b249) 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: 4307367817 (Pool: 4307363938; Big: 3879); GC: 1876 PkgEval terminated after 2724.39s: test duration exceeded the time limit