List questions from discrete-optimization

Published on 23 Feb 2026 - 11:45

80

Views

Number of possible combinations that satisfy the constraints

Published on 26 Jan 2022 - 13:36

48

Views

Greedy algorithm for matroids is $1/k$-approximation for the following graph problem (and $k$ is tight)

Published on 27 Mar 2026 - 1:44

63

Views

Methods of optimization of non-linear function with a binary variable.

Published on 30 Jan 2022 - 15:53

260

Views

Discrete convexity and greedy algorithm

Published on 01 Feb 2022 - 17:45

104

Views

Given a set S and n subsets of S: Find the subset of each of the n subsets, up to k elements, such that the union is maximized

Published on 02 Feb 2022 - 2:49

232

Views

Find a permutation $x_{\sigma(1)},\ldots,x_{\sigma(n)}$ of $x_1,\ldots,x_n$ that maximises $\sum_{k=1}^{n-1}\vert x_{\sigma(k)}-x_{\sigma(k+1)}\vert.$

Published on 26 Mar 2026 - 1:04

210

Views

How can you approximate $\sum_{i=0}^m \binom{n}{i}$?

Published on 04 Feb 2022 - 8:44

72

Views

Distribute biased coins across two Lotteries to maximize the probability of winning both lotteries jointly

Published on 07 Feb 2022 - 13:23

103

Views

Minimum tile moves needed for symmetry

Published on 08 Feb 2022 - 10:30

122

Views

Distribute labelled balls among labelled boxes as evenly as possible

Published on 10 Feb 2022 - 12:27

63

Views

Optimal way to pour cups of water into buckets

Published on 30 Mar 2026 - 1:29

134

Views

Prepare all dishes with the least different ingredients - what is this problem called?

Published on 14 Feb 2022 - 18:40

44

Views

Route Planning algortihms and optimization

Published on 16 Feb 2022 - 15:21

163

Views

Beatrix's board and holes

Published on 29 Mar 2026 - 10:47

List Question

Has this set bipartition optimization problem been studied?

Number of possible combinations that satisfy the constraints

Greedy algorithm for matroids is $1/k$-approximation for the following graph problem (and $k$ is tight)

Methods of optimization of non-linear function with a binary variable.

Discrete convexity and greedy algorithm

Given a set S and n subsets of S: Find the subset of each of the n subsets, up to k elements, such that the union is maximized

Find a permutation $x_{\sigma(1)},\ldots,x_{\sigma(n)}$ of $x_1,\ldots,x_n$ that maximises $\sum_{k=1}^{n-1}\vert x_{\sigma(k)}-x_{\sigma(k+1)}\vert.$

How can you approximate $\sum_{i=0}^m \binom{n}{i}$?

Distribute biased coins across two Lotteries to maximize the probability of winning both lotteries jointly

Minimum tile moves needed for symmetry

Distribute labelled balls among labelled boxes as evenly as possible

Optimal way to pour cups of water into buckets

Prepare all dishes with the least different ingredients - what is this problem called?

Route Planning algortihms and optimization

Beatrix's board and holes

Trending Questions

Popular # Hahtags

Popular Questions