Algorithms

Optimization time: local machine vs computer cluster Answered

• Pedro Zattoni Scroccaro
• July 21, 2021 16:43

1 vote 2 comments

How can Benders decomposition be faster then Gurobi? Answered

• Kai Zhang
• July 17, 2021 07:37

1 vote 6 comments

Worse performance for smaller problem Answered

• Danylo Lykov
• July 05, 2021 19:13

1 vote 5 comments

Speeding up Gurobi LP solver Ongoing

• Tobias Höschen
• June 01, 2021 13:24
• Edited

1 vote 9 comments

Parameters: Disconnected and Partition

• Leopold Kuttner
• May 26, 2021 16:17

1 vote 1 comment

same LP solution multiple times in root node, user cuts ignored

• Mario Ruthmair
• May 12, 2021 14:20

1 vote 2 comments

Astronomically low node throughput; major degeneracy? Answered

• Philip Taffet
• April 27, 2021 15:04

1 vote 3 comments

the time Answered

• hamzih alsmadi
• March 05, 2021 00:46
• Edited

1 vote 2 comments

Gurobi stopping criteria

• Dominique Orban
• February 01, 2021 22:45

1 vote 8 comments

Enumerate all vertices of polytope Answered

• Grigoris Velegkas
• January 06, 2021 08:29

1 vote 2 comments

Providing integer start solution drastically increases root relaxation computation time Answered

• Hendrik Weber
• November 17, 2020 19:03
• Edited

1 vote 8 comments

Advice on Cuts and Reducing Solution Time Ongoing

• William ONeill
• November 16, 2020 22:02

1 vote 2 comments

Implementation of Benders Decomposition with Callbacks Answered

• Pramesh Kumar
• November 16, 2020 20:26

1 vote 10 comments

Is it possible to get the value of the Interior Solution ? Ongoing

• Paul Maximilian Röhrig
• October 01, 2020 15:24

1 vote 4 comments

Lift and project cut Answered

• Tang Try
• September 14, 2020 01:22

1 vote 3 comments

Updating of Best Bound based on integrality of objective function value (due to integer coefficients and integer decision variables) Answered

• Hendrik Weber
• August 18, 2020 13:54
• Edited

1 vote 4 comments

Is it possible to use different time limits for each hierarchy when using lexicographic optimization?. Answered

• José Miguel Quesada Pérez
• August 17, 2020 12:59

1 vote 4 comments

Cannot find feasible solution and programm killed after a long time Answered

• susanta samanta
• July 16, 2020 14:38

1 vote 5 comments

Does Gurobi 9.0 guarantee global optimality for MICQP? Ongoing

• Jongeun Kim
• April 21, 2020 19:14

1 vote 5 comments

Lazy Constraints and Re-optimization Ongoing

• Barış Can Esmer
• April 20, 2020 13:04

1 vote 3 comments

Reliable Results ? Answered

• ibtissam labriji
• February 18, 2020 17:19

1 vote 4 comments

Dealing with 'Sub-optimal termination' in Barrier Method Answered

• Gregory Hauser
• January 13, 2020 21:05

1 vote 2 comments

No solution found when using an objective function Answered

• Matthieu Lormeau
• December 09, 2019 15:06
• Edited

1 vote 6 comments

Cut loop at root node of MIP Answered

• Fan YANG
• August 23, 2019 15:23
• Edited

1 vote 7 comments

Adding multiple cuts in a single node (branch-and-cut algorithm) Answered

• Younsoo Lee
• June 07, 2019 08:05

1 vote 2 comments

Will Gurobi retain lazy cuts after changing the objective coefficients? Answered

• Austin Buchanan
• June 05, 2019 23:15
• Edited

1 vote 5 comments

How to terminate once barrier solves problem Answered

• Debopam Bhattacherjee
• April 23, 2019 12:52

1 vote 2 comments

Branch and price example Answered

• A.Omidi
• April 05, 2019 21:23

1 vote 13 comments

Speed up gurobi to solve an milp Answered

• Ebru Angun
• April 05, 2019 17:33

1 vote 14 comments

Long Time Spend in Model Construction Answered

• CAN YIN
• February 11, 2025 10:48

0 votes 1 comment