User KGM

12 votes

2 answers

4k views

MILP: is it NP-complete or NP-hard?

asked Nov 11, 2019 at 17:18

12 votes

3 answers

3k views

Does it make sense to use strict equality constraints in optimization?

asked Dec 7, 2019 at 1:38

12 votes

5 answers

2k views

Dividing machines into groups of equal sizes so that each group has approximately same productivity

asked Jan 19, 2022 at 11:39

10 votes

3 answers

2k views

Is there a heuristic approach to the MILP problem?

asked Nov 1, 2019 at 0:38

10 votes

2 answers

5k views

Complexity of LP and MILP Problems?

asked Nov 10, 2019 at 18:41

9 votes

2 answers

1k views

How can I transform this MILP into an LP problem?

asked Dec 16, 2019 at 23:15

9 votes

1 answer

758 views

Complexity comparision between purely BLP and MILP problems?

asked Jan 8, 2020 at 22:51

8 votes

2 answers

566 views

Is there a greedy heuristic approach to the MILP problem?

asked Nov 3, 2019 at 12:01

8 votes

1 answer

472 views

How to resolve this issue in multi-objective optimization?

asked Sep 9, 2019 at 15:50

8 votes

1 answer

2k views

How to linearize the multiplication of an integer and a binary integer variable?

asked Oct 24, 2019 at 10:44

8 votes

1 answer

1k views

Why do I get a binary solution even when I solve an LP problem with continuous variables?

asked May 27 at 22:01

7 votes

2 answers

501 views

How can I linearize or convexify this binary quadratic optimization problem?

asked Jul 9, 2019 at 0:00

7 votes

1 answer

525 views

How to formulate this scheduling problem efficiently?

asked Jul 9, 2019 at 22:09

7 votes

1 answer

426 views

How to reformulate (linearize/convexify) a budgeted assignment problem?

asked Jul 11, 2019 at 22:48

6 votes

1 answer

132 views

How can I solve this problem?

asked Sep 27, 2019 at 10:13

6 votes

2 answers

486 views

A heuristic approach to solve a MILP problem?

asked Nov 5, 2019 at 23:20

6 votes

2 answers

273 views

Heuristic solution to the graph partitioning problem

asked Aug 11, 2021 at 16:12

5 votes

1 answer

488 views

What is a good way to penalise LP relaxation?

asked Jun 3, 2021 at 7:52

4 votes

1 answer

426 views

How to partition a graph with optimal number of groups?

asked Jun 11, 2021 at 12:55

4 votes

2 answers

495 views

Any Solution for $k$-means with minimum and maximum cluster size constraint?

asked May 5, 2021 at 8:32

4 votes

0 answers

256 views

How can I formulate this multi-objective optimization problem?

asked Aug 31, 2019 at 12:24

4 votes

1 answer

313 views

How to express this constraint?

asked Jan 14, 2020 at 16:33

4 votes

3 answers

228 views

How can I find the optimal assignments for this MILP problem heuristically?

asked Feb 12, 2021 at 23:41

4 votes

2 answers

227 views

How to solve this convex problem heuristically?

asked Nov 14, 2020 at 14:47

4 votes

2 answers

2k views

How can I express this max-min in CPLEX?

asked Mar 25, 2021 at 15:13

3 votes

1 answer

558 views

How to assign values to array in CPLEX with C++?

asked Feb 23, 2021 at 23:54

3 votes

1 answer

248 views

How can I linearise this nonlinear proportional relation constraint?

asked Mar 5, 2021 at 1:02

3 votes

1 answer

347 views

How can I convexify (allowed some approximation) the objective function?

asked Nov 23, 2020 at 12:31

3 votes

1 answer

225 views

How to solve this generalized set packing problem?

asked Sep 30, 2022 at 21:09

3 votes

2 answers

141 views

How to linearize or fix this disciplined convex programming error?

asked Jan 15, 2023 at 19:06

Stack Exchange Network

66 Questions

MILP: is it NP-complete or NP-hard?

Does it make sense to use strict equality constraints in optimization?

Dividing machines into groups of equal sizes so that each group has approximately same productivity

Is there a heuristic approach to the MILP problem?

Complexity of LP and MILP Problems?

How can I transform this MILP into an LP problem?

Complexity comparision between purely BLP and MILP problems?

Is there a greedy heuristic approach to the MILP problem?

How to resolve this issue in multi-objective optimization?

How to linearize the multiplication of an integer and a binary integer variable?

Why do I get a binary solution even when I solve an LP problem with continuous variables?

How can I linearize or convexify this binary quadratic optimization problem?

How to formulate this scheduling problem efficiently?

How to reformulate (linearize/convexify) a budgeted assignment problem?

How can I solve this problem?

A heuristic approach to solve a MILP problem?

Heuristic solution to the graph partitioning problem

What is a good way to penalise LP relaxation?

How to partition a graph with optimal number of groups?

Any Solution for $k$-means with minimum and maximum cluster size constraint?

How can I formulate this multi-objective optimization problem?

How to express this constraint?

How can I find the optimal assignments for this MILP problem heuristically?

How to solve this convex problem heuristically?

How can I express this max-min in CPLEX?

How to assign values to array in CPLEX with C++?

How can I linearise this nonlinear proportional relation constraint?

How can I convexify (allowed some approximation) the objective function?

How to solve this generalized set packing problem?

How to linearize or fix this disciplined convex programming error?