Package evaluation to test Boscia on Julia 1.10.10 (c8be17dcfd*) started at 2026-02-02T20:10:19.521 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.10` Set-up completed after 5.28s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [36b166db] + Boscia v0.2.5 Updating `~/.julia/environments/v1.10/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.2 [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.2.1 [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 [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 [2a0f44e3] + Base64 [ade2ca70] + Dates [8ba89e20] + Distributed [9fa8497b] + Future [b77e0a4c] + InteractiveUtils [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.23+5 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 9.77s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 21423.6 ms ✓ SCIP 22102.5 ms ✓ Boscia 29230.3 ms ✓ Boscia → BosciaSCIPExt 35965.6 ms ✓ Boscia → BosciaHiGHSExt 189953.6 ms ✓ CombinatorialLinearOracles 5 dependencies successfully precompiled in 302 seconds. 149 already precompiled. Precompilation completed after 318.27s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_y6e6iM/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.2 [86223c79] Graphs v1.13.4 [87dc4568] HiGHS v1.20.1 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates [37e2e46d] LinearAlgebra [de0858da] Printf [9a3f8284] Random [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [8dfed614] Test Status `/tmp/jl_y6e6iM/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.2 [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.20.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.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.2.1 [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 [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.12.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.24+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.8+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [9fa8497b] Future [b77e0a4c] InteractiveUtils [4af54fe1] LazyArtifacts [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.2.1+6 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [3a97d323] MPFR_jll v4.2.0+1 [c8ffd9c3] MbedTLS_jll v2.28.1010+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.23+5 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xbe03ab5f88bbfc14 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#1", var"#grad!#2", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#11", var"#grad!#13", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#21"{Float64}, var"#grad!#23"{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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [1.0, 2.0, 0.0, 2.0, 0.0, 0.0, 4.2, 1.500000000000002, 4.099999999999999, 9.7] Objective f(x) = -69.895 Status = TIME_LIMIT_REACHED Solution x = [1.0, 2.0, 0.0, 1.9999999999999998, 0.0, 0.0, 4.199999928474426, 1.4999999284744263, 4.099999999999999, 0.5999999999999999] Objective f(x) = -23.029999999999994 Status = OPT_GAP_REACHED LMO Tests seed = 0x49271b8b4f3f41b5 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#66", var"#grad!#68", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#79", var"#grad!#81", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#83", var"#grad!#85", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xe764092fabf446ac ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#92", var"#grad!#94", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#96", var"#grad!#98", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#100", var"#grad!#102", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Sparse Regression Tests seed = 0x991a7cdc975da1f0 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 0 1.646984e+00 1.651795e+00 4.811390e-03 2.921334e-03 1.203200e+01 8.311170e-02 1882 3 2 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 1.651795e+00 1.651795e+00 0.000000e+00 1.963525e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 1.651795e+00 1.651795e+00 0.000000e+00 3.210207e+00 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 1.6517954470540805 Dual Bound: 1.6469840567498166 Dual Gap (relative): 0.002921333867529227 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 6 Total time (s): 18.716 LMO calls / sec: 0.32058132079504165 Nodes / sec: 0.05343022013250694 LMO calls / node: 6.0 Total number of global tightenings: 50 Global tightenings / node: 50.0 Total number of local tightenings: 50 Local tightenings / node: 50.0 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.975126e+00 3.191158e+00 1.216031e+00 6.156727e-01 9.380000e+00 3.198294e-01 3799 172 40 89 28 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#113", var"#grad!#114", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 100 53 2.714373e+00 3.191158e+00 4.767843e-01 1.756517e-01 1.501300e+01 1.019117e+01 22 14 1154 25 15 1 200 55 2.820718e+00 3.191158e+00 3.704400e-01 1.313283e-01 1.693800e+01 1.505491e+01 24 16 1589 21 14 1 300 55 2.897648e+00 3.191158e+00 2.935091e-01 1.012922e-01 1.892200e+01 1.876123e+01 31 20 2022 25 14 0 400 55 2.951290e+00 3.191158e+00 2.398673e-01 8.127541e-02 2.094900e+01 2.171941e+01 26 16 2470 29 9 0 500 55 3.002986e+00 3.191158e+00 1.881715e-01 6.266145e-02 2.309100e+01 2.403534e+01 30 19 2927 33 13 1 600 55 3.052845e+00 3.191158e+00 1.383126e-01 4.530613e-02 2.525500e+01 2.593546e+01 22 14 3396 18 6 0 700 53 3.100645e+00 3.191158e+00 9.051250e-02 2.919150e-02 2.741000e+01 2.747173e+01 33 20 3890 42 13 3 800 51 3.145027e+00 3.191158e+00 4.613010e-02 1.466763e-02 2.960000e+01 2.875000e+01 27 17 4391 25 7 0 839 40 3.159801e+00 3.191158e+00 3.135644e-02 9.923547e-03 3.035500e+01 2.895734e+01 5 3 4566 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.206820e+00 1.016472e+00 7.190348e+00 0.000000e+00 Inf 1 LD 2 3.191158e+00 3.191158e+00 0.000000e+00 8.616018e-02 2.321258e+01 1 Last 2 3.191158e+00 3.191158e+00 0.000000e+00 1.724488e-01 1.159765e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.191158e+00 3.191158e+00 0.000000e+00 1.755779e-01 1.139096e+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.1911575761682824 Dual Bound: 3.1598011404802713 Dual Gap (relative): 0.00992354717716355 Search Statistics. Total number of nodes processed: 879 Total number of lmo calls: 4571 Total time (s): 31.768 LMO calls / sec: 143.88693024427096 Nodes / sec: 27.669352807856963 LMO calls / node: 5.2002275312855515 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: 3 Non zero entries: 24th entry: 0.17194534698496708 45th entry: 0.17194534698496708 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.135923e+00 3.191158e+00 1.055234e+00 4.940412e-01 2.440000e-01 1.229508e+01 238 181 40 89 28 1 100 26 2.854174e+00 3.191158e+00 3.369835e-01 1.180669e-01 6.437000e+00 1.957434e+01 23 14 1224 20 13 1 200 27 3.003163e+00 3.191158e+00 1.879942e-01 6.259872e-02 9.728000e+00 2.333470e+01 22 13 1910 26 15 3 300 27 3.107238e+00 3.191158e+00 8.391973e-02 2.700782e-02 1.287200e+01 2.540398e+01 17 11 2631 13 6 0 350 21 3.159664e+00 3.191158e+00 3.149337e-02 9.967314e-03 1.456500e+01 2.547202e+01 31 20 3020 38 16 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.206820e+00 1.016472e+00 7.190348e+00 0.000000e+00 Inf 1 LD 2 3.191158e+00 3.191158e+00 0.000000e+00 1.165379e-03 1.716180e+03 1 Last 2 3.191158e+00 3.191158e+00 0.000000e+00 6.889545e-03 2.902949e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.191158e+00 3.191158e+00 0.000000e+00 1.010750e-02 1.978728e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.1911575761682824 Dual Bound: 3.1596642100453987 Dual Gap (relative): 0.00996731425534338 Search Statistics. Total number of nodes processed: 371 Total number of lmo calls: 3025 Total time (s): 14.586 LMO calls / sec: 207.39064856711914 Nodes / sec: 25.435348964760728 LMO calls / node: 8.153638814016173 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 = 0x5494bc4dfb4264f2 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 -1.845004e+03 -1.789056e+03 5.594785e+01 3.127227e-02 1.241900e+01 2.415653e-01 6350 105 42 1390 21 8 * 2 3 -1.845004e+03 -1.792675e+03 5.232927e+01 2.919061e-02 1.332600e+01 3.752064e-01 901 76 72 933 23 15 * 3 4 -1.843957e+03 -1.814667e+03 2.929091e+01 1.614121e-02 1.453300e+01 4.816624e-01 1202 93 109 1308 26 8 100 101 -1.836448e+03 -1.814667e+03 2.178176e+01 1.200317e-02 1.159410e+02 1.733640e+00 1090 67 2997 1232 17 17 104 105 -1.836380e+03 -1.814667e+03 2.171369e+01 1.196567e-02 1.200040e+02 1.741609e+00 1413 64 3101 1655 20 25 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 2.287125e+03 -2.313087e+03 4.600212e+03 0.000000e+00 Inf 1 LD 2 -1.823093e+03 -1.925675e+03 1.025816e+02 8.160354e-02 2.450874e+01 2 LD 8 -1.826628e+03 -1.861374e+03 3.474589e+01 2.317775e-01 3.451586e+01 2 LD 20 -1.828944e+03 -1.843558e+03 1.461341e+01 2.454262e-01 8.149090e+01 2 LD 30 -1.829921e+03 -1.836471e+03 6.549909e+00 2.591165e-01 1.157780e+02 4 LD 40 -1.830275e+03 -1.832386e+03 2.111024e+00 2.685805e-01 1.489311e+02 4 LD 56 -1.830335e+03 -1.831092e+03 7.564889e-01 2.941316e-01 1.903909e+02 4 LD 75 -1.830343e+03 -1.830616e+03 2.732414e-01 3.094670e-01 2.423522e+02 4 LD 100 -1.830344e+03 -1.830456e+03 1.117936e-01 3.281880e-01 3.047034e+02 5 LD 119 -1.830344e+03 -1.830386e+03 4.125630e-02 3.396345e-01 3.503766e+02 5 LD 140 -1.830344e+03 -1.830359e+03 1.439788e-02 3.517758e-01 3.979807e+02 5 LD 165 -1.830344e+03 -1.830350e+03 5.457494e-03 3.652391e-01 4.517589e+02 5 LD 190 -1.830344e+03 -1.830346e+03 2.088420e-03 3.771670e-01 5.037556e+02 5 LD 217 -1.830344e+03 -1.830345e+03 7.754100e-04 3.982214e-01 5.449230e+02 5 LD 242 -1.830344e+03 -1.830345e+03 2.933160e-04 4.101319e-01 5.900541e+02 5 LD 262 -1.830344e+03 -1.830344e+03 1.047437e-04 4.198498e-01 6.240327e+02 5 LD 297 -1.830344e+03 -1.830344e+03 3.433525e-05 4.354878e-01 6.819939e+02 5 LD 314 -1.830344e+03 -1.830344e+03 1.045579e-05 4.448518e-01 7.058530e+02 5 LD 337 -1.830344e+03 -1.830344e+03 3.651266e-06 4.556200e-01 7.396515e+02 5 LD 356 -1.830344e+03 -1.830344e+03 1.342109e-06 4.654374e-01 7.648719e+02 5 LD 376 -1.830344e+03 -1.830344e+03 7.768283e-07 4.753497e-01 7.909966e+02 5 Last 376 -1.830344e+03 -1.830344e+03 7.768283e-07 4.803790e-01 7.827153e+02 5 ---------------------------------------------------------------------------------------------------------------- PP 376 -1.830344e+03 -1.830344e+03 7.768283e-07 4.826881e-01 7.789710e+02 5 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -1830.344376369127 Dual Bound: -1836.3802339223514 Dual Gap (relative): 0.003297662249329126 Search Statistics. Total number of nodes processed: 209 Total number of lmo calls: 3130 Total time (s): 121.885 LMO calls / sec: 25.67994420970587 Nodes / sec: 1.7147310989867497 LMO calls / node: 14.976076555023923 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 -1.381870e+03 -1.381680e+03 1.899332e-01 1.374655e-04 1.047600e+01 2.863688e-01 3141 24 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -6.972735e+02 -1.409520e+03 7.122469e+02 0.000000e+00 Inf 1 LD 2 -1.381680e+03 -1.381680e+03 0.000000e+00 8.468028e-02 2.361825e+01 1 Last 2 -1.381680e+03 -1.381680e+03 0.000000e+00 1.732569e-01 1.154355e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.381680e+03 -1.381680e+03 0.000000e+00 1.763468e-01 1.134129e+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: -1381.6796943943953 Dual Bound: -1381.8696276312078 Dual Gap (relative): 0.0001374654614836554 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 11.992 LMO calls / sec: 0.9172781854569713 Nodes / sec: 0.2501667778519012 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 WARNING: redefinition of constant Main.groups. This may fail, cause incorrect answers, or produce other errors. 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.911099e+02 3.427763e+02 1.516664e+02 7.936079e-01 1.019500e+01 2.942619e-01 4444 113 24 68 11 1 * 2 3 1.911099e+02 3.381854e+02 1.470754e+02 7.695855e-01 1.040300e+01 4.806306e-01 203 107 46 66 12 0 100 91 2.838529e+02 3.381854e+02 5.433248e+01 1.914107e-01 2.997000e+01 6.373040e+00 97 45 1454 56 6 2 200 163 3.074261e+02 3.381854e+02 3.075923e+01 1.000541e-01 3.770100e+01 9.628392e+00 46 27 2551 19 3 0 300 149 3.186083e+02 3.381854e+02 1.957705e+01 6.144550e-02 4.189200e+01 1.071804e+01 19 8 3204 2 0 0 * 390 117 3.277653e+02 3.379819e+02 1.021666e+01 3.117065e-02 4.444600e+01 1.145210e+01 15 9 3654 2 0 0 400 111 3.293413e+02 3.379819e+02 8.640624e+00 2.623608e-02 4.469300e+01 1.147831e+01 5 4 3695 0 0 0 469 50 3.349579e+02 3.379819e+02 3.024015e+00 9.028043e-03 4.591500e+01 1.134705e+01 15 10 3929 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.381854e+02 3.287283e+02 9.457080e+00 0.000000e+00 Inf 1 LD 2 3.379819e+02 3.379819e+02 1.109083e-07 9.197592e-02 2.174482e+01 2 Last 2 3.379819e+02 3.379819e+02 1.109083e-07 1.843711e-01 1.084769e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.379819e+02 3.379819e+02 1.109083e-07 1.878580e-01 1.064634e+01 2 ---------------------------------------------------------------------------------------------------------------- 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: 337.9819442265657 Dual Bound: 334.95792950964955 Dual Gap (relative): 0.009028043376501226 Search Statistics. Total number of nodes processed: 521 Total number of lmo calls: 3934 Total time (s): 47.55 LMO calls / sec: 82.73396424815984 Nodes / sec: 10.956887486855942 LMO calls / node: 7.550863723608446 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.911099e+02 3.427763e+02 1.516664e+02 7.936079e-01 1.281500e+01 2.341007e-01 4509 113 24 68 11 1 * 9 10 2.229476e+02 3.424034e+02 1.194558e+02 5.358021e-01 1.967000e+01 9.659380e-01 115 63 170 48 10 2 * 15 16 2.356273e+02 3.383154e+02 1.026881e+02 4.358071e-01 2.429800e+01 1.275825e+00 109 66 276 34 9 1 * 39 38 2.629475e+02 3.381854e+02 7.523793e+01 2.861329e-01 3.973200e+01 1.937984e+00 98 52 622 34 7 0 100 79 2.906321e+02 3.381854e+02 4.755333e+01 1.636204e-01 6.900600e+01 2.593977e+00 52 31 1306 16 5 0 200 119 3.146769e+02 3.381854e+02 2.350847e+01 7.470668e-02 1.012620e+02 3.150244e+00 12 8 1993 2 2 0 * 237 110 3.224105e+02 3.379819e+02 1.557148e+01 4.829707e-02 1.075270e+02 3.227096e+00 17 12 2172 2 0 0 300 73 3.297230e+02 3.379819e+02 8.258942e+00 2.504812e-02 1.135080e+02 3.286112e+00 11 7 2421 2 0 0 361 28 3.350277e+02 3.379819e+02 2.954202e+00 8.817784e-03 1.175490e+02 3.309258e+00 5 3 2631 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 3.381854e+02 3.287283e+02 9.457080e+00 0.000000e+00 Inf 1 LD 2 3.379819e+02 3.379819e+02 1.109083e-07 8.931043e-02 2.239380e+01 2 Last 2 3.379819e+02 3.379819e+02 1.109083e-07 1.801352e-01 1.110277e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.379819e+02 3.379819e+02 1.109083e-07 1.835281e-01 1.089752e+01 2 ---------------------------------------------------------------------------------------------------------------- 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: 337.9819442265657 Dual Bound: 335.0277418521887 Dual Gap (relative): 0.008817784336439777 Search Statistics. Total number of nodes processed: 389 Total number of lmo calls: 2636 Total time (s): 119.142 LMO calls / sec: 22.124859411458598 Nodes / sec: 3.265011498883685 LMO calls / node: 6.776349614395887 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 = 0xf0c3131d529674d2 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 -3.418030e+02 -1.278013e+02 2.140017e+02 1.674487e+00 1.792800e+01 1.673360e-01 11067 5989 32 9139 10 11 * 2 3 -3.418030e+02 -1.780460e+02 1.637570e+02 9.197451e-01 2.401000e+01 2.082466e-01 6079 5719 57 10001 9 22 * 6 7 -3.417637e+02 -1.909139e+02 1.508498e+02 7.901461e-01 4.480000e+01 2.901786e-01 8143 7810 158 10001 8 16 * 7 8 -3.417311e+02 -3.390429e+02 2.688153e+00 7.928651e-03 4.655100e+01 3.222272e-01 1721 1646 184 1803 7 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -339.0429465458081 Dual Bound: -341.73109973739906 Dual Gap (relative): 0.007928650983534838 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 184 Total time (s): 47.13 LMO calls / sec: 3.904095056227456 Nodes / sec: 0.31826861871419476 LMO calls / node: 12.266666666666667 Total number of global tightenings: 3 Global tightenings / node: 0.43 Total number of local tightenings: 6 Local tightenings / node: 0.86 Total number of potential local tightenings: 157 Time Limit Test seed = 0x55285bcfff88ac25 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 -1.310856e+00 0.000000e+00 1.310856e+00 Inf 9.528000e+00 3.148615e-01 4060 44 24 451 10 2 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#137", var"#grad!#138", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 41 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.050600e+01 3.902532e+00 5 3 434 4 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: 0.0 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 41 Total number of lmo calls: 434 Total time (s): 11.076 LMO calls / sec: 39.183820873961714 Nodes / sec: 3.7016973636691946 LMO calls / node: 10.585365853658537 Total number of global tightenings: 6 Global tightenings / node: 0.15 Total number of local tightenings: 60 Local tightenings / node: 1.46 Total number of potential local tightenings: 71 Strong Convexity and Sharpness Tests seed = 0x602b80e60ee456ac 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.293655e+02 2.299702e+02 6.047723e-01 2.636719e-03 1.008800e+01 2.973830e-01 4054 0 12 13 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 229.97024715400926 Dual Bound: 229.36547481323595 Dual Gap (relative): 0.00263671915429187 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 10.759 LMO calls / sec: 1.115345292313412 Nodes / sec: 0.278836323078353 LMO calls / node: 4.0 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 1.726129e+02 1.726871e+02 7.421732e-02 4.299639e-04 8.927000e+00 3.360591e-01 3588 0 13 18 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 172.68712112566556 Dual Bound: 172.61290380968032 Dual Gap (relative): 0.0004299638923117107 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 9.535 LMO calls / sec: 1.3633980073413738 Nodes / sec: 0.3146303093864709 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: 17 Branching Strategy Tests seed = 0xb8959300c9af9b6b 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.902794e-03 7.382204e+00 7.391107e+00 Inf 1.058700e+01 2.833664e-01 4591 46 47 3141 24 10 61 4 7.321286e+00 7.382204e+00 6.091768e-02 8.320625e-03 1.187800e+01 5.472302e+00 23 10 950 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321286478324873 Dual Gap (relative): 0.008320625372216138 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 950 Total time (s): 12.539 LMO calls / sec: 75.76361751335833 Nodes / sec: 5.183826461440306 LMO calls / node: 14.615384615384615 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 80 Local tightenings / node: 1.31 Total number of potential local tightenings: 156 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.902794e-03 7.382204e+00 7.391107e+00 Inf 2.370000e-01 1.265823e+01 153 44 47 3141 24 10 93 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.647000e+00 5.768063e+01 3 2 1036 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538824 Dual Gap (relative): 0.00599024428757053 Search Statistics. Total number of nodes processed: 95 Total number of lmo calls: 1036 Total time (s): 1.649 LMO calls / sec: 628.2595512431777 Nodes / sec: 57.610673135233476 LMO calls / node: 10.905263157894737 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 51 Local tightenings / node: 0.55 Total number of potential local tightenings: 113 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.902794e-03 7.382204e+00 7.391107e+00 Inf 2.360000e-01 1.271186e+01 154 35 47 3141 24 10 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#159"{Vector{Float64}}, var"#grad!#160"{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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 79 2 7.335593e+00 7.382204e+00 4.661087e-02 6.354070e-03 1.603000e+00 5.053026e+01 6 4 1109 16 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.3355932901271155 Dual Gap (relative): 0.006354069586887154 Search Statistics. Total number of nodes processed: 81 Total number of lmo calls: 1109 Total time (s): 1.605 LMO calls / sec: 690.9657320872274 Nodes / sec: 50.467289719626166 LMO calls / node: 13.691358024691358 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 0.97 Total number of potential local tightenings: 158 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.902794e-03 7.382204e+00 7.391107e+00 Inf 2.280000e-01 1.315789e+01 143 37 47 3141 24 10 73 2 7.335318e+00 7.382204e+00 4.688593e-02 6.391806e-03 1.406000e+00 5.334282e+01 11 7 883 29 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.335318230947083 Dual Gap (relative): 0.006391805771806206 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 883 Total time (s): 1.407 LMO calls / sec: 627.5764036958067 Nodes / sec: 53.304904051172706 LMO calls / node: 11.773333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 63 Local tightenings / node: 0.86 Total number of potential local tightenings: 130 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.902794e-03 7.382204e+00 7.391107e+00 Inf 2.270000e-01 1.321586e+01 159 36 47 3141 24 10 93 4 7.324697e+00 7.382204e+00 5.750725e-02 7.851145e-03 1.652000e+00 5.871671e+01 3 2 1215 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.324696906489077 Dual Gap (relative): 0.007851144504513486 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1215 Total time (s): 1.654 LMO calls / sec: 734.5828295042322 Nodes / sec: 58.64570737605804 LMO calls / node: 12.525773195876289 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: 169 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.096902e-03 3.396650e+01 3.397560e+01 Inf 3.380000e-01 8.875740e+00 334 51 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 5.960000e-01 1.510067e+01 87 37 190 716 27 23 * 38 39 8.272897e+00 2.977156e+01 2.149867e+01 2.598687e+00 2.728000e+00 2.822581e+01 45 22 1349 341 18 13 * 92 93 1.272822e+01 2.929131e+01 1.656308e+01 1.301288e+00 5.575000e+00 3.318386e+01 46 19 2995 515 19 23 100 101 1.300691e+01 2.929131e+01 1.628440e+01 1.251980e+00 5.995000e+00 3.352794e+01 56 25 3246 534 24 21 * 108 109 1.349880e+01 2.836265e+01 1.486385e+01 1.101124e+00 6.400000e+00 3.390625e+01 47 19 3482 496 17 25 200 201 1.669702e+01 2.836265e+01 1.166563e+01 6.986651e-01 1.060800e+01 3.780166e+01 39 20 6051 253 18 18 300 297 1.877945e+01 2.836265e+01 9.583195e+00 5.103022e-01 1.506600e+01 3.962565e+01 44 19 8820 415 16 5 400 393 2.048381e+01 2.836265e+01 7.878831e+00 3.846369e-01 1.930100e+01 4.108595e+01 39 18 11508 346 19 13 500 467 2.164533e+01 2.836265e+01 6.717317e+00 3.103357e-01 2.293900e+01 4.215528e+01 18 11 13920 55 0 0 600 539 2.275229e+01 2.836265e+01 5.610356e+00 2.465842e-01 2.669900e+01 4.266077e+01 40 18 16318 356 16 11 700 573 2.371196e+01 2.836265e+01 4.650688e+00 1.961326e-01 2.968900e+01 4.287783e+01 9 6 18394 27 0 0 800 569 2.442876e+01 2.836265e+01 3.933890e+00 1.610352e-01 3.243000e+01 4.221400e+01 8 5 20253 13 0 0 900 525 2.527570e+01 2.836265e+01 3.086944e+00 1.221309e-01 3.450800e+01 4.129477e+01 9 6 21756 20 0 0 1000 471 2.586631e+01 2.836265e+01 2.496337e+00 9.650919e-02 3.624000e+01 4.059051e+01 31 16 23083 173 14 2 1100 395 2.634747e+01 2.836265e+01 2.015172e+00 7.648444e-02 3.782800e+01 3.952099e+01 10 6 24284 28 0 0 1200 309 2.698685e+01 2.836265e+01 1.375792e+00 5.098010e-02 3.903200e+01 3.866059e+01 10 6 25259 51 0 0 1300 217 2.746414e+01 2.836265e+01 8.985015e-01 3.271544e-02 4.015600e+01 3.777767e+01 10 6 26160 30 0 0 1400 123 2.789068e+01 2.836265e+01 4.719607e-01 1.692180e-02 4.113700e+01 3.702263e+01 10 6 26962 25 0 0 1451 72 2.808258e+01 2.836265e+01 2.800628e-01 9.972829e-03 4.160600e+01 3.660530e+01 4 3 27363 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082582228519655 Dual Gap (relative): 0.009972829229389727 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27363 Total time (s): 41.607 LMO calls / sec: 657.6537601845844 Nodes / sec: 36.604417525897084 LMO calls / node: 17.96651346027577 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2434 Local tightenings / node: 1.68 Total number of potential local tightenings: 5214 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.096902e-03 3.396650e+01 3.397560e+01 Inf 1.090000e+00 2.752294e+00 337 52 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 1.348000e+00 6.676558e+00 82 39 190 716 27 23 * 38 39 8.272897e+00 2.977156e+01 2.149867e+01 2.598687e+00 3.473000e+00 2.217103e+01 49 24 1349 341 18 13 * 92 93 1.272822e+01 2.929131e+01 1.656308e+01 1.301288e+00 6.331000e+00 2.922129e+01 49 20 2995 515 19 23 100 101 1.300691e+01 2.929131e+01 1.628440e+01 1.251980e+00 6.764000e+00 2.971614e+01 58 26 3246 534 24 21 * 108 109 1.349880e+01 2.836265e+01 1.486385e+01 1.101124e+00 7.181000e+00 3.021863e+01 48 20 3482 496 17 25 200 197 1.666560e+01 2.836265e+01 1.169705e+01 7.018678e-01 1.173200e+01 3.383907e+01 56 26 5997 474 22 10 300 261 1.834585e+01 2.836265e+01 1.001680e+01 5.459982e-01 1.553100e+01 3.612131e+01 39 20 8388 261 21 12 400 313 1.984868e+01 2.836265e+01 8.513962e+00 4.289434e-01 1.892900e+01 3.766707e+01 15 10 10586 40 0 0 500 349 2.103523e+01 2.836265e+01 7.327414e+00 3.483401e-01 2.185400e+01 3.884872e+01 25 13 12489 186 14 6 600 387 2.187950e+01 2.836265e+01 6.483144e+00 2.963113e-01 2.462700e+01 4.007796e+01 16 9 14406 74 12 1 700 405 2.283247e+01 2.836265e+01 5.530175e+00 2.422066e-01 2.676900e+01 4.127909e+01 7 4 16071 22 0 0 800 421 2.364741e+01 2.836265e+01 4.715233e+00 1.993974e-01 2.864300e+01 4.262822e+01 6 3 17771 12 0 0 900 415 2.432588e+01 2.836265e+01 4.036761e+00 1.659451e-01 3.062900e+01 4.293317e+01 8 5 19322 13 0 0 1000 403 2.516309e+01 2.836265e+01 3.199552e+00 1.271526e-01 3.269700e+01 4.290914e+01 9 6 20762 13 0 0 1100 361 2.578879e+01 2.836265e+01 2.573856e+00 9.980525e-02 3.425600e+01 4.264946e+01 7 4 22001 13 0 0 1200 319 2.638848e+01 2.836265e+01 1.974161e+00 7.481144e-02 3.564800e+01 4.261109e+01 6 3 23124 11 0 0 1300 277 2.677964e+01 2.836265e+01 1.583006e+00 5.911228e-02 3.674000e+01 4.292324e+01 5 3 24079 6 0 0 1400 221 2.729218e+01 2.836265e+01 1.070469e+00 3.922258e-02 3.779700e+01 4.288700e+01 6 4 24990 10 0 0 1500 157 2.766479e+01 2.836265e+01 6.978521e-01 2.522528e-02 3.884200e+01 4.266001e+01 6 4 25849 9 0 0 1600 77 2.803139e+01 2.836265e+01 3.312598e-01 1.181746e-02 3.976300e+01 4.217489e+01 12 7 26603 17 0 0 1611 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 3.988200e+01 4.204904e+01 9 6 26699 28 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757884 Dual Gap (relative): 0.009945008189894104 Search Statistics. Total number of nodes processed: 1677 Total number of lmo calls: 26699 Total time (s): 39.884 LMO calls / sec: 669.4163072911443 Nodes / sec: 42.04693611473272 LMO calls / node: 15.920691711389386 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2237 Local tightenings / node: 1.39 Total number of potential local tightenings: 5449 Number of alternative decisions: 438 Number of stable decisions: 400 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.096902e-03 3.396650e+01 3.397560e+01 Inf 3.990000e-01 7.518797e+00 368 50 60 5824 38 8 * 10 11 1.500796e+00 2.929131e+01 2.779051e+01 1.851718e+01 1.403000e+00 1.496793e+01 52 22 407 516 16 28 * 57 58 7.854307e+00 2.836265e+01 2.050834e+01 2.611094e+00 4.034000e+00 2.850768e+01 32 18 1886 188 15 12 100 101 1.073043e+01 2.836265e+01 1.763221e+01 1.643197e+00 6.035000e+00 3.330572e+01 48 22 3172 437 23 16 200 199 1.337616e+01 2.836265e+01 1.498649e+01 1.120388e+00 9.979000e+00 3.998397e+01 35 17 5918 445 22 14 300 281 1.532512e+01 2.836265e+01 1.303753e+01 8.507293e-01 1.364500e+01 4.257970e+01 41 17 8431 417 19 20 400 357 1.708377e+01 2.836265e+01 1.127887e+01 6.602097e-01 1.703600e+01 4.443531e+01 37 17 10831 298 21 16 500 425 1.863737e+01 2.836265e+01 9.725271e+00 5.218156e-01 2.023900e+01 4.570384e+01 32 17 13155 192 15 10 600 483 1.949134e+01 2.836265e+01 8.871308e+00 4.551411e-01 2.336400e+01 4.635336e+01 27 13 15311 186 9 5 700 513 2.057409e+01 2.836265e+01 7.788556e+00 3.785614e-01 2.605900e+01 4.654822e+01 29 16 17285 245 15 10 800 531 2.168275e+01 2.836265e+01 6.679900e+00 3.080744e-01 2.845100e+01 4.678219e+01 34 19 19090 176 19 12 900 545 2.267775e+01 2.836265e+01 5.684890e+00 2.506814e-01 3.098000e+01 4.664300e+01 12 7 20948 51 0 0 1000 515 2.352487e+01 2.836265e+01 4.837773e+00 2.056450e-01 3.278900e+01 4.620452e+01 9 5 22324 12 0 0 1100 495 2.442112e+01 2.836265e+01 3.941528e+00 1.613983e-01 3.447400e+01 4.626675e+01 6 4 23618 10 0 0 1200 459 2.519609e+01 2.836265e+01 3.166551e+00 1.256763e-01 3.600400e+01 4.607821e+01 14 8 24821 53 0 0 1300 417 2.582030e+01 2.836265e+01 2.542349e+00 9.846319e-02 3.740500e+01 4.590295e+01 7 5 25926 20 0 0 1400 345 2.648807e+01 2.836265e+01 1.874572e+00 7.077040e-02 3.864900e+01 4.514994e+01 5 4 26933 9 0 0 1500 281 2.696179e+01 2.836265e+01 1.400857e+00 5.195711e-02 3.970900e+01 4.485129e+01 14 8 27813 45 11 0 1600 197 2.744859e+01 2.836265e+01 9.140554e-01 3.330063e-02 4.057100e+01 4.429272e+01 10 6 28560 18 0 0 1700 105 2.788951e+01 2.836265e+01 4.731377e-01 1.696472e-02 4.136400e+01 4.363698e+01 3 2 29287 2 0 0 1743 66 2.808813e+01 2.836265e+01 2.745195e-01 9.773509e-03 4.165900e+01 4.342399e+01 4 3 29538 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.088125490924327 Dual Gap (relative): 0.009773508544361598 Search Statistics. Total number of nodes processed: 1809 Total number of lmo calls: 29538 Total time (s): 41.66 LMO calls / sec: 709.0254440710514 Nodes / sec: 43.42294767162746 LMO calls / node: 16.328358208955223 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2541 Local tightenings / node: 1.46 Total number of potential local tightenings: 6056 Number of alternative decisions: 316 Number of stable decisions: 588 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.096902e-03 3.396650e+01 3.397560e+01 Inf 3.560000e-01 8.426966e+00 329 46 60 5824 38 8 * 13 14 5.020533e-01 3.120765e+01 3.070559e+01 6.116003e+01 1.273000e+00 2.120974e+01 78 30 472 886 26 26 * 28 29 1.667844e+00 3.102006e+01 2.935222e+01 1.759890e+01 1.952000e+00 2.920082e+01 28 14 884 221 21 8 * 45 46 5.412838e+00 3.091302e+01 2.550018e+01 4.711056e+00 2.603000e+00 3.495966e+01 47 23 1338 377 20 14 * 58 57 5.611797e+00 2.977156e+01 2.415977e+01 4.305174e+00 3.061000e+00 3.756942e+01 34 18 1661 213 14 11 100 95 6.931749e+00 2.977156e+01 2.283981e+01 3.294957e+00 4.847000e+00 4.023107e+01 62 29 2797 558 21 8 200 187 1.018507e+01 2.977156e+01 1.958650e+01 1.923060e+00 8.279000e+00 4.674478e+01 51 24 5223 206 18 3 * 264 235 1.107366e+01 2.836265e+01 1.728899e+01 1.561271e+00 1.046000e+01 4.847036e+01 44 26 6761 263 16 17 300 267 1.193002e+01 2.836265e+01 1.643263e+01 1.377419e+00 1.158200e+01 4.964600e+01 13 6 7590 102 15 4 400 347 1.319730e+01 2.836265e+01 1.516534e+01 1.149124e+00 1.458600e+01 5.176196e+01 19 11 9828 71 11 3 500 423 1.522934e+01 2.836265e+01 1.313331e+01 8.623690e-01 1.734900e+01 5.366304e+01 13 7 12004 68 11 6 600 485 1.679980e+01 2.836265e+01 1.156285e+01 6.882732e-01 2.029700e+01 5.385032e+01 8 5 14204 12 0 0 700 547 1.796166e+01 2.836265e+01 1.040098e+01 5.790656e-01 2.342200e+01 5.358210e+01 17 11 16389 46 0 0 800 591 1.926452e+01 2.836265e+01 9.098128e+00 4.722739e-01 2.631900e+01 5.315552e+01 14 8 18421 57 8 1 900 633 2.058218e+01 2.836265e+01 7.780464e+00 3.780194e-01 2.892900e+01 5.326835e+01 13 8 20322 45 0 0 1000 645 2.137343e+01 2.836265e+01 6.989217e+00 3.270050e-01 3.123000e+01 5.292988e+01 11 7 22014 22 0 0 1100 653 2.213722e+01 2.836265e+01 6.225421e+00 2.812196e-01 3.338200e+01 5.275298e+01 16 10 23630 54 0 0 1200 641 2.296048e+01 2.836265e+01 5.402170e+00 2.352813e-01 3.539500e+01 5.223902e+01 8 5 25155 15 0 0 1300 633 2.378573e+01 2.836265e+01 4.576920e+00 1.924230e-01 3.752800e+01 5.172138e+01 30 15 26686 233 17 7 1400 607 2.446633e+01 2.836265e+01 3.896316e+00 1.592522e-01 3.923900e+01 5.135197e+01 13 8 28036 33 0 0 1500 567 2.493975e+01 2.836265e+01 3.422895e+00 1.372466e-01 4.087400e+01 5.076577e+01 26 14 29288 156 14 3 1600 517 2.563443e+01 2.836265e+01 2.728212e+00 1.064277e-01 4.208100e+01 5.049785e+01 23 9 30442 171 12 6 1700 467 2.604297e+01 2.836265e+01 2.319680e+00 8.907127e-02 4.334600e+01 5.017764e+01 8 5 31516 17 0 0 1800 405 2.653270e+01 2.836265e+01 1.829947e+00 6.896951e-02 4.461700e+01 4.959993e+01 3 2 32515 6 0 0 1900 327 2.705723e+01 2.836265e+01 1.305417e+00 4.824653e-02 4.567900e+01 4.892839e+01 8 5 33394 17 0 0 2000 251 2.743008e+01 2.836265e+01 9.325648e-01 3.399789e-02 4.665900e+01 4.841510e+01 10 6 34231 13 0 0 2100 155 2.777616e+01 2.836265e+01 5.864891e-01 2.111484e-02 4.754000e+01 4.760202e+01 8 5 34960 10 0 0 2177 78 2.810418e+01 2.836265e+01 2.584655e-01 9.196691e-03 4.823200e+01 4.691906e+01 8 5 35527 16 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.104179568195853 Dual Gap (relative): 0.00919669106802947 Search Statistics. Total number of nodes processed: 2263 Total number of lmo calls: 35527 Total time (s): 48.233 LMO calls / sec: 736.570397860386 Nodes / sec: 46.91808512843904 LMO calls / node: 15.699072028281043 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2197 Local tightenings / node: 1.01 Total number of potential local tightenings: 5058 Number of alternative decisions: 339 Number of stable decisions: 792 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.096902e-03 3.396650e+01 3.397560e+01 Inf 3.210000e-01 9.345794e+00 318 49 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 5.740000e-01 1.567944e+01 93 44 190 716 27 23 * 38 39 8.272897e+00 2.977156e+01 2.149867e+01 2.598687e+00 2.621000e+00 2.937810e+01 47 23 1349 341 18 13 * 92 93 1.272822e+01 2.929131e+01 1.656308e+01 1.301288e+00 5.575000e+00 3.318386e+01 52 21 2995 515 19 23 100 101 1.300691e+01 2.929131e+01 1.628440e+01 1.251980e+00 6.016000e+00 3.341090e+01 58 25 3246 534 24 21 * 108 109 1.349880e+01 2.836265e+01 1.486385e+01 1.101124e+00 6.401000e+00 3.390095e+01 51 21 3482 496 17 25 200 201 1.669702e+01 2.836265e+01 1.166563e+01 6.986651e-01 1.073000e+01 3.737185e+01 38 20 6051 253 18 18 300 297 1.877945e+01 2.836265e+01 9.583195e+00 5.103022e-01 1.523800e+01 3.917837e+01 43 18 8820 415 16 5 400 393 2.048381e+01 2.836265e+01 7.878831e+00 3.846369e-01 1.940900e+01 4.085733e+01 38 17 11508 346 19 13 500 467 2.164533e+01 2.836265e+01 6.717317e+00 3.103357e-01 2.288100e+01 4.226214e+01 18 11 13920 55 0 0 600 539 2.275229e+01 2.836265e+01 5.610356e+00 2.465842e-01 2.657900e+01 4.285338e+01 37 17 16318 356 16 11 700 573 2.371196e+01 2.836265e+01 4.650688e+00 1.961326e-01 2.949000e+01 4.316718e+01 10 6 18394 27 0 0 800 569 2.442876e+01 2.836265e+01 3.933890e+00 1.610352e-01 3.206000e+01 4.270119e+01 7 5 20253 13 0 0 900 527 2.527227e+01 2.836265e+01 3.090373e+00 1.222831e-01 3.401100e+01 4.195701e+01 27 12 21749 257 15 14 1000 471 2.585340e+01 2.836265e+01 2.509242e+00 9.705654e-02 3.567800e+01 4.122989e+01 9 6 23046 17 0 0 1100 399 2.633099e+01 2.836265e+01 2.031653e+00 7.715823e-02 3.717100e+01 4.032714e+01 12 7 24239 51 0 0 1200 315 2.695380e+01 2.836265e+01 1.408845e+00 5.226888e-02 3.834300e+01 3.951178e+01 9 6 25221 24 0 0 1300 227 2.742558e+01 2.836265e+01 9.370608e-01 3.416740e-02 3.939600e+01 3.876028e+01 22 11 26132 145 14 6 1400 133 2.784529e+01 2.836265e+01 5.173566e-01 1.857968e-02 4.032000e+01 3.802083e+01 15 8 26922 87 0 0 1465 70 2.808258e+01 2.836265e+01 2.800628e-01 9.972829e-03 4.092700e+01 3.750580e+01 5 3 27418 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082582228519655 Dual Gap (relative): 0.009972829229389727 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27418 Total time (s): 40.928 LMO calls / sec: 669.9081313526193 Nodes / sec: 37.50488663017983 LMO calls / node: 17.861889250814333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2432 Local tightenings / node: 1.66 Total number of potential local tightenings: 5217 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.096902e-03 3.396650e+01 3.397560e+01 Inf 3.170000e-01 9.463722e+00 313 46 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 5.420000e-01 1.660517e+01 74 32 190 716 27 23 * 38 39 8.272897e+00 2.977156e+01 2.149867e+01 2.598687e+00 2.516000e+00 3.060413e+01 41 20 1349 341 18 13 * 92 93 1.272822e+01 2.929131e+01 1.656308e+01 1.301288e+00 5.177000e+00 3.573498e+01 46 18 2995 515 19 23 100 101 1.300691e+01 2.929131e+01 1.628440e+01 1.251980e+00 5.587000e+00 3.597637e+01 53 23 3246 534 24 21 * 108 109 1.349880e+01 2.836265e+01 1.486385e+01 1.101124e+00 5.966000e+00 3.637278e+01 41 15 3482 496 17 25 200 201 1.669702e+01 2.836265e+01 1.166563e+01 6.986651e-01 9.891000e+00 4.054191e+01 39 20 6051 253 18 18 300 297 1.877945e+01 2.836265e+01 9.583195e+00 5.103022e-01 1.423800e+01 4.193005e+01 44 19 8820 415 16 5 400 393 2.048381e+01 2.836265e+01 7.878831e+00 3.846369e-01 1.845300e+01 4.297404e+01 40 18 11508 346 19 13 500 467 2.164533e+01 2.836265e+01 6.717317e+00 3.103357e-01 2.212800e+01 4.370029e+01 15 9 13920 55 0 0 600 539 2.275229e+01 2.836265e+01 5.610356e+00 2.465842e-01 2.587200e+01 4.402443e+01 37 16 16318 356 16 11 700 573 2.371196e+01 2.836265e+01 4.650688e+00 1.961326e-01 2.874700e+01 4.428288e+01 10 6 18394 27 0 0 800 569 2.442876e+01 2.836265e+01 3.933890e+00 1.610352e-01 3.132600e+01 4.370172e+01 8 5 20253 13 0 0 900 525 2.527570e+01 2.836265e+01 3.086944e+00 1.221309e-01 3.331200e+01 4.277738e+01 8 5 21756 20 0 0 1000 471 2.586631e+01 2.836265e+01 2.496337e+00 9.650919e-02 3.501200e+01 4.201417e+01 27 15 23083 173 14 2 1100 395 2.634747e+01 2.836265e+01 2.015172e+00 7.648444e-02 3.651300e+01 4.094432e+01 8 5 24284 28 0 0 1200 309 2.698685e+01 2.836265e+01 1.375792e+00 5.098010e-02 3.761400e+01 4.011804e+01 9 5 25259 51 0 0 1300 217 2.746414e+01 2.836265e+01 8.985015e-01 3.271544e-02 3.862000e+01 3.928017e+01 9 5 26160 30 0 0 1400 123 2.789068e+01 2.836265e+01 4.719607e-01 1.692180e-02 3.952800e+01 3.852965e+01 10 6 26962 25 0 0 1451 72 2.808258e+01 2.836265e+01 2.800628e-01 9.972829e-03 4.000600e+01 3.806929e+01 5 3 27363 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082582228519655 Dual Gap (relative): 0.009972829229389727 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27363 Total time (s): 40.007 LMO calls / sec: 683.9553078211313 Nodes / sec: 38.06833804084285 LMO calls / node: 17.96651346027577 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2434 Local tightenings / node: 1.68 Total number of potential local tightenings: 5214 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.096902e-03 3.396650e+01 3.397560e+01 Inf 1.716000e+00 1.748252e+00 305 48 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 1.956000e+00 4.601227e+00 79 35 190 716 27 23 * 38 39 8.272897e+00 2.977156e+01 2.149867e+01 2.598687e+00 4.086000e+00 1.884484e+01 43 21 1349 341 18 13 * 92 93 1.272822e+01 2.929131e+01 1.656308e+01 1.301288e+00 6.782000e+00 2.727809e+01 48 19 2995 515 19 23 100 101 1.300691e+01 2.929131e+01 1.628440e+01 1.251980e+00 7.188000e+00 2.796327e+01 54 23 3246 534 24 21 * 108 109 1.349880e+01 2.836265e+01 1.486385e+01 1.101124e+00 7.560000e+00 2.870370e+01 43 16 3482 496 17 25 200 199 1.683468e+01 2.836265e+01 1.152796e+01 6.847747e-01 1.143100e+01 3.490508e+01 38 16 6082 470 21 10 300 285 1.916384e+01 2.836265e+01 9.198805e+00 4.800084e-01 1.548100e+01 3.778826e+01 28 15 8773 161 16 14 400 347 2.074976e+01 2.836265e+01 7.612885e+00 3.668903e-01 1.916500e+01 3.897730e+01 10 6 11182 25 0 0 500 399 2.224946e+01 2.836265e+01 6.113186e+00 2.747566e-01 2.244400e+01 4.005525e+01 12 7 13379 35 0 0 600 409 2.364275e+01 2.836265e+01 4.719896e+00 1.996340e-01 2.520600e+01 4.003015e+01 8 5 15251 14 0 0 700 409 2.449930e+01 2.836265e+01 3.863343e+00 1.576919e-01 2.781900e+01 3.986484e+01 5 3 17006 6 0 0 800 359 2.544068e+01 2.836265e+01 2.921966e+00 1.148541e-01 2.958900e+01 3.916996e+01 10 6 18366 25 0 0 900 303 2.616171e+01 2.836265e+01 2.200936e+00 8.412816e-02 3.129800e+01 3.843696e+01 11 7 19639 32 0 0 1000 229 2.689923e+01 2.836265e+01 1.463413e+00 5.440351e-02 3.274000e+01 3.753818e+01 31 14 20774 274 14 3 1100 141 2.762412e+01 2.836265e+01 7.385238e-01 2.673474e-02 3.377500e+01 3.674315e+01 6 4 21616 10 0 0 1187 58 2.809448e+01 2.836265e+01 2.681690e-01 9.545257e-03 3.458700e+01 3.599618e+01 9 6 22292 24 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.094476036894726 Dual Gap (relative): 0.00954525680272809 Search Statistics. Total number of nodes processed: 1245 Total number of lmo calls: 22292 Total time (s): 34.588 LMO calls / sec: 644.5009829998843 Nodes / sec: 35.995142824100846 LMO calls / node: 17.905220883534138 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2107 Local tightenings / node: 1.78 Total number of potential local tightenings: 4628 Decisions made: [(64, 1), (515, 0), (42, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.096902e-03 3.396650e+01 3.397560e+01 Inf 3.240000e-01 9.259259e+00 321 51 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 5.600000e-01 1.607143e+01 76 33 190 716 27 23 * 41 42 7.799037e+00 3.091302e+01 2.311398e+01 2.963697e+00 2.993000e+00 2.773137e+01 52 26 1455 390 22 17 * 92 93 1.170702e+01 2.836265e+01 1.665563e+01 1.422704e+00 5.571000e+00 3.320768e+01 33 18 3015 207 18 19 100 101 1.282440e+01 2.836265e+01 1.553825e+01 1.211616e+00 5.924000e+00 3.392978e+01 27 14 3231 145 14 17 200 199 1.650157e+01 2.836265e+01 1.186107e+01 7.187845e-01 1.051900e+01 3.793136e+01 49 20 6078 243 20 15 300 289 1.874458e+01 2.836265e+01 9.618061e+00 5.131115e-01 1.445100e+01 4.075843e+01 18 9 8712 124 11 12 400 373 2.066733e+01 2.836265e+01 7.695319e+00 3.723422e-01 1.869300e+01 4.135238e+01 59 23 11267 667 24 10 500 419 2.226436e+01 2.836265e+01 6.098283e+00 2.739033e-01 2.181400e+01 4.212891e+01 37 15 13413 350 17 14 600 443 2.341183e+01 2.836265e+01 4.950814e+00 2.114663e-01 2.468900e+01 4.224553e+01 30 15 15441 241 15 15 700 441 2.431555e+01 2.836265e+01 4.047099e+00 1.664408e-01 2.717300e+01 4.199021e+01 30 16 17232 180 17 8 800 407 2.514205e+01 2.836265e+01 3.220593e+00 1.280959e-01 2.907400e+01 4.151476e+01 9 5 18703 29 0 0 900 347 2.603002e+01 2.836265e+01 2.332629e+00 8.961304e-02 3.060600e+01 4.074365e+01 9 6 19955 21 0 0 1000 265 2.662238e+01 2.836265e+01 1.740263e+00 6.536843e-02 3.188200e+01 3.967756e+01 7 5 20987 16 0 0 1100 177 2.729469e+01 2.836265e+01 1.067956e+00 3.912689e-02 3.285600e+01 3.886657e+01 17 14 21858 9 0 0 1200 87 2.790452e+01 2.836265e+01 4.581290e-01 1.641774e-02 3.373400e+01 3.815142e+01 10 6 22649 36 0 0 1235 54 2.810142e+01 2.836265e+01 2.612300e-01 9.295973e-03 3.402600e+01 3.788280e+01 7 4 22906 14 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.101415017663985 Dual Gap (relative): 0.00929597344392755 Search Statistics. Total number of nodes processed: 1289 Total number of lmo calls: 22906 Total time (s): 34.027 LMO calls / sec: 673.1713051400359 Nodes / sec: 37.88168219355218 LMO calls / node: 17.770364623739333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2118 Local tightenings / node: 1.71 Total number of potential local tightenings: 4546 Decisions made: [(75, 0), (546, 0), (23, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.096902e-03 3.396650e+01 3.397560e+01 Inf 3.160000e-01 9.493671e+00 314 47 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 5.330000e-01 1.688555e+01 70 30 190 716 27 23 * 41 42 7.799037e+00 3.091302e+01 2.311398e+01 2.963697e+00 2.680000e+00 3.097015e+01 61 25 1455 390 22 17 * 92 93 1.170702e+01 2.836265e+01 1.665563e+01 1.422704e+00 5.144000e+00 3.596423e+01 31 17 3015 207 18 19 100 101 1.282440e+01 2.836265e+01 1.553825e+01 1.211616e+00 5.474000e+00 3.671904e+01 23 12 3231 145 14 17 200 199 1.635766e+01 2.836265e+01 1.200499e+01 7.339062e-01 9.127000e+00 4.371645e+01 17 8 6077 257 15 17 300 291 1.884254e+01 2.836265e+01 9.520102e+00 5.052451e-01 1.209500e+01 4.886317e+01 67 19 8750 1638 22 18 400 375 2.047418e+01 2.836265e+01 7.888461e+00 3.852881e-01 1.587000e+01 4.883428e+01 30 14 11287 279 15 10 500 437 2.215659e+01 2.836265e+01 6.206055e+00 2.800997e-01 1.910400e+01 4.904732e+01 28 16 13524 141 15 11 600 465 2.327139e+01 2.836265e+01 5.091258e+00 2.187776e-01 2.226000e+01 4.784367e+01 8 5 15617 17 0 0 700 465 2.412128e+01 2.836265e+01 4.241363e+00 1.758349e-01 2.488800e+01 4.680971e+01 10 6 17459 26 0 0 800 431 2.498070e+01 2.836265e+01 3.381947e+00 1.353824e-01 2.675400e+01 4.601181e+01 13 7 18921 56 0 0 900 377 2.577073e+01 2.836265e+01 2.591918e+00 1.005761e-01 2.844900e+01 4.488734e+01 5 3 20219 12 0 0 1000 309 2.659624e+01 2.836265e+01 1.766402e+00 6.641549e-02 2.983400e+01 4.387611e+01 11 7 21313 32 0 0 1100 217 2.708970e+01 2.836265e+01 1.272941e+00 4.698984e-02 3.087700e+01 4.265311e+01 10 5 22209 26 0 0 1200 123 2.755926e+01 2.836265e+01 8.033871e-01 2.915126e-02 3.182000e+01 4.157762e+01 12 7 23031 43 0 0 1287 40 2.810253e+01 2.836265e+01 2.601141e-01 9.255896e-03 3.259100e+01 4.071676e+01 8 5 23690 24 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.10253092821363 Dual Gap (relative): 0.009255895771658262 Search Statistics. Total number of nodes processed: 1327 Total number of lmo calls: 23690 Total time (s): 32.592 LMO calls / sec: 726.8654884634267 Nodes / sec: 40.715513009327445 LMO calls / node: 17.852298417483045 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2169 Local tightenings / node: 1.69 Total number of potential local tightenings: 4697 Decisions made: [(70, 1), (556, 0), (36, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["binary", "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.096902e-03 3.396650e+01 3.397560e+01 Inf 3.620000e-01 8.287293e+00 337 48 60 5824 38 8 * 4 5 4.071586e-01 3.102006e+01 3.061290e+01 7.518668e+01 5.950000e-01 1.512605e+01 77 34 190 716 27 23 * 38 39 8.272897e+00 2.977156e+01 2.149867e+01 2.598687e+00 2.664000e+00 2.890390e+01 43 20 1349 341 18 13 * 92 93 1.272822e+01 2.929131e+01 1.656308e+01 1.301288e+00 5.398000e+00 3.427195e+01 46 18 2995 515 19 23 100 101 1.300691e+01 2.929131e+01 1.628440e+01 1.251980e+00 5.814000e+00 3.457172e+01 58 25 3246 534 24 21 * 108 109 1.349880e+01 2.836265e+01 1.486385e+01 1.101124e+00 6.213000e+00 3.492677e+01 60 18 3482 496 17 25 200 199 1.683539e+01 2.836265e+01 1.152726e+01 6.847042e-01 1.044500e+01 3.820010e+01 52 25 6090 422 22 8 300 285 1.916384e+01 2.836265e+01 9.198805e+00 4.800084e-01 1.455100e+01 4.020342e+01 27 15 8765 161 16 14 400 347 2.080717e+01 2.836265e+01 7.555472e+00 3.631186e-01 1.813800e+01 4.118425e+01 41 19 11190 317 17 16 500 397 2.247807e+01 2.836265e+01 5.884574e+00 2.617917e-01 2.140000e+01 4.191589e+01 22 13 13383 94 0 0 600 405 2.367463e+01 2.836265e+01 4.688018e+00 1.980187e-01 2.417700e+01 4.156843e+01 16 9 15216 59 0 0 700 411 2.456624e+01 2.836265e+01 3.796404e+00 1.545374e-01 2.686900e+01 4.134877e+01 24 13 17024 135 9 14 800 359 2.545381e+01 2.836265e+01 2.908838e+00 1.142791e-01 2.862900e+01 4.048343e+01 5 3 18345 13 0 0 900 295 2.617567e+01 2.836265e+01 2.186971e+00 8.354974e-02 3.030300e+01 3.943504e+01 5 3 19585 6 0 0 1000 221 2.692456e+01 2.836265e+01 1.438080e+00 5.341147e-02 3.173400e+01 3.847608e+01 5 3 20681 9 0 0 1100 131 2.764009e+01 2.836265e+01 7.225542e-01 2.614153e-02 3.278300e+01 3.754995e+01 11 6 21524 27 0 0 1177 56 2.809448e+01 2.836265e+01 2.681690e-01 9.545257e-03 3.354100e+01 3.676098e+01 9 6 22127 22 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.094476036894726 Dual Gap (relative): 0.00954525680272809 Search Statistics. Total number of nodes processed: 1233 Total number of lmo calls: 22127 Total time (s): 33.542 LMO calls / sec: 659.6804006916701 Nodes / sec: 36.759883131596204 LMO calls / node: 17.94566098945661 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2087 Local tightenings / node: 1.77 Total number of potential local tightenings: 4579 Decisions made: [(1, 0), (65, 0), (516, 0), (34, 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: 10 Number of integer variables: 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.308429e-03 1.000000e-01 1.033084e-01 Inf 1.101000e+01 2.724796e-01 4077 35 19 41 9 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#163", var"#grad!#164", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 13 0 1.000000e-01 1.000000e-01 0.000000e+00 0.000000e+00 1.335900e+01 9.731267e-01 11 8 180 15 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.1 Dual Bound: 0.1 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 180 Total time (s): 14.052 LMO calls / sec: 12.809564474807857 Nodes / sec: 0.9251352120694564 LMO calls / node: 13.846153846153847 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 8 Local tightenings / node: 0.62 Total number of potential local tightenings: 8 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hybrid 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: 10 Number of integer variables: 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.308429e-03 1.000000e-01 1.033084e-01 Inf 1.161100e+01 2.583757e-01 4309 47 19 41 9 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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#165", var"#grad!#166", 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 13 0 1.000000e-01 1.000000e-01 0.000000e+00 0.000000e+00 1.256500e+01 1.034620e+00 13 9 180 15 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.1 Dual Bound: 0.1 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 180 Total time (s): 13.163 LMO calls / sec: 13.674694218643166 Nodes / sec: 0.9876168046797842 LMO calls / node: 13.846153846153847 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 8 Local tightenings / node: 0.62 Total number of potential local tightenings: 8 HiGHS Example 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: 6 Number of integer variables: 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 0.000000e+00 7.500000e-01 7.500000e-01 Inf 1.019300e+01 2.943196e-01 3612 2 4 2 2 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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{typeof(Main.anonymous.f), typeof(Main.anonymous.grad!), Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{HiGHS.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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 100 27 6.250000e-01 7.500000e-01 1.250000e-01 2.000000e-01 1.129400e+01 1.124491e+01 0 1 326 0 0 0 127 0 7.500000e-01 7.500000e-01 0.000000e+00 0.000000e+00 1.197300e+01 1.060720e+01 1 1 380 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.75 Dual Bound: 0.75 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 127 Total number of lmo calls: 380 Total time (s): 12.592 LMO calls / sec: 30.177890724269375 Nodes / sec: 10.08576874205845 LMO calls / node: 2.9921259842519685 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 Approximate Planted Point Example seed = 0x37d46f2e1b215b2e 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.332268e-16 6.600000e-01 6.600000e-01 Inf 1.003600e+01 2.989239e-01 4095 7 7 10 3 0 100 43 5.597220e-01 6.600000e-01 1.002780e-01 1.791569e-01 1.072600e+01 1.333209e+01 4 3 581 2 3 0 189 2 6.550000e-01 6.600000e-01 5.000000e-03 7.633588e-03 1.126200e+01 1.695969e+01 7 4 1047 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.66 Dual Bound: 0.655 Dual Gap (relative): 0.007633587786259549 Search Statistics. Total number of nodes processed: 191 Total number of lmo calls: 1047 Total time (s): 11.885 LMO calls / sec: 88.09423643247791 Nodes / sec: 16.070677324358435 LMO calls / node: 5.481675392670157 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: 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.332268e-16 6.600000e-01 6.600000e-01 Inf 1.026200e+01 2.923407e-01 3669 0 7 10 3 0 100 43 5.597220e-01 6.600000e-01 1.002780e-01 1.791569e-01 1.029900e+01 1.388484e+01 1 0 581 2 3 0 189 2 6.550000e-01 6.600000e-01 5.000000e-03 7.633588e-03 1.031700e+01 1.851313e+01 0 0 1047 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.66 Dual Bound: 0.655 Dual Gap (relative): 0.007633587786259549 Search Statistics. Total number of nodes processed: 191 Total number of lmo calls: 1047 Total time (s): 10.929 LMO calls / sec: 95.80016469942355 Nodes / sec: 17.476438832464087 LMO calls / node: 5.481675392670157 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: 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.332268e-16 6.600000e-01 6.600000e-01 Inf 9.157000e+00 3.276182e-01 3361 0 7 10 3 0 100 43 5.597220e-01 6.600000e-01 1.002780e-01 1.791569e-01 9.194000e+00 1.555362e+01 0 0 581 2 3 0 189 2 6.550000e-01 6.600000e-01 5.000000e-03 7.633588e-03 9.213000e+00 2.073157e+01 0 0 1047 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.66 Dual Bound: 0.655 Dual Gap (relative): 0.007633587786259549 Search Statistics. Total number of nodes processed: 191 Total number of lmo calls: 1047 Total time (s): 9.796 LMO calls / sec: 106.88035933033892 Nodes / sec: 19.49775418538179 LMO calls / node: 5.481675392670157 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: 20 Number of integer variables: 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.332268e-16 2.350000e-01 2.350000e-01 Inf 9.578000e+00 3.132178e-01 3724 5 7 10 3 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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{Main.anonymous.var"#f#7", Main.anonymous.var"#grad!#9", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 15 0 2.350000e-01 2.350000e-01 0.000000e+00 0.000000e+00 9.708000e+00 1.545117e+00 5 3 84 7 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 2.260000e+00 -4.040000e+00 6.300000e+00 0.000000e+00 Inf 1 LD 2 7.334615e-01 -9.280769e-01 1.661538e+00 8.297286e-02 2.410427e+01 2 LD 5 2.431819e-01 1.416688e-01 1.015131e-01 2.193493e-01 2.279470e+01 3 LD 12 2.350000e-01 2.350000e-01 1.110223e-16 2.214166e-01 5.419648e+01 3 Last 12 2.350000e-01 2.350000e-01 1.110223e-16 2.237919e-01 5.362124e+01 3 ---------------------------------------------------------------------------------------------------------------- PP 12 2.350000e-01 2.350000e-01 1.110223e-16 2.250573e-01 5.331975e+01 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.235 Dual Bound: 0.235 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 92 Total time (s): 11.105 LMO calls / sec: 8.284556506078342 Nodes / sec: 1.3507429085997298 LMO calls / node: 6.133333333333334 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: 20 Number of integer variables: 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 -4.366204e-03 5.365015e-06 4.371569e-03 Inf 8.580000e+00 1.165501e-01 3256 0 11 26 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{Main.anonymous.CubeBLMO, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 2.025000e+00 -4.275000e+00 6.300000e+00 0.000000e+00 Inf 1 LD 2 4.984615e-01 -1.163077e+00 1.661538e+00 8.509512e-02 2.350311e+01 2 LD 5 8.181882e-03 -9.333120e-02 1.015131e-01 2.282222e-01 2.190848e+01 3 LD 12 1.779439e-04 -1.273524e-02 1.291318e-02 2.293168e-01 5.232936e+01 3 LD 17 2.465190e-32 -3.941292e-16 3.941292e-16 2.298204e-01 7.397081e+01 3 Last 17 3.851860e-32 -3.941292e-16 3.941292e-16 2.301962e-01 7.385005e+01 3 ---------------------------------------------------------------------------------------------------------------- PP 17 3.851860e-32 -3.941292e-16 3.941292e-16 2.305791e-01 7.372741e+01 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 3.8518598887744717e-32 Dual Bound: -3.941291737419305e-16 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 20 Total time (s): 10.085 LMO calls / sec: 1.9831432821021318 Nodes / sec: 0.09915716410510658 LMO calls / node: 20.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: 20 Number of integer variables: 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 -4.366204e-03 5.365015e-06 4.371569e-03 Inf 9.082000e+00 1.101079e-01 3240 0 11 26 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{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 2.025000e+00 -4.275000e+00 6.300000e+00 0.000000e+00 Inf 1 LD 2 4.984615e-01 -1.163077e+00 1.661538e+00 8.009078e-02 2.497166e+01 2 LD 5 8.181882e-03 -9.333120e-02 1.015131e-01 2.206700e-01 2.265826e+01 3 LD 12 1.779439e-04 -1.273524e-02 1.291318e-02 2.216333e-01 5.414348e+01 3 LD 17 2.465190e-32 -3.941292e-16 3.941292e-16 2.221513e-01 7.652442e+01 3 Last 17 3.851860e-32 -3.941292e-16 3.941292e-16 2.225023e-01 7.640370e+01 3 ---------------------------------------------------------------------------------------------------------------- PP 17 3.851860e-32 -3.941292e-16 3.941292e-16 2.228578e-01 7.628183e+01 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 3.8518598887744717e-32 Dual Bound: -3.941291737419305e-16 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 20 Total time (s): 10.534 LMO calls / sec: 1.8986140117714068 Nodes / sec: 0.09493070058857034 LMO calls / node: 20.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 Big Float Example seed = 0x90bf6d4ee04f8aa6 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: 200 Number of integer variables: 200 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.706382e-03 5.600000e+00 5.602706e+00 Inf 1.294300e+01 2.317855e-01 4364 1000 12 0 3 0 100 101 5.593140e-01 5.600000e+00 5.040686e+00 9.012265e+00 1.520300e+01 1.322107e+01 3 0 865 0 3 0 200 201 6.692264e-01 5.600000e+00 4.930774e+00 7.367870e+00 1.757900e+01 2.281131e+01 3 0 1721 0 3 0 300 301 7.398761e-01 5.600000e+00 4.860124e+00 6.568835e+00 2.010700e+01 2.989009e+01 3 0 2591 2 3 0 400 401 8.039512e-01 5.600000e+00 4.796049e+00 5.965597e+00 2.265400e+01 3.535799e+01 4 0 3482 0 3 0 500 501 8.298997e-01 5.600000e+00 4.770100e+00 5.747804e+00 2.524400e+01 3.965299e+01 11 1000 4352 0 3 0 600 601 8.498143e-01 5.600000e+00 4.750186e+00 5.589675e+00 2.793100e+01 4.299882e+01 3 0 5246 2 3 0 700 701 8.944228e-01 5.600000e+00 4.705577e+00 5.261021e+00 3.054800e+01 4.586225e+01 4 0 6128 0 3 0 800 801 9.132458e-01 5.600000e+00 4.686754e+00 5.131974e+00 3.328600e+01 4.809830e+01 3 0 7009 0 3 0 900 901 9.393144e-01 5.600000e+00 4.660686e+00 4.961795e+00 3.594400e+01 5.010572e+01 6 0 7913 0 3 0 1000 1001 9.398761e-01 5.600000e+00 4.660124e+00 4.958232e+00 3.716700e+01 5.383808e+01 3 0 8659 0 3 0 1100 1101 9.594084e-01 5.600000e+00 4.640592e+00 4.836930e+00 3.933700e+01 5.595241e+01 4 0 9507 2 3 0 1200 1201 9.847655e-01 5.600000e+00 4.615235e+00 4.686633e+00 4.203900e+01 5.711363e+01 3 0 10396 0 3 0 1300 1301 9.849193e-01 5.600000e+00 4.615081e+00 4.685745e+00 4.479100e+01 5.806970e+01 3 1000 11288 0 3 0 1400 1401 1.004526e+00 5.600000e+00 4.595474e+00 4.574769e+00 4.743800e+01 5.904549e+01 3 1000 12170 0 3 0 1500 1501 1.004765e+00 5.600000e+00 4.595235e+00 4.573441e+00 5.025700e+01 5.971307e+01 4 0 13046 2 3 0 1600 1601 1.029876e+00 5.600000e+00 4.570124e+00 4.437547e+00 5.292500e+01 6.048181e+01 3 0 13791 2 3 0 1700 1701 1.029935e+00 5.600000e+00 4.570065e+00 4.437236e+00 5.571900e+01 6.103842e+01 3 0 14541 2 3 0 1800 1801 1.049451e+00 5.600000e+00 4.550549e+00 4.336125e+00 5.846800e+01 6.158925e+01 3 0 15292 2 3 0 1855 1856 1.049765e+00 5.600000e+00 4.550235e+00 4.334525e+00 6.000200e+01 6.184794e+01 25 0 15706 20 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 5.600000000000000371924713249427783395223523085470043918139073896680143332948987 Dual Bound: 1.049765364517307 Dual Gap (relative): 4.334525398992314911569187608887006291323371034782816527726537689511205132314794 Search Statistics. Total number of nodes processed: 3711 LMO calls over all nodes: 15706 LMO calls in the heuristics: 2095 Total number of lmo calls: 17801 Total time (s): 60.822 LMO calls / sec: 258.2289303212653 Nodes / sec: 61.014106737693595 LMO calls / node: 4.23228240366478 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: 200 Number of integer variables: 200 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.706382e-03 5.600000e+00 5.602706e+00 Inf 1.262100e+01 2.376991e-01 4122 0 12 0 3 0 100 101 5.593140e-01 5.600000e+00 5.040686e+00 9.012265e+00 1.344200e+01 1.495313e+01 1 0 870 0 3 0 200 201 6.692264e-01 5.600000e+00 4.930774e+00 7.367870e+00 1.416500e+01 2.830921e+01 1 0 1725 0 3 0 300 301 7.398761e-01 5.600000e+00 4.860124e+00 6.568835e+00 1.493300e+01 4.024643e+01 2 0 2596 2 3 0 400 401 8.039512e-01 5.600000e+00 4.796049e+00 5.965597e+00 1.570000e+01 5.101911e+01 1 1000 3487 0 3 0 500 501 8.298997e-01 5.600000e+00 4.770100e+00 5.747804e+00 1.649400e+01 6.068874e+01 1 1000 4359 0 3 0 600 601 8.498143e-01 5.600000e+00 4.750186e+00 5.589675e+00 1.731500e+01 6.936183e+01 1 0 5253 2 3 0 700 701 8.944509e-01 5.600000e+00 4.705549e+00 5.260825e+00 1.812800e+01 7.728376e+01 1 0 6135 0 3 0 800 801 9.132458e-01 5.600000e+00 4.686754e+00 5.131974e+00 1.899200e+01 8.429865e+01 1 0 7016 0 3 0 900 901 9.394509e-01 5.600000e+00 4.660549e+00 4.960929e+00 1.981300e+01 9.089991e+01 1 1000 7913 0 3 0 1000 1001 9.398761e-01 5.600000e+00 4.660124e+00 4.958232e+00 2.026300e+01 9.875142e+01 1 0 8655 0 3 0 1100 1101 9.594084e-01 5.600000e+00 4.640592e+00 4.836930e+00 2.098000e+01 1.049094e+02 1 0 9503 2 3 0 1200 1201 9.847625e-01 5.600000e+00 4.615238e+00 4.686651e+00 2.184300e+01 1.099208e+02 1 1000 10392 0 3 0 1300 1301 9.849260e-01 5.600000e+00 4.615074e+00 4.685706e+00 2.275100e+01 1.143246e+02 1 1000 11284 0 3 0 1400 1401 1.004526e+00 5.600000e+00 4.595474e+00 4.574769e+00 2.459400e+01 1.138896e+02 1 0 12167 0 3 0 1500 1501 1.004765e+00 5.600000e+00 4.595235e+00 4.573441e+00 2.556700e+01 1.173779e+02 1 0 13055 0 3 0 1600 1601 1.029876e+00 5.600000e+00 4.570124e+00 4.437547e+00 2.653000e+01 1.206559e+02 1 1000 13937 2 3 0 1700 1701 1.029935e+00 5.600000e+00 4.570065e+00 4.437236e+00 2.750800e+01 1.236368e+02 1 0 14815 0 3 0 1800 1801 1.049451e+00 5.600000e+00 4.550549e+00 4.336125e+00 2.848300e+01 1.264263e+02 1 0 15710 0 3 0 1900 1901 1.049780e+00 5.600000e+00 4.550220e+00 4.334450e+00 2.944900e+01 1.290706e+02 1 0 16584 0 3 0 2000 2001 1.054951e+00 5.600000e+00 4.545049e+00 4.308303e+00 3.045100e+01 1.313914e+02 1 0 17457 2 3 0 2100 2101 1.074867e+00 5.600000e+00 4.525133e+00 4.209949e+00 3.147200e+01 1.334837e+02 1 0 18335 0 3 0 2200 2201 1.074935e+00 5.600000e+00 4.525065e+00 4.209617e+00 3.253400e+01 1.352739e+02 1 1000 19221 2 3 0 2300 2301 1.094451e+00 5.600000e+00 4.505549e+00 4.116721e+00 3.360800e+01 1.369019e+02 1 1000 20109 2 3 0 2400 2401 1.094684e+00 5.600000e+00 4.505316e+00 4.115631e+00 3.466500e+01 1.384970e+02 2 0 20997 2 3 0 2500 2501 1.094814e+00 5.600000e+00 4.505186e+00 4.115022e+00 3.574400e+01 1.399116e+02 1 0 21891 2 3 0 2600 2601 1.099946e+00 5.600000e+00 4.500054e+00 4.091161e+00 3.684500e+01 1.411589e+02 1 0 22805 0 3 0 2700 2701 1.119763e+00 5.600000e+00 4.480237e+00 4.001060e+00 3.790600e+01 1.424840e+02 2 1000 23707 0 3 0 2800 2801 1.119917e+00 5.600000e+00 4.480083e+00 4.000369e+00 3.901400e+01 1.435638e+02 1 0 24606 0 3 0 2900 2901 1.119955e+00 5.600000e+00 4.480045e+00 4.000200e+00 4.011000e+01 1.446273e+02 1 1000 25494 0 3 0 3000 3001 1.139762e+00 5.600000e+00 4.460238e+00 3.913305e+00 4.103800e+01 1.462303e+02 1 0 26339 0 3 0 3100 3101 1.139814e+00 5.600000e+00 4.460186e+00 3.913081e+00 4.184100e+01 1.482039e+02 1 1000 27102 0 3 0 3200 3201 1.139830e+00 5.600000e+00 4.460170e+00 3.913012e+00 4.273300e+01 1.497906e+02 1 0 27913 0 3 0 3300 3301 1.139876e+00 5.600000e+00 4.460124e+00 3.912815e+00 4.349600e+01 1.517611e+02 1 0 28672 0 3 0 3400 3401 1.144951e+00 5.600000e+00 4.455049e+00 3.891039e+00 4.448400e+01 1.528864e+02 1 0 29492 0 3 0 3500 3501 1.159400e+00 5.600000e+00 4.440600e+00 3.830083e+00 4.563500e+01 1.534130e+02 1 0 30386 2 3 0 3600 3601 1.164876e+00 5.600000e+00 4.435124e+00 3.807378e+00 4.678300e+01 1.539234e+02 1 0 31282 2 3 0 3700 3701 1.164935e+00 5.600000e+00 4.435065e+00 3.807135e+00 4.794800e+01 1.543547e+02 1 0 32184 0 3 0 3800 3801 1.164956e+00 5.600000e+00 4.435044e+00 3.807047e+00 4.913100e+01 1.547088e+02 1 1000 33076 0 3 0 3900 3901 1.184765e+00 5.600000e+00 4.415235e+00 3.726674e+00 5.033700e+01 1.549755e+02 1 0 33951 2 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 4000 4001 1.184876e+00 5.600000e+00 4.415124e+00 3.726232e+00 5.145200e+01 1.555042e+02 1 0 34701 2 3 0 4100 4101 1.184914e+00 5.600000e+00 4.415086e+00 3.726082e+00 5.263800e+01 1.558000e+02 1 1000 35451 2 3 0 4200 4201 1.184933e+00 5.600000e+00 4.415067e+00 3.726004e+00 5.386600e+01 1.559611e+02 1 0 36201 2 3 0 4300 4301 1.185000e+00 5.600000e+00 4.415000e+00 3.725738e+00 5.505000e+01 1.562398e+02 1 0 36951 2 3 0 4400 4401 1.185000e+00 5.600000e+00 4.415000e+00 3.725738e+00 5.629000e+01 1.563510e+02 1 0 37701 2 3 0 4500 4501 1.204526e+00 5.600000e+00 4.395474e+00 3.649132e+00 5.758100e+01 1.563189e+02 1 0 38466 2 3 0 4600 4601 1.204526e+00 5.600000e+00 4.395474e+00 3.649132e+00 5.878000e+01 1.565328e+02 1 0 39216 2 3 0 4700 4701 1.209835e+00 5.600000e+00 4.390165e+00 3.628730e+00 6.000600e+01 1.566677e+02 1 0 39966 2 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 5.60000000000000037192471324942791436 Dual Bound: 1.209835155000961 Dual Gap (relative): 3.62872977103690824625541776123281890 Search Statistics. Total number of nodes processed: 9401 LMO calls over all nodes: 39966 LMO calls in the heuristics: 5448 Total number of lmo calls: 45414 Total time (s): 60.679 LMO calls / sec: 658.646319154897 Nodes / sec: 154.9300416948203 LMO calls / node: 4.251249867035422 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 Birkhoff Decomposition Example seed = 0x00160c5c80e6b028 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: 38 Number of integer variables: 18 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 -6.251067e-03 4.878463e-01 4.940974e-01 Inf 1.617700e+01 1.854485e-01 9886 2141 13 56 6 1 * 3 4 -3.836271e-03 3.110278e-01 3.148641e-01 Inf 1.812500e+01 3.862069e-01 203 156 38 39 6 3 * 9 10 -5.559860e-04 2.186239e-01 2.191798e-01 Inf 1.955300e+01 9.717179e-01 78 58 104 50 8 0 * 16 13 -5.559860e-04 1.569199e-01 1.574759e-01 Inf 2.035500e+01 1.522967e+00 142 108 170 84 9 4 * 19 12 -5.559860e-04 1.391803e-01 1.397363e-01 Inf 2.061700e+01 1.794635e+00 21 13 199 24 4 3 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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{typeof(Main.anonymous.f), typeof(Main.anonymous.grad!), 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 * 27 8 1.129875e-01 1.391452e-01 2.615773e-02 2.315100e-01 2.090400e+01 1.961347e+00 5 3 245 2 0 0 * 32 3 1.138496e-01 1.391452e-01 2.529567e-02 2.221850e-01 2.098900e+01 1.953404e+00 5 3 269 2 0 0 35 0 1.391452e-01 1.391452e-01 0.000000e+00 0.000000e+00 2.103900e+01 1.948762e+00 24 16 284 14 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.994318e-01 -2.121071e+00 3.020503e+00 0.000000e+00 Inf 1 LD 2 1.391452e-01 1.391452e-01 2.220446e-16 8.323840e-02 2.402737e+01 2 Last 2 1.391452e-01 1.391452e-01 2.220446e-16 1.708814e-01 1.170402e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 2 1.391452e-01 1.391452e-01 2.220446e-16 1.729331e-01 1.156517e+01 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.13914523909697368 Dual Bound: 0.13914523909697368 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 41 Total number of lmo calls: 289 Total time (s): 22.461 LMO calls / sec: 12.866746805574108 Nodes / sec: 1.8253862250122435 LMO calls / node: 7.048780487804878 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: Decompostion-Invariant-Frank-Wolfe Line Search Method: Secant Lazification: false 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: 38 Number of integer variables: 18 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.705378e-02 4.075065e-01 4.245603e-01 Inf 3.900000e+00 7.692308e-01 3739 1169 25 12 1 0 * 2 3 -1.705378e-02 2.583228e-01 2.753766e-01 Inf 5.422000e+00 9.221689e-01 1519 1142 64 19 1 0 * 13 12 -4.540477e-03 1.391803e-01 1.437207e-01 Inf 1.578600e+01 1.710376e+00 406 81 563 20 1 0 * 17 12 2.437851e-02 1.391452e-01 1.147667e-01 4.707702e+00 1.708100e+01 1.814882e+00 34 5 659 2 0 0 35 0 1.225225e-01 1.391452e-01 1.662271e-02 1.356706e-01 1.906600e+01 1.940627e+00 40 5 859 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: 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 ------------------------------------------------------------------------------------------------- I 1 8.789287e-01 -2.100568e+00 2.979497e+00 0.000000e+00 Inf LD 3 1.391452e-01 1.391452e-01 1.110223e-16 2.553627e+00 1.174799e+00 Last 3 1.391452e-01 1.391452e-01 1.110223e-16 2.577771e+00 1.163796e+00 ------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.13914523909697366 Dual Bound: 0.12252253277714084 Dual Gap (relative): 0.13567060640240153 Search Statistics. Total number of nodes processed: 37 Total number of lmo calls: 867 Total time (s): 22.089 LMO calls / sec: 39.25030558196388 Nodes / sec: 1.6750418760469012 LMO calls / node: 23.43243243243243 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: 38 Number of integer variables: 18 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 -6.251067e-03 4.878463e-01 4.940974e-01 Inf 2.311000e+00 1.298139e+00 2152 2127 13 56 6 1 * 3 4 -3.836271e-03 3.110278e-01 3.148641e-01 Inf 4.220000e+00 1.658768e+00 161 141 38 39 6 3 * 9 10 -5.559860e-04 2.186239e-01 2.191798e-01 Inf 5.266000e+00 3.608052e+00 56 43 104 50 8 0 * 16 13 -5.559860e-04 1.569199e-01 1.574759e-01 Inf 5.890000e+00 5.263158e+00 97 77 170 84 9 4 * 19 12 -5.559860e-04 1.391803e-01 1.397363e-01 Inf 6.104000e+00 6.061599e+00 16 10 199 24 4 3 * 27 8 1.129875e-01 1.391452e-01 2.615773e-02 2.315100e-01 6.290000e+00 6.518283e+00 4 2 245 2 0 0 * 32 3 1.138496e-01 1.391452e-01 2.529567e-02 2.221850e-01 6.369000e+00 6.437431e+00 6 3 269 2 0 0 35 0 1.391452e-01 1.391452e-01 0.000000e+00 0.000000e+00 6.409000e+00 6.397254e+00 15 11 284 14 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.994318e-01 -2.121071e+00 3.020503e+00 0.000000e+00 Inf 1 LD 2 1.391452e-01 1.391452e-01 2.220446e-16 1.012131e-03 1.976029e+03 2 Last 2 1.391452e-01 1.391452e-01 2.220446e-16 4.474048e-03 4.470225e+02 2 ---------------------------------------------------------------------------------------------------------------- PP 2 1.391452e-01 1.391452e-01 2.220446e-16 6.319701e-03 3.164707e+02 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.13914523909697368 Dual Bound: 0.13914523909697368 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 41 Total number of lmo calls: 289 Total time (s): 6.422 LMO calls / sec: 45.00155714730614 Nodes / sec: 6.384303955154158 LMO calls / node: 7.048780487804878 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: 38 Number of integer variables: 18 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 -6.251067e-03 4.878463e-01 4.940974e-01 Inf 3.824000e+00 7.845188e-01 2002 1976 13 56 6 1 * 2 3 -6.251067e-03 3.816559e-01 3.879070e-01 Inf 7.821000e+00 6.393044e-01 3509 3473 29 82 6 3 * 12 13 -1.262346e-03 2.821651e-01 2.834275e-01 Inf 1.375500e+01 1.817521e+00 87 57 141 83 8 1 * 25 6 1.128469e-01 1.391803e-01 2.633340e-02 2.333551e-01 1.700600e+01 2.528519e+00 23 14 231 26 4 2 * 28 3 1.132806e-01 1.391452e-01 2.586469e-02 2.283242e-01 1.711800e+01 2.511976e+00 4 3 246 2 0 0 31 0 1.144889e-01 1.391452e-01 2.465634e-02 2.153601e-01 1.715400e+01 2.506704e+00 7 4 257 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.994318e-01 -2.121071e+00 3.020503e+00 0.000000e+00 Inf 1 LD 2 1.391452e-01 1.391452e-01 2.220446e-16 1.298908e-03 1.539755e+03 2 Last 2 1.391452e-01 1.391452e-01 2.220446e-16 4.689746e-03 4.264623e+02 2 ---------------------------------------------------------------------------------------------------------------- PP 2 1.391452e-01 1.391452e-01 2.220446e-16 6.809556e-03 2.937049e+02 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.13914523909697366 Dual Bound: 0.11448889438141777 Dual Gap (relative): 0.21536014343377013 Search Statistics. Total number of nodes processed: 43 Total number of lmo calls: 262 Total time (s): 17.17 LMO calls / sec: 15.25917297612114 Nodes / sec: 2.50436808386721 LMO calls / node: 6.093023255813954 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 Documentation Example 01: Network Design Problem 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: 49 Number of integer variables: 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 8.388556e+00 8.390556e+00 2.000000e-03 2.384201e-04 1.111800e+01 8.994423e-02 3511 98 6 4 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{HiGHS.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.105922e+01 -6.292111e+00 1.735133e+01 0.000000e+00 Inf 1 LD 2 9.296813e+00 7.296296e+00 2.000518e+00 8.751370e-02 2.285356e+01 2 LD 4 8.390556e+00 8.388556e+00 2.000000e-03 2.233302e-01 1.791070e+01 1 LD 6 8.390555e+00 8.390555e+00 0.000000e+00 2.283703e-01 2.627312e+01 2 Last 6 8.390555e+00 8.390555e+00 0.000000e+00 2.308084e-01 2.599559e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 6 8.390555e+00 8.390555e+00 0.000000e+00 2.318928e-01 2.587403e+01 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 8.390555461910907 Dual Bound: 8.390555461910907 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 15 Total time (s): 12.782 LMO calls / sec: 1.173525269910812 Nodes / sec: 0.07823501799405413 LMO calls / node: 15.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: 1 x_moi = [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 1.0, 0.0, 0.0, 1.000187289299538, 0.0001872892995379294, 0.9998127107004621, 0.0, 0.9998127107004621, 0.0, 0.9998127107004621, 1.000187289299538, 1.0, 1.0, 0.0, 0.0, 1.000187289299538, 0.0001872892995379294, 0.9998127107004621, 0.0, 0.9998127107004621, 0.0, 0.9998127107004621, 1.000187289299538, 1.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: 49 Number of integer variables: 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 163 running 1 of 1 signal (10): User defined signal 1 _ZNK4llvm5Value11getMetadataEj at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) unknown function (ip: (nil)) ============================================================== Profile collected. A report will print at the next yield point ============================================================== * 1 2 1.089256e+01 1.105922e+01 1.666668e-01 1.530098e-02 1.111700e+01 2.698570e-01 4686 0 5 2135 2 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#36"{Boscia.var"#callback#33#37"{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{Main.anonymous.var"#f#13"{Main.anonymous.NetworkData, Vector{Float64}, Float64, Float64, Float64, Vector{Int64}, Int64, Int64, Int64}, Main.anonymous.var"#grad!#14"{Main.anonymous.NetworkData, Vector{Float64}, Float64, Float64, Float64, Vector{Int64}, Int64, Int64, Int64}, Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Main.anonymous.ShortestPathLMO}, 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 └ @ Boscia ~/.julia/packages/Boscia/PIUIk/src/callbacks.jl:252 3 0 1.105922e+01 1.105922e+01 0.000000e+00 0.000000e+00 1.791700e+01 1.674387e-01 0 0 9 0 0 0 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_wait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/epoll.c:236 uv_run at /workspace/srcdir/libuv/src/unix/core.c:400 ijl_task_get_next at /source/src/partr.c:478 poptask at ./task.jl:999 wait at ./task.jl:1008 #wait#647 at ./condition.jl:130 wait at ./condition.jl:125 [inlined] wait at ./process.jl:661 jfptr_wait_74856.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 subprocess_handler at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:2048 #130 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1992 withenv at ./env.jl:257 #117 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1840 with_temp_env at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1721 #115 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1810 #mktempdir#24 at ./file.jl:766 unknown function (ip: 0x7e14d84dbb00) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 mktempdir at ./file.jl:762 mktempdir at ./file.jl:762 [inlined] #sandbox#114 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1768 sandbox at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1759 unknown function (ip: 0x7e14d84d43f5) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 #test#127 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1971 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1915 [inlined] #test#146 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:444 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:423 unknown function (ip: 0x7e14d84d3ee0) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 #test#77 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:159 unknown function (ip: 0x7e14d84d37a0) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:148 #test#75 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] #test#74 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 [inlined] test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 unknown function (ip: 0x7e14d84cfe99) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 jl_apply at /source/src/julia.h:1982 [inlined] do_call at /source/src/interpreter.c:126 eval_value at /source/src/interpreter.c:223 eval_stmt_value at /source/src/interpreter.c:174 [inlined] eval_body at /source/src/interpreter.c:635 eval_body at /source/src/interpreter.c:544 eval_body at /source/src/interpreter.c:544 jl_interpret_toplevel_thunk at /source/src/interpreter.c:775 jl_toplevel_eval_flex at /source/src/toplevel.c:934 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] include_string at ./loading.jl:2149 _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 _include at ./loading.jl:2209 include at ./Base.jl:495 jfptr_include_46673.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 exec_options at ./client.jl:316 _start at ./client.jl:550 jfptr__start_83133.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 jl_apply at /source/src/julia.h:1982 [inlined] true_main at /source/src/jlapi.c:582 jl_repl_entrypoint at /source/src/jlapi.c:731 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7e14d9327249) __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) unknown function (ip: (nil)) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ 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.10/Profile/src/Profile.jl:1225 Overhead ╎ [+additional indent] Count File:Line; Function ========================================================= Thread 1 Task 0x00007e14cc5fc010 Total snapshots: 1. Utilization: 0% ╎1 @Base/client.jl:550; _start() ╎ 1 @Base/client.jl:316; exec_options(opts::Base.JLOptions) ╎ 1 @Base/Base.jl:495; include(mod::Module, _path::String) ╎ 1 @Base/loading.jl:2209; _include(mapexpr::Function, mod::Module, _path::S… ╎ 1 @Base/loading.jl:2149; include_string(mapexpr::typeof(identity), mod::M… ╎ 1 @Base/boot.jl:385; eval ╎ ╎ 1 @Pkg/src/API.jl:146; kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(… ╎ ╎ 1 @Pkg/src/API.jl:146; #test#74 ╎ ╎ 1 @Pkg/src/API.jl:147; test ╎ ╎ 1 @Pkg/src/API.jl:147; #test#75 ╎ ╎ 1 @Pkg/src/API.jl:148; kwcall(::@NamedTuple{julia_args::Cmd}, ::typ… ╎ ╎ ╎ 1 @Pkg/src/API.jl:159; test(pkgs::Vector{Pkg.Types.PackageSpec}; i… ╎ ╎ ╎ 1 @Pkg/src/API.jl:423; kwcall(::@NamedTuple{julia_args::Cmd, io::… ╎ ╎ ╎ 1 @Pkg/src/API.jl:444; test(ctx::Pkg.Types.Context, pkgs::Vector… ╎ ╎ ╎ 1 …/src/Operations.jl:1915; test ╎ ╎ ╎ 1 …src/Operations.jl:1971; test(ctx::Pkg.Types.Context, pkgs::… ╎ ╎ ╎ ╎ 1 …src/Operations.jl:1759; kwcall(::@NamedTuple{preferences::… ╎ ╎ ╎ ╎ 1 …src/Operations.jl:1768; sandbox(fn::Function, ctx::Pkg.Ty… ╎ ╎ ╎ ╎ 1 @Base/file.jl:762; mktempdir ╎ ╎ ╎ ╎ 1 @Base/file.jl:762; mktempdir(fn::Function, parent::Strin… ╎ ╎ ╎ ╎ 1 @Base/file.jl:766; mktempdir(fn::Pkg.Operations.var"#11… ╎ ╎ ╎ ╎ ╎ 1 …c/Operations.jl:1810; (::Pkg.Operations.var"#115#120"… ╎ ╎ ╎ ╎ ╎ 1 …c/Operations.jl:1721; with_temp_env(fn::Pkg.Operatio… ╎ ╎ ╎ ╎ ╎ 1 …/Operations.jl:1840; (::Pkg.Operations.var"#117#122… ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:257; withenv(::Pkg.Operations.var"#130… ╎ ╎ ╎ ╎ ╎ 1 …Operations.jl:1992; (::Pkg.Operations.var"#130#13… ╎ ╎ ╎ ╎ ╎ ╎ 1 …Operations.jl:2048; subprocess_handler(cmd::Cmd,… ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/process.jl:661; wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 1 …/condition.jl:125; wait ╎ ╎ ╎ ╎ ╎ ╎ 1 …condition.jl:130; wait(c::Base.GenericConditi… ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/task.jl:1008; wait() ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/task.jl:999; poptask(W::Base.IntrusiveL… [1] signal (15): Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_wait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/epoll.c:236 uv_run at /workspace/srcdir/libuv/src/unix/core.c:400 ijl_task_get_next at /source/src/partr.c:478 [163] signal (15): Terminated in expression starting at none:1 _ZNK4llvm6object13ELFObjectFileINS0_7ELFTypeILNS_7support10endiannessE1ELb1EEEE14moveSymbolNextERNS0_11DataRefImplE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) poptask at ./task.jl:999 jl_getDylibFunctionInfo at /source/src/debuginfo.cpp:1164 [inlined] jl_getFunctionInfo_impl at /source/src/debuginfo.cpp:1238 ijl_lookup_code_address at /source/src/stackwalk.c:593 wait at ./task.jl:1008 lookup at ./stacktraces.jl:108 _lookup_corrected at /source/usr/share/julia/stdlib/v1.10/Profile/src/Profile.jl:439 #8 at /source/usr/share/julia/stdlib/v1.10/Profile/src/Profile.jl:428 unknown function (ip: 0x7da9e8980612) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 jl_apply at /source/src/julia.h:1982 [inlined] start_task at /source/src/task.c:1253 unknown function (ip: (nil)) Allocations: 6294562419 (Pool: 6293182299; Big: 1380120); GC: 4975 #wait#647 at ./condition.jl:130 wait at ./condition.jl:125 [inlined] _trywait at ./asyncevent.jl:142 wait at ./asyncevent.jl:159 [inlined] profile_printing_listener at ./Base.jl:572 #1058 at ./Base.jl:608 jfptr_YY.1058_85352.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2878 [inlined] ijl_apply_generic at /source/src/gf.c:3079 jl_apply at /source/src/julia.h:1982 [inlined] start_task at /source/src/task.c:1253 unknown function (ip: (nil)) Allocations: 12866299 (Pool: 12828075; Big: 38224); GC: 10 PkgEval terminated after 2727.21s: test duration exceeded the time limit