Newest Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
374 views

On a square grid, a loop passes through each cell exactly once. For certain rows and columns, the maximum number of consecutive cells traversed by the path in that row or column is bounded by the tag ...
NormalFit's user avatar
  • 488
-1 votes
0 answers
27 views

this is rephrased version of a previous question, to be a bit more precise. This is my proposed labeling algorithm to solve the Subproblems in my Branch&Price algorithm. Labeling Algorithm For ...
mingabua's user avatar
0 votes
0 answers
71 views
+50

I have a sort of reverse question; I have a technique that finds a close approximate solution to my problem but I'm not sure what this technique is named, if at all. My problem started as a network ...
jbuddy_13's user avatar
  • 521
1 vote
2 answers
88 views

Problem Context: I'm working on a large-scale Linear Programming (LP) problem containing over 6 million variables (There are a total of 7 different models). My goal is to improve the model's ...
Lucas Tayrone Moreira's user avatar
0 votes
2 answers
62 views

I am working on the Markowitz Quadratic Portfolio optimization. I have this Lingo code : ...
estellec's user avatar
2 votes
0 answers
42 views

What OR journal publish commentaries or corrigenda, i.e., for a paper that appeared in a different journal? By a commentary or a corrigendum, I mean a usually short paper whose main purpose is to ...
Discipulus's user avatar
2 votes
0 answers
125 views

I am a network engineer working with optimization models. In some transportation and logistics models, especially when there are economies of scale, the cost function becomes concave. I am not sure ...
Tuong Nguyen Minh's user avatar
0 votes
0 answers
44 views

I am analyzing a specific instance of the Single-item Economic Lot-Sizing (ELS) problem where production costs are piecewise linear and backlogging is allowed. I have a "target" solution ...
Ptr's user avatar
  • 1
3 votes
3 answers
317 views

In the paper (doi:10.1002/nav.20201), the authors describe a branching strategy that does not branch directly on the master variables $z_{j k}$. Instead, they branch on the derived quantities $$ \...
mingabua's user avatar
1 vote
0 answers
41 views

I am currently solving a column generation problem for my machine scheduling model. In the master problem, all orders are coordinated and the allocation plans are created in the individual subproblems ...
makerbaker's user avatar
2 votes
0 answers
46 views

I have a nonconvex MIQCQP that I have been using Gurobi's spatial B&B to solve. I want to test whether warm starting has any benefits in terms of solution time. I am aware that for MIPs, warm ...
Fabricio Oliveira's user avatar
5 votes
2 answers
151 views

I am working on convex optimization problems in network engineering that involve bilinear terms of the form $xy$. According to this resource, McCormick envelopes provide a convex relaxation for such ...
Tuong Nguyen Minh's user avatar
-3 votes
1 answer
68 views

A milk producing co-operative union desires to determine how many kilograms of butter it should produce on daily basis to meet the demand. Following is the pattern of demand derived from the past ...
Winodd Dhamnekar's user avatar
0 votes
0 answers
63 views

I'm working on the following optimization problem: \begin{aligned} \mathbf{P}: \quad & \max_{\mathbf{z},\,\mathbf{b}} && |b_1| \\ & \text{s.t.} && C_1: |b_m| \le b_{\max}, \...
Mohammad's user avatar
0 votes
0 answers
70 views

This is embarrassing, but I will very soon be using Stigler's diet problem data to teach LP to business undergrads and I am having a hard time interpreting or trusting it. This OR-Tools page says that ...
Ralph Asher's user avatar

15 30 50 per page
1
2 3 4 5
315