Package evaluation to test Boscia on Julia 1.14.0-DEV.1699 (9484a92029*) started at 2026-02-10T20:51:26.071 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.78s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.5 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.5 [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.3 [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.1 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.16 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.2 [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.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.32s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2115.2 ms ✓ Bonobo 5366.8 ms ✓ StatsBase 3831.6 ms ✓ LogExpFunctions → LogExpFunctionsChainRulesCoreExt 5300.0 ms ✓ SpecialFunctions 1301.5 ms ✓ LEMON_jll 1432.7 ms ✓ PDMats → StatsBaseExt 3384.1 ms ✓ SpecialFunctions → SpecialFunctionsChainRulesCoreExt 2065.1 ms ✓ HypergeometricFunctions 6076.7 ms ✓ DoubleFloats 7417.1 ms ✓ ForwardDiff 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:50  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:309  [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:3288  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [8] include_string  @ ./loading.jl:3140 [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 3512.6 ms ✓ StatsFuns 4241.2 ms ✓ ForwardDiff → ForwardDiffStaticArraysExt 84674.1 ms ✓ MathOptInterface 4882.9 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 12583.7 ms ✓ Distributions 7296.2 ms ✓ MathOptIIS 24914.3 ms ✓ SCIP 67000.6 ms ✓ JuMP 10631.6 ms ✓ MathOptSetDistances 32768.4 ms ✓ FrankWolfe 4545.1 ms ✓ Distributions → DistributionsTestExt 3899.7 ms ✓ Distributions → DistributionsChainRulesCoreExt 31646.8 ms ✓ HiGHS 21166.1 ms ✓ GraphsFlows 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:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [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:309  [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:3288  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [16] include_string  @ ./loading.jl:3140 [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 13822.5 ms ✓ Boscia 11316.0 ms ✓ Boscia → BosciaHiGHSExt 17421.6 ms ✓ Boscia → BosciaSCIPExt 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:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [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/2KdaS/src/CombinatorialLinearOracles.jl:6  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:309  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [18] include_string  @ ./loading.jl:3140 [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/2KdaS/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 27 dependencies successfully precompiled in 442 seconds. 154 already precompiled. Precompilation completed after 465.39s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_s4Cv71/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.5 [336ed68f] CSV v0.10.15 [0002e35e] CombinatorialLinearOracles v0.1.4 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.5.3 [f55ce6ea] FrankWolfe v0.6.3 [86223c79] Graphs v1.13.4 [87dc4568] HiGHS v1.21.0 [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_s4Cv71/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.5 [336ed68f] CSV v0.10.15 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.4 [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.5.3 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.2 [f55ce6ea] FrankWolfe v0.6.3 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.4 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.21.0 [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.29.4 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [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 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.16 [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.2 [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.0+0 [e33a78d0] Hwloc_jll v2.12.2+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.0+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+0 [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.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x22d457f9fa30af59 [ 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/PIUIk/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 LMO Tests seed = 0xe7d867b56a6d894b ┌ 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##34", var"#grad!#grad!##14", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/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##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/PIUIk/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##43", var"#grad!#grad!##17", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/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##46", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xe1882d6f928da1a7 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##52", var"#grad!#grad!##20", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/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##55", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/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##58", var"#grad!#grad!##22", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 [ Info: Polish solution Sparse Regression Tests seed = 0x629ba9d7233d2a6f 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.571171e+00 3.632807e+00 6.163609e-02 1.725935e-02 2.035600e+01 1.473767e-01 8485 29 10 9 5 0 3 4 3.603501e+00 3.632807e+00 2.930622e-02 8.132708e-03 2.382400e+01 2.938214e-01 13 7 22 4 3 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 6.485903e+00 2.633804e+00 3.852099e+00 0.000000e+00 Inf 1 LD 2 3.632807e+00 3.632807e+00 0.000000e+00 2.195865e+00 9.108027e-01 1 Last 2 3.632807e+00 3.632807e+00 0.000000e+00 2.357288e+00 8.484328e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.632807e+00 3.632807e+00 0.000000e+00 2.360877e+00 8.471428e-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.6328073341677776 Dual Bound: 3.6035011101648404 Dual Gap (relative): 0.008132708470734048 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 27 Total time (s): 28.253 LMO calls / sec: 0.9556507273563869 Nodes / sec: 0.2477612996849892 LMO calls / node: 3.857142857142857 Total number of global tightenings: 44 Global tightenings / node: 14.67 Total number of local tightenings: 47 Local tightenings / node: 15.67 Total number of potential local tightenings: 47 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 2.070066e+00 2.829099e+00 7.590327e-01 3.666707e-01 1.788800e+01 1.677102e-01 8653 152 33 74 21 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##68", var"#grad!#grad!##26", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 100 25 2.639505e+00 2.829099e+00 1.895944e-01 7.182953e-02 2.331500e+01 5.361355e+00 18 12 995 20 11 0 200 25 2.754343e+00 2.829099e+00 7.475538e-02 2.714091e-02 2.547300e+01 8.832882e+00 23 15 1457 21 12 1 263 22 2.801655e+00 2.829099e+00 2.744423e-02 9.795721e-03 2.671500e+01 1.066816e+01 6 3 1730 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 8.459096e+00 -1.567333e+00 1.002643e+01 0.000000e+00 Inf 1 LD 2 2.829099e+00 2.829099e+00 0.000000e+00 1.696613e-01 1.178819e+01 1 Last 2 2.829099e+00 2.829099e+00 0.000000e+00 3.316432e-01 6.030577e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.829099e+00 2.829099e+00 0.000000e+00 3.350692e-01 5.968917e+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: 2.8290988724480726 Dual Bound: 2.8016546442811756 Dual Gap (relative): 0.00979572133307614 Search Statistics. Total number of nodes processed: 285 Total number of lmo calls: 1735 Total time (s): 28.99 LMO calls / sec: 59.848223525353575 Nodes / sec: 9.830976198689203 LMO calls / node: 6.087719298245614 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: 19th entry: 0.1645749276914509 31th entry: 0.1645749276914509 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 2.165293e+00 2.829099e+00 6.638062e-01 3.065665e-01 2.000000e-01 1.500000e+01 194 145 33 74 21 1 100 11 2.728861e+00 2.829099e+00 1.002377e-01 3.673245e-02 5.638000e+00 1.968783e+01 25 16 1064 25 15 1 139 10 2.801739e+00 2.829099e+00 2.735998e-02 9.765356e-03 6.972000e+00 2.137120e+01 22 14 1337 22 11 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.459096e+00 -1.567333e+00 1.002643e+01 0.000000e+00 Inf 1 LD 2 2.829099e+00 2.829099e+00 0.000000e+00 1.585825e-03 1.261173e+03 1 Last 2 2.829099e+00 2.829099e+00 0.000000e+00 7.330461e-03 2.728341e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.829099e+00 2.829099e+00 0.000000e+00 1.049341e-02 1.905958e+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: 2.8290988724480726 Dual Bound: 2.801738893890577 Dual Gap (relative): 0.009765356299673858 Search Statistics. Total number of nodes processed: 149 Total number of lmo calls: 1342 Total time (s): 6.994 LMO calls / sec: 191.8787532170432 Nodes / sec: 21.30397483557335 LMO calls / node: 9.006711409395972 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 = 0x96b2cc479f26a1d4 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 -3.627817e+02 -3.377491e+02 2.503262e+01 7.411604e-02 2.154400e+01 1.392499e-01 12623 117 57 3490 36 7 * 2 3 -3.627817e+02 -3.396497e+02 2.313195e+01 6.810531e-02 2.498800e+01 2.000960e-01 3438 85 98 2848 38 14 * 4 5 -3.627729e+02 -3.412269e+02 2.154603e+01 6.314283e-02 2.865000e+01 3.141361e-01 1750 77 176 1384 34 17 * 16 17 -3.621113e+02 -3.448491e+02 1.726218e+01 5.005720e-02 7.018800e+01 4.701658e-01 2738 88 622 2410 30 27 32 33 -3.618719e+02 -3.448491e+02 1.702276e+01 4.936292e-02 1.200030e+02 5.416531e-01 3400 67 1212 3003 28 18 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 5.969072e+02 -6.228578e+02 1.219765e+03 0.000000e+00 Inf 1 LD 2 -3.490783e+02 -3.815338e+02 3.245551e+01 1.381161e-01 1.448058e+01 2 LD 38 -3.545529e+02 -3.675799e+02 1.302702e+01 4.669526e-01 8.137872e+01 3 LD 47 -3.568860e+02 -3.590436e+02 2.157610e+00 4.812005e-01 9.767239e+01 4 LD 99 -3.571842e+02 -3.578020e+02 6.177873e-01 5.362216e-01 1.846252e+02 4 LD 134 -3.571943e+02 -3.574558e+02 2.614334e-01 5.770747e-01 2.322057e+02 5 LD 174 -3.571953e+02 -3.573155e+02 1.201407e-01 6.207129e-01 2.803228e+02 6 LD 208 -3.571956e+02 -3.572439e+02 4.828791e-02 6.566562e-01 3.167563e+02 7 LD 238 -3.571957e+02 -3.572107e+02 1.505917e-02 6.888173e-01 3.455198e+02 8 LD 279 -3.571957e+02 -3.572002e+02 4.572048e-03 7.302213e-01 3.820760e+02 9 LD 312 -3.571957e+02 -3.571978e+02 2.149407e-03 7.635302e-01 4.086282e+02 9 LD 328 -3.571957e+02 -3.571966e+02 9.470739e-04 7.786564e-01 4.212384e+02 9 LD 337 -3.571957e+02 -3.571960e+02 3.254798e-04 7.904883e-01 4.263188e+02 10 LD 363 -3.571957e+02 -3.571958e+02 1.330373e-04 8.123390e-01 4.468578e+02 10 LD 389 -3.571957e+02 -3.571957e+02 4.119092e-05 8.335823e-01 4.666606e+02 10 LD 397 -3.571957e+02 -3.571957e+02 1.354514e-05 8.418481e-01 4.715815e+02 10 LD 426 -3.571957e+02 -3.571957e+02 4.743572e-06 8.707341e-01 4.892423e+02 11 LD 462 -3.571957e+02 -3.571957e+02 2.012498e-06 9.001314e-01 5.132584e+02 11 LD 485 -3.571957e+02 -3.571957e+02 9.219483e-07 9.191580e-01 5.276568e+02 11 Last 485 -3.571957e+02 -3.571957e+02 9.219483e-07 9.240992e-01 5.248354e+02 11 ---------------------------------------------------------------------------------------------------------------- PP 485 -3.571957e+02 -3.571957e+02 9.219483e-07 9.264056e-01 5.235288e+02 11 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -357.19566928123004 Dual Bound: -361.8719095441113 Dual Gap (relative): 0.013091536838313489 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 1245 Total time (s): 122.523 LMO calls / sec: 10.161357459415784 Nodes / sec: 0.5305126384433944 LMO calls / node: 19.153846153846153 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 -3.298989e+02 -3.260016e+02 3.897313e+00 1.195489e-02 2.205900e+01 1.359989e-01 8762 145 29 105 15 1 * 3 4 -3.292184e+02 -3.260358e+02 3.182602e+00 9.761512e-03 2.407700e+01 2.907339e-01 224 77 65 89 14 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.668886e+02 -3.517646e+02 1.848759e+02 0.000000e+00 Inf 1 LD 2 -3.260358e+02 -3.260358e+02 0.000000e+00 1.689072e-01 1.184082e+01 1 Last 2 -3.260358e+02 -3.260358e+02 0.000000e+00 3.400181e-01 5.882041e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.260358e+02 -3.260358e+02 0.000000e+00 3.449278e-01 5.798316e+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: -326.03581306038404 Dual Bound: -329.2184154538544 Dual Gap (relative): 0.00976151166829304 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 70 Total time (s): 26.64 LMO calls / sec: 2.6276276276276276 Nodes / sec: 0.2627627627627628 LMO calls / node: 10.0 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 1.960507e+02 4.448238e+02 2.487731e+02 1.268923e+00 1.856200e+01 1.616205e-01 9112 124 25 80 13 0 * 2 3 1.960507e+02 3.942894e+02 1.982388e+02 1.011161e+00 1.882000e+01 2.656748e-01 253 114 48 92 12 2 * 5 6 2.146636e+02 3.704908e+02 1.558272e+02 7.259134e-01 1.971400e+01 5.579791e-01 254 93 111 114 12 3 * 7 8 2.323736e+02 3.522569e+02 1.198834e+02 5.159079e-01 2.017500e+01 7.434944e-01 223 93 152 78 10 2 * 24 25 2.552473e+02 3.460052e+02 9.075789e+01 3.555685e-01 2.439400e+01 2.008691e+00 185 68 458 76 7 6 * 46 47 2.820000e+02 3.416729e+02 5.967287e+01 2.116059e-01 2.844800e+01 3.269123e+00 143 56 804 55 7 1 100 75 3.114843e+02 3.416729e+02 3.018860e+01 9.691852e-02 3.585900e+01 4.880225e+00 32 19 1449 8 0 0 193 22 3.384816e+02 3.416729e+02 3.191258e+00 9.428156e-03 4.043400e+01 5.317307e+00 54 26 2016 15 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.416729e+02 3.416729e+02 0.000000e+00 9.452461e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.416729e+02 3.416729e+02 0.000000e+00 1.758422e-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: 341.6728945932217 Dual Bound: 338.48163705192036 Dual Gap (relative): 0.009428155598325237 Search Statistics. Total number of nodes processed: 215 Total number of lmo calls: 2020 Total time (s): 42.622 LMO calls / sec: 47.39336492890995 Nodes / sec: 5.044343296888931 LMO calls / node: 9.395348837209303 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 1.960507e+02 4.448238e+02 2.487731e+02 1.268923e+00 1.908800e+01 1.571668e-01 8220 120 25 80 13 0 * 2 3 1.960507e+02 3.416729e+02 1.456222e+02 7.427786e-01 2.043900e+01 2.446304e-01 266 96 45 88 13 2 100 63 3.137985e+02 3.416729e+02 2.787442e+01 8.882905e-02 8.078200e+01 2.017776e+00 52 28 1213 20 3 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##78"{Float64}, var"#grad!#grad!##30"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 199 14 3.384175e+02 3.416729e+02 3.255370e+00 9.619391e-03 9.590500e+01 2.220948e+00 5 3 1720 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.416729e+02 3.416729e+02 0.000000e+00 8.592279e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.416729e+02 3.416729e+02 0.000000e+00 1.592640e-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: 341.6728945932217 Dual Bound: 338.4175242058142 Dual Gap (relative): 0.00961939070692962 Search Statistics. Total number of nodes processed: 213 Total number of lmo calls: 1724 Total time (s): 97.91 LMO calls / sec: 17.608007353692166 Nodes / sec: 2.175467265856399 LMO calls / node: 8.093896713615024 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 = 0xb32963f4b2b390a8 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 -4.298143e+01 -4.185970e+00 3.879546e+01 9.267974e+00 1.992800e+01 1.505420e-01 10010 190 48 6284 21 13 * 2 3 -4.298143e+01 -7.909943e+00 3.507148e+01 4.433848e+00 2.040100e+01 2.450860e-01 470 73 71 8280 23 17 * 6 7 -3.859970e+01 -1.078445e+01 2.781526e+01 2.579201e+00 2.178100e+01 5.968505e-01 151 39 174 3481 22 16 * 10 11 -3.590049e+01 -1.457138e+01 2.132911e+01 1.463767e+00 2.330900e+01 9.009396e-01 404 99 319 8194 18 33 * 21 22 -3.385463e+01 -1.509231e+01 1.876233e+01 1.243171e+00 2.673100e+01 1.608619e+00 236 52 619 4677 17 8 * 22 23 -3.385463e+01 -1.582707e+01 1.802757e+01 1.139034e+00 2.709700e+01 1.660700e+00 362 12 627 10001 19 16 * 53 54 -3.127241e+01 -1.828785e+01 1.298456e+01 7.100101e-01 3.876600e+01 2.760151e+00 111 64 1631 857 15 9 * 54 55 -3.127241e+01 -1.858997e+01 1.268244e+01 6.822193e-01 3.901500e+01 2.793797e+00 247 60 1664 4700 17 44 100 93 -2.946090e+01 -1.858997e+01 1.087093e+01 5.847737e-01 5.469800e+01 3.528465e+00 187 60 3148 3425 19 9 116 109 -2.878692e+01 -1.858997e+01 1.019695e+01 5.485186e-01 6.000400e+01 3.749750e+00 32 18 3674 278 13 36 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -18.589973909873876 Dual Bound: -28.78691956392761 Dual Gap (relative): 0.5485185564804763 Search Statistics. Total number of nodes processed: 225 Total number of lmo calls: 3674 Total time (s): 60.868 LMO calls / sec: 60.36012354603404 Nodes / sec: 3.6965236248932114 LMO calls / node: 16.32888888888889 Total number of global tightenings: 11 Global tightenings / node: 0.09 Total number of local tightenings: 665 Local tightenings / node: 5.73 Total number of potential local tightenings: 1131 Time Limit Test seed = 0xbfa1a367f5f2a622 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 -2.127757e+00 0.000000e+00 2.127757e+00 Inf 1.811400e+01 1.656178e-01 9790 61 30 2673 13 6 * 6 7 -1.695478e+00 -2.076848e-01 1.487794e+00 7.163711e+00 1.837800e+01 7.073675e-01 16 7 97 502 8 4 * 11 12 -1.385653e+00 -3.187449e-01 1.066909e+00 3.347218e+00 1.873100e+01 1.227911e+00 45 26 197 571 8 4 * 16 17 -1.329825e+00 -5.860171e-01 7.438078e-01 1.269260e+00 1.922400e+01 1.716604e+00 35 20 291 388 7 10 * 33 32 -1.041627e+00 -7.487101e-01 2.929170e-01 3.912289e-01 2.052000e+01 3.167641e+00 39 21 617 591 8 5 91 4 -7.519437e-01 -7.487101e-01 3.233608e-03 4.318905e-03 2.200900e+01 4.316416e+00 8 5 1323 54 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -0.7487101058899484 Dual Bound: -0.7519437138768357 Dual Gap (relative): 0.004318905223061893 Search Statistics. Total number of nodes processed: 95 Total number of lmo calls: 1323 Total time (s): 22.732 LMO calls / sec: 58.19989442196023 Nodes / sec: 4.179130740805912 LMO calls / node: 13.926315789473684 Total number of global tightenings: 4 Global tightenings / node: 0.04 Total number of local tightenings: 161 Local tightenings / node: 1.77 Total number of potential local tightenings: 200 Strong Convexity and Sharpness Tests seed = 0xc41638f424f6a76b 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.937074e+02 1.941806e+02 4.732139e-01 2.442932e-03 1.391500e+01 2.155947e-01 5870 1000 13 30 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 194.18058772812662 Dual Bound: 193.70737377943726 Dual Gap (relative): 0.0024429320343178195 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 14.511 LMO calls / sec: 0.8958720970298395 Nodes / sec: 0.20673971469919372 LMO calls / node: 4.333333333333333 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: 15 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 2.032965e+02 2.034755e+02 1.789480e-01 8.802312e-04 1.719400e+01 1.744795e-01 7861 0 11 12 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 203.47549521608153 Dual Bound: 203.29654725715616 Dual Gap (relative): 0.0008802311762777074 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 18.05 LMO calls / sec: 0.6094182825484764 Nodes / sec: 0.16620498614958448 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: 17 Branching Strategy Tests seed = 0x18752ae8fb55d990 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 1.717900e+01 1.746318e-01 8199 49 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.862100e+01 3.490683e+00 9 6 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): 19.468 LMO calls / sec: 48.95212656667351 Nodes / sec: 3.3388124101088965 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.440000e-01 8.720930e+00 222 36 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/PIUIk/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.607000e+00 5.413815e+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.608 LMO calls / sec: 631.2189054726368 Nodes / sec: 54.1044776119403 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.820000e-01 7.853403e+00 250 32 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.385000e+00 4.259928e+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.386 LMO calls / sec: 619.7691197691198 Nodes / sec: 42.56854256854257 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.920000e-01 7.653061e+00 249 31 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.576000e+00 4.758883e+01 11 7 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.577 LMO calls / sec: 571.9720989220039 Nodes / sec: 47.558655675332915 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.460000e-01 8.670520e+00 238 37 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.782000e+00 5.443322e+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.783 LMO calls / sec: 658.4408300616938 Nodes / sec: 54.40269209197981 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.420000e-01 6.787330e+00 438 48 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.420000e-01 1.212938e+01 76 25 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.570000e-01 1.283547e+01 113 29 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.803000e+00 2.575932e+01 78 26 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.307000e+00 2.612255e+01 55 18 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.342000e+01 2.988077e+01 46 17 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.895300e+01 3.149897e+01 55 18 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.414100e+01 3.284868e+01 49 19 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.871700e+01 3.367343e+01 15 8 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.346700e+01 3.403353e+01 56 20 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.723600e+01 3.418735e+01 12 6 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.050000e+01 3.380247e+01 6 3 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.282900e+01 3.327185e+01 7 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.467000e+01 3.293038e+01 27 10 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.631200e+01 3.228105e+01 7 4 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.747000e+01 3.183063e+01 9 5 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.855200e+01 3.124485e+01 12 6 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 4.948700e+01 3.077576e+01 8 5 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 4.996600e+01 3.048073e+01 5 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): 49.967 LMO calls / sec: 550.8635699561711 Nodes / sec: 30.48011687713891 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.150000e+00 1.395349e+00 467 57 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.448000e+00 3.676471e+00 84 30 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.576000e+00 4.270186e+00 125 35 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.652000e+00 2.082470e+01 81 25 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.016500e+01 2.134776e+01 57 18 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.555700e+01 2.551906e+01 82 21 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 1.999900e+01 2.805140e+01 41 15 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.419000e+01 2.947499e+01 21 10 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.761100e+01 3.074861e+01 40 15 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.099700e+01 3.184179e+01 21 11 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.374100e+01 3.274947e+01 7 4 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.669900e+01 3.327066e+01 7 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 3.925900e+01 3.349550e+01 7 4 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.154700e+01 3.376898e+01 10 6 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.342300e+01 3.364576e+01 8 4 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.510600e+01 3.367623e+01 7 4 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.644000e+01 3.395780e+01 10 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 4.771800e+01 3.397041e+01 11 6 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 4.886600e+01 3.394999e+01 11 5 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 4.985800e+01 3.367564e+01 5 3 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 4.998800e+01 3.358806e+01 13 6 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): 49.989 LMO calls / sec: 534.9176818900158 Nodes / sec: 33.58738922562964 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.280000e-01 5.681818e+00 464 50 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.264000e+00 1.028481e+01 99 28 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.033000e+00 2.138240e+01 53 19 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.709000e+00 2.070244e+01 74 30 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.670500e+01 2.400479e+01 81 36 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.282400e+01 2.606905e+01 55 30 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.793700e+01 2.738304e+01 19 12 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.301300e+01 2.820101e+01 73 33 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.785400e+01 2.855709e+01 56 22 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.208500e+01 2.872758e+01 54 24 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.611600e+01 2.894874e+01 7 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.935900e+01 2.927531e+01 53 24 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.255400e+01 2.928416e+01 38 20 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.542300e+01 2.935604e+01 7 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.774300e+01 2.921566e+01 11 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.998400e+01 2.919112e+01 42 21 26657 170 21 7 1301 452 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 6.000300e+01 2.921521e+01 16 10 26665 11 6 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 25.633211473462698 Dual Gap (relative): 0.10648035868498101 Search Statistics. Total number of nodes processed: 1753 Total number of lmo calls: 26665 Total time (s): 60.004 LMO calls / sec: 444.38704086394245 Nodes / sec: 29.214719018732087 LMO calls / node: 15.211066742726754 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2355 Local tightenings / node: 1.81 Total number of potential local tightenings: 5742 Number of alternative decisions: 543 Number of stable decisions: 333 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.290000e-01 5.671078e+00 465 63 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.472000e+00 1.658576e+01 83 28 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.141000e+00 2.005731e+01 53 25 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.406000e+00 2.714016e+01 13 6 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.196200e+01 3.201806e+01 33 15 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.617500e+01 3.505410e+01 19 9 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.022800e+01 3.633577e+01 30 14 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.468900e+01 3.698003e+01 42 19 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.863900e+01 3.739656e+01 32 16 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.248100e+01 3.765278e+01 19 10 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.557200e+01 3.803553e+01 36 18 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.897300e+01 3.779540e+01 14 8 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.213300e+01 3.790378e+01 63 23 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.472600e+01 3.789742e+01 11 6 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.694900e+01 3.767918e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.884500e+01 3.744498e+01 14 8 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.052900e+01 3.690950e+01 6 3 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.200400e+01 3.640105e+01 9 6 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.323100e+01 3.582499e+01 18 9 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.445600e+01 3.527619e+01 6 4 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.551500e+01 3.474737e+01 7 4 29805 14 0 0 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.615200e+01 3.438880e+01 5 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): 56.153 LMO calls / sec: 538.8848325111749 Nodes / sec: 34.38818941107332 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.590000e-01 6.535948e+00 455 55 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.460000e-01 1.206434e+01 81 29 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.680000e-01 1.267281e+01 120 34 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.837000e+00 2.564757e+01 78 27 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.376000e+00 2.590735e+01 61 20 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.381500e+01 2.902642e+01 44 17 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.937100e+01 3.081927e+01 57 22 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.495700e+01 3.177465e+01 48 19 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.944600e+01 3.283977e+01 17 8 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.413800e+01 3.336458e+01 59 21 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.795300e+01 3.354149e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.120400e+01 3.322493e+01 8 5 20396 14 0 0 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.357100e+01 3.275114e+01 55 18 21910 381 13 9 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.538200e+01 3.241373e+01 8 5 23162 19 0 0 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 4.704900e+01 3.186040e+01 27 12 24363 145 16 10 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 4.816000e+01 3.145764e+01 8 4 25359 25 0 0 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 4.924000e+01 3.101137e+01 33 14 26283 172 13 8 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.014900e+01 3.056890e+01 10 5 27090 27 0 0 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.068900e+01 3.028270e+01 5 3 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.69 LMO calls / sec: 544.0915367922668 Nodes / sec: 30.282106924442694 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.680000e-01 6.410256e+00 465 51 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.480000e-01 1.203209e+01 77 25 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.670000e-01 1.268743e+01 117 31 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.951000e+00 2.527984e+01 75 24 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.440000e+00 2.571090e+01 53 15 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.355500e+01 2.958318e+01 40 14 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.876400e+01 3.181624e+01 46 15 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.389700e+01 3.318408e+01 47 18 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.863400e+01 3.377104e+01 18 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.344600e+01 3.405489e+01 52 18 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.715300e+01 3.426372e+01 11 6 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.037700e+01 3.390544e+01 6 3 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.292300e+01 3.319898e+01 8 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.486800e+01 3.278506e+01 28 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.664200e+01 3.205266e+01 8 4 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.788800e+01 3.155279e+01 10 6 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.905300e+01 3.092573e+01 12 6 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.003100e+01 3.044113e+01 8 5 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.051900e+01 3.014707e+01 4 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): 50.519 LMO calls / sec: 544.8445139452483 Nodes / sec: 30.147073378332905 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.564000e+00 8.417508e-01 460 54 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.853000e+00 2.335842e+00 82 28 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.975000e+00 2.767296e+00 120 33 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.096800e+01 1.832604e+01 76 25 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.148000e+01 1.890244e+01 56 17 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 171 running 1 of 1 signal (10): User defined signal 1 consCheckIntegral at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPconshdlrCheck at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolCheckOrig at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21458 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427 _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/moi_oracle.jl:358 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/moi_oracle.jl:43 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/moi_oracle.jl:24 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:483 unknown function (ip: 0x74af77ab4025) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x74af77aa0da7) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/custom_bonobo.jl:29 unknown function (ip: 0x74af77a9b47a) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 #solve#109 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/interface.jl:270 unknown function (ip: 0x74af77a7b349) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 solve at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x74af77a739cc) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c: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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_56993.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c: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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_56993.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_43827.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x74afe8ce5249) 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 ============================================================== 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.720200e+01 2.319498e+01 63 20 6090 444 23 10 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.229600e+01 2.623789e+01 44 19 8720 225 17 12 ====================================================================================== 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_80406.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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 0x00007cd10a3beb30 Total snapshots: 390. Utilization: 0% ╎390 @Base/task.jl:1168 wait_forever() 389╎ 390 @Base/task.jl:1246 wait() 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 3.246600e+01 2.300869e+01 60 22 11144 379 20 19 [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_80406.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) Allocations: 17131634 (Pool: 17130976; Big: 658); GC: 15 [171] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/PIUIk/test/branching_strategy_test.jl:275 unknown function (ip: 0x74afe8d5574e) at /lib/x86_64-linux-gnu/libc.so.6 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) _ZN6soplex9spx_allocIPNS_5TimerEEEvRT_m at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex12TimerFactory11createTimerENS_5Timer4TYPEE at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex13SPxSolverBaseIN5boost14multiprecision6numberINS2_8backends18mpfr_float_backendILj0ELNS2_20mpfr_allocation_typeE1EEELNS2_26expression_template_optionE0EEEEC1ENSA_4TypeENSA_14RepresentationENS_5Timer4TYPEE at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdEC1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpiCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21458 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427 check_feasibility at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/MOI_bounded_oracle.jl:474 check_feasibility at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/utilities.jl:30 [inlined] evaluate_node! at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/node.jl:333 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/custom_bonobo.jl:29 unknown function (ip: 0x74af77a9b47a) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 #solve#109 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/interface.jl:270 unknown function (ip: 0x74af77a7b349) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 solve at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x74af77a739cc) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c: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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_56993.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c: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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_56993.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_43827.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x74afe8ce5249) 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: 4645588973 (Pool: 4645585224; Big: 3749); GC: 2215 PkgEval terminated after 2730.85s: test duration exceeded the time limit