Academic paper on the algorithm

Answered

Yelie Yuan

• April 07, 2023 19:10
• Edited

Hello,

 

I am using an academic license to solve the following problem and would like to cite GUROBI in my academic publication.

I found the citation info here https://support.gurobi.com/hc/en-us/articles/360013195592-How-do-I-cite-Gurobi-software-for-an-academic-publication-,

If possible, could you provide me with some published papers on the solving algorithm implemented in GUROBI?

 

 

Below is the problem I am using GUROBI to solve. c1, c2, c3, c4 are positive constants.

 

Variables:

1. non-negative continuous variables W (n by n);

2. binary variables A (n by n), used to indicate whether the elements of W are zero.

 

Constraints:

1. lower bound of non-zero elements of W: W[i, j] >= c1 * A[i, j]

2. upper bound of non-zero elements of W: W[i, j] <= c2 * A[i, j]

3. number of nonzero elements of W: sum(A) == c3

4. several linear constraints on W.

 

Objective function to be minimized:

A linear funciton of W.

Sometimes, I would like to minimize [sum(W[i, j]^2) - c4]^2, i.e., minimize the difference between the second raw moment of non-zero elements of W and a constant.

 

 

Thank you!

0

• 

  Riley Clement

  Gurobi Staff

  • April 07, 2023 21:43

  Hi Yelie,

  There are many good references in Chapter 3 MIP Evolution of

  Achterberg, Tobias, and Roland Wunderling. "Mixed integer programming: Analyzing 12 years of progress." Facets of Combinatorial Optimization: Festschrift for Martin Grötschel (2013): 449-481.

  - Riley

  0
• 

  Yelie Yuan

  • April 08, 2023 04:10

  

  

  

  Thank you for providing the reference, Riley. I appreciate your help.

  I will check the paper and get in touch if I need further assistance.

   

  Thanks,
  Yelie

  0
• 

  Yelie Yuan

  • April 20, 2023 22:26

  

  

  

  Hi,

  The heuristic approach has been effective in generating feasible solutions to my problem. I wonder if there's a way to identify the specific heuristic algorithm that gives the solution. Also, how to properly cite the heuristic algorithms implemented in GUROBI?

  Thanks.

  0
• 

  Eli Towle

  Gurobi Staff

  • April 20, 2023 23:24
  • Edited

  In general, it is not possible to identify which specific heuristic algorithm found a solution. There are a few exceptions: for certain heuristics controlled via parameters (minimum relaxation heuristic, feasibility pump heuristic, zero objective heuristic, and no relaxation heuristic), you will see log output indicating when the heuristic is running and whether it found a solution.

  You can cite Gurobi using the format described in the How do I cite Gurobi software for an academic publication? article.

  0

Please sign in to leave a comment.