Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithms
Search options not deleted
user 199
For questions related to the design or implementation of algorithms (exact or heuristic) for solving optimization problems.
0
votes
How to correct this scheduling algorithm?
Infeasibility, in many cases, back to the structure of the problem under study and as @AirSquid mentioned too, it really has not related to the solving algorithm if, it was implemented correctly. One …
- 9,446
3
votes
Accepted
How to convert 3D bin packing problem to 2D bin packing approximation?
According to the attached file:
In the $m$-dimensional bin packing problem ($m$-BPP) there are many large boxes
of equal sizes, which are called bins, and the objective is to pack all $n$ items into …
- 9,446
2
votes
How to solve assignment problem with additional constraints?
I am not aware of how this problem can still be solved by the Hungarian algorithm in an efficient way, but there are some algorithms to tackle such a problem, like $\text{LRPT}$, Longest Remaining Processing …
- 9,446
12
votes
3
answers
6k
views
Performance of a branch and bound algorithm VS branch-cut-heuristics
I was trying to solve a moderate scheduling model using an open-source solver. I did two different ways.
A) using pure branch and bound algorithm (disable all options).
B) using the default setting …
- 9,446
2
votes
Constrained optimization with heuristic algorithm in actual production
Besides the mentioned answer, there are many cases in which either a simple rule or an algorithm, or a heuristic can solve a practical problem in an efficient manner and still without defining any con …
- 9,446
0
votes
Assign jobs to least people with multiple job constraints
There are two things that should be taken into account in your problem. First, the number of staff/resources, and the second the compilation time of all tasks. (The second one already can be changed t …
- 9,446
10
votes
How to implement a "generic" solver for scheduling problems?
As you mentioned about "scheduling/production planning problems", I refer it to manufacturing planning and detailed schedule. Also, I know that there are specific methods to solve other planning and s …
- 9,446
2
votes
0
answers
124
views
The linearization of the logical constraints
I know the logical constraints can be linearized by either the logical representation of whose relation, (for pure binary variables e.g. CNF/DNF) or for general form by using Big-M formulation. As I h …
- 9,446