@@ -128,6 +128,46 @@ struct HighsMipSolverData {
128128 implications(mipsolver),
129129 heuristics(mipsolver),
130130 objectiveFunction(mipsolver),
131+ presolve_status(HighsPresolveStatus::kNotSet ),
132+ cliquesExtracted(false ),
133+ rowMatrixSet(false ),
134+ analyticCenterComputed(false ),
135+ analyticCenterStatus(HighsModelStatus::kNotset ),
136+ detectSymmetries(false ),
137+ numRestarts(0 ),
138+ numRestartsRoot(0 ),
139+ numCliqueEntriesAfterPresolve(0 ),
140+ numCliqueEntriesAfterFirstPresolve(0 ),
141+ feastol(0.0 ),
142+ epsilon(0.0 ),
143+ heuristic_effort(0.0 ),
144+ dispfreq(0 ),
145+ firstlpsolobj(-kHighsInf ),
146+ rootlpsolobj(-kHighsInf ),
147+ numintegercols(0 ),
148+ maxTreeSizeLog2(0 ),
149+ pruned_treeweight(0 ),
150+ avgrootlpiters(0.0 ),
151+ last_disptime(0.0 ),
152+ firstrootlpiters(0 ),
153+ num_nodes(0 ),
154+ num_leaves(0 ),
155+ num_leaves_before_run(0 ),
156+ num_nodes_before_run(0 ),
157+ total_lp_iterations(0 ),
158+ heuristic_lp_iterations(0 ),
159+ sepa_lp_iterations(0 ),
160+ sb_lp_iterations(0 ),
161+ total_lp_iterations_before_run(0 ),
162+ heuristic_lp_iterations_before_run(0 ),
163+ sepa_lp_iterations_before_run(0 ),
164+ sb_lp_iterations_before_run(0 ),
165+ num_disp_lines(0 ),
166+ numImprovingSols(0 ),
167+ lower_bound(-kHighsInf ),
168+ upper_bound(kHighsInf ),
169+ upper_limit(kHighsInf ),
170+ optimality_limit(kHighsInf ),
131171 debugSolution(mipsolver) {
132172 domain.addCutpool (cutpool);
133173 domain.addConflictPool (conflictPool);
0 commit comments