All Questions
70
questions
1
vote
2
answers
195
views
Finding the maximum value of elements to be selected in a grid - ZIO $2009$, P$1$
Hello Community! The above problem you see is a problem I got wrong. :( This is ZIO $2009$, P$1$.
I tried the problem and miserably found the wrong answer as $20$. Here is how my approach goes - part ...
- 779
1
vote
1
answer
87
views
An optimization problem to find the consecutive day subset with maximum value - ZIO $2006$, P$1$
Hello everybody! The above problem is a combinatorics problem I got wrong. :( This is ZIO $2006$, P$1$.
For the first part, I got as answer: $3$ which is wrong. What I did to try my value which I ...
- 779
1
vote
3
answers
70
views
Minimizing the operations to be done on letters - ZIO $2014$, P$1$
Hello everybody! The above problem is a combinatorics problem I could not solve. :( This is ZIO $2014$, P$1$.
Here is my approach (feel free to point out any mistakes in it, that's why I am asking ...
- 779
2
votes
1
answer
135
views
Enumerate all unique simple arithmetic equations for a set of whole numbers
When I was younger I used to play a game in my math class: The teacher had a deck of 3x5 cards with a digit written on each one. She would deal out several cards and state a target number, and our ...
- 123
8
votes
2
answers
1k
views
Algorithm for least required matches to rank players in tournament
Assuming the following conditions:
A higher skill level always beats a lower skill level.
Given n players, each have a distinct skill level compared to the other (n-1).
If player A has beat player B, ...
0
votes
1
answer
107
views
Is the generalized assignment problem with un-capacitated agents NP-hard?
I am working on a generalized assignment problem which I typed below. I know it is shown to be NP-hard. I am wondering whether the problem is still NP-hard when the capacity of the agents are assumed ...
0
votes
1
answer
191
views
Algorithm to find integer combinations satisfying a set of inequalities
I have an engineering problem that is reduced to finding a set of positive integer combinations satisfying several inequalities and some other properties.
Specially, let $\mathcal{S}$ be the set of ...
- 317
1
vote
1
answer
102
views
How to maximize the total auction price for a set of bids subject to bidder constraints
I want to auction a set of ASSETS (A) and fetch the maximum total price. The bidding is simultaneous and works as follows.
Say I have a collection of BIDDERS (B) who, individually, bid to purchase a ...
- 141
1
vote
0
answers
24
views
Assignment problem based on agent similarities/sympathy
I am trying to solve an assignment problem with $N$ agents and $M$ tasks. There are more agents than tasks and in each situation, $N/M$ agents must be assigned to a one task. In other words, each task ...
- 11
2
votes
0
answers
192
views
Proof that my greedy algorithm for assigning candidates to jobs works
I was using the answers on this question as a guide for proving that my greedy algorithm is correct. (Unfortunately, CS Stack Exchange does not accept proof verification questions, which is why I ...
1
vote
1
answer
109
views
Finding nth term in a series
You are given a list of sets of numbers (nested) to derive a sequence such that :
Exactly 1 number must be selected from each of the sets
The sequence is arranged in the ascending order of the sum of ...
- 27
0
votes
0
answers
445
views
Find the upper and lower bounds of a coin weighing problem so that they coincide
We are given $N$ coins which are identical to each other with the exception of only 1 fake coin which is slightly heavier. The problem is to find the heaviest coin. We also have a Balance Scale. One ...
- 113
1
vote
1
answer
545
views
Generalization of assignment problem - multiple agents required to complete tasks
I have an assignment problem where each task $t_i$ requires $n_i$ agents to complete it (there are many more agents available then there are tasks for them to complete, even with multiple agents ...
- 329
1
vote
1
answer
485
views
Please explain how in the TSP, "every subpath of a path of minimum distance is itself a minimum distance"?
According to wikipedia, and many other sources I have read through, the Held-Karp algorithm is based on the idea that "every subpath of a path of minimum distance is itself a minimum distance."
I was ...
- 235
0
votes
0
answers
31
views
What is the name of following optimization problem and algorithms to solve them
Let $S=\{1,\ldots,n\}$ be a set and $w_i (\geq 0)$ be the weight of element $i$. Let $R_j, j = 1,\ldots,m$ be subsets of $S$, called the restriction sets. Choose elements from set $S$ to maximize ...
- 101