Skip to main content

Questions tagged [algorithms]

For questions related to the design or implementation of algorithms (exact or heuristic) for solving optimization problems.

1 vote
2 answers
142 views

Let $$f(x) = \prod_{i=1}^n g(x_i) - \prod_{i=1}^n h(x_i),$$ where $g$ and $h$ are continuous and piecewise-linear functions on $[0,1]$, with $k$ breakpoints. I would like to compute the maximum of $f$...
Erel Segal-Halevi's user avatar
0 votes
0 answers
42 views

I'm studying a variant of the classical Subset Sum problem and would appreciate insights on its complexity. As background: The classical Subset Sum problem with positive integers is known to be ...
Samuel Bismuth's user avatar
5 votes
2 answers
399 views

Recently, I developed a linear MIP model for a problem that was originally proposed about ten years ago using a non-linear formulation (specifically, involving binary variables multiplied by ...
Runfeng Yu's user avatar
0 votes
0 answers
34 views

We define the all-subset-sum problem as follows. Given a set $S$ of positive integers and a target $T$, the goal is to find all the maximal distinct subsets of $S$ summing to $T$. A maximal set is a ...
Samuel Bismuth's user avatar
2 votes
1 answer
83 views

Below I describe a combinatorial optimization problem. I think at this point the most useful thing would be to find out what the real name of this problem is, or what real canonical OR problem this is ...
Cactus's user avatar
  • 121
1 vote
0 answers
114 views

I have a Linear Program $Ax\leq b$ where $A\in\mathbb Z^{n\times m}$, $b\in\mathbb Z^m$ and $x\in\mathbb R^n$ with $5\times10^5$ to $2\times10^6$ variables and the matrix $A$ has roughly $10^7$ to $10^...
Turbo's user avatar
  • 141
1 vote
0 answers
85 views

Given a sparse weighted bipartite graph, weights are reals between [0, 1]. I have to find in quick succession a Perfect Matching (any weight), followed by the Maximum Weight Perfect Matching. I obtain ...
kaldo's user avatar
  • 11
1 vote
2 answers
145 views

Are there any established solutions, i.e., Python package, to solve the uniform-machine scheduling problem with the goal to minimize average completion time? Are there any implementations of the ...
LYL's user avatar
  • 11
0 votes
1 answer
185 views

I am seeking help to improve both my code and understanding of heuristics. I am new to heuristic algorithms and coding, but I really enjoy the subject. Do you have any suggestions for improving my ...
Onur's user avatar
  • 1
1 vote
0 answers
88 views

Resource allocation problems frequently appear in operations research, where the goal is to allocate resources optimally under various constraints. While many classic formulations assume symmetric ...
Dang Dang's user avatar
0 votes
0 answers
81 views

I am facing a weird problem. I am currently implementing a column generation heuristic with aggregated sub-problems (for those that are identical). I use this model decomposition and this aggregation ...
mingabua's user avatar
1 vote
1 answer
138 views

please advise automated solvers for solving the following problem: There are about 12500 binary variables and a system of linear constraints on them - about 800 linear equalities and 37000 linear ...
Uzer's user avatar
  • 13
1 vote
1 answer
89 views

Where can I find understandable Python code for different variants of Differential Evolution?
user15230's user avatar
0 votes
0 answers
102 views

I have an app that allow students to book a private lecture with a teacher. Each teacher can specify: time period that he is available, for example from 4pm to 8pm and from 9pm to 11pm (so there ...
Mr.Price's user avatar
  • 101
2 votes
0 answers
46 views

I would suspect there are a few papers on the subject of fuel minimization that utilize linear programming formulations but are there any surveys on the research done in the computation of paths on ...
Paul's user avatar
  • 21

15 30 50 per page
1
2 3 4 5
9