User Sune

37 votes

Can we consider the (Famous) "Trolley Problem" as an Optimization Problem?

answered Mar 13, 2022 at 6:49

18 votes

How can I remember the rules for taking the dual of a linear program (LP)?

answered Jun 7, 2019 at 7:52

18 votes

Accepted

Variable bounds in column generation

answered Jun 19, 2019 at 11:39

12 votes

List of Implementations for common OR problems

answered Jul 1, 2019 at 12:16

12 votes

What are Operations Research problems which occur in everyday life?

answered Jun 2, 2020 at 13:37

12 votes

Accepted

Can the primal Simplex Method walk all optima in linear time?

answered Mar 5, 2022 at 14:09

10 votes

Is "Branch and Bound" better than Evolutionary Algorithms?

answered Feb 2, 2022 at 10:01

9 votes

Customer clustering to solve very large-scale VRPs

answered Jan 13, 2020 at 13:53

9 votes

Generalized Assignment Problem as the sub-problem

answered Sep 30, 2019 at 13:10

8 votes

Good sources on developing mathematical models

answered Jul 7, 2019 at 13:02

8 votes

Cplex 12.10: How can I solve an LP relaxation?

answered Mar 15, 2020 at 20:55

7 votes

Benchmark problems for combinatorial multi-objective optimisation

answered Jul 9, 2019 at 17:47

7 votes

What is good introductory literature on (meta)heuristics?

answered Sep 4, 2020 at 18:08

7 votes

Random solution for capacitated vehcle routing problem (cvrp)

answered Feb 15, 2021 at 10:51

7 votes

Travelling salesman problem variant without returning to the starting point

answered Apr 27, 2021 at 9:16

7 votes

Difference between solving Assignment Problem using the Hungarian Method vs. LP

answered Mar 20, 2022 at 6:07

7 votes

The significance of infeasibility for a Capacitated Facility Location Problem

answered Mar 3, 2022 at 15:25

6 votes

Accepted

Of what size should I expect to be able to solve an integer linear program with Pyomo?

answered Feb 7 at 19:31

6 votes

Accepted

How to visit a subset of network nodes in a single trip?

answered Apr 29, 2021 at 6:26

6 votes

Accepted

LP dependent on the ordering of the data

answered May 4, 2020 at 18:48

6 votes

Is there a knapsack problem which allows 'out-of-capacity'?

answered Aug 29, 2020 at 7:51

6 votes

Accepted

Partial Relaxation

answered Dec 15, 2019 at 16:12

6 votes

How to remove or replace sub tour elimination constraints in the VRP variant models?

answered Jan 10, 2020 at 7:58

6 votes

Accepted

Propagate value through a graph

answered Mar 16, 2020 at 6:48

6 votes

Is the iteration-limited Simplex dual solution of a MIP node useful?

answered Apr 18, 2020 at 12:41

5 votes

Accepted

Linear objective function with non-linear constraints

answered Jul 17, 2020 at 12:53

5 votes

Accepted

Find the cheapest shopping cart

answered Mar 26, 2020 at 5:34

5 votes

TSP subtour elimination with multiple formulations

answered Mar 10, 2020 at 19:26

5 votes

Reference for column generation applications

answered Nov 8, 2019 at 8:30

5 votes

Accepted

How do I interpret the CPLEX Optimization Studio MIP gap output?

answered Oct 22, 2020 at 16:48

Stack Exchange Network

76 Answers

Can we consider the (Famous) "Trolley Problem" as an Optimization Problem?

How can I remember the rules for taking the dual of a linear program (LP)?

Variable bounds in column generation

List of Implementations for common OR problems

What are Operations Research problems which occur in everyday life?

Can the primal Simplex Method walk all optima in linear time?

Is "Branch and Bound" better than Evolutionary Algorithms?

Customer clustering to solve very large-scale VRPs

Generalized Assignment Problem as the sub-problem

Good sources on developing mathematical models

Cplex 12.10: How can I solve an LP relaxation?

Benchmark problems for combinatorial multi-objective optimisation

What is good introductory literature on (meta)heuristics?

Random solution for capacitated vehcle routing problem (cvrp)

Travelling salesman problem variant without returning to the starting point

Difference between solving Assignment Problem using the Hungarian Method vs. LP

The significance of infeasibility for a Capacitated Facility Location Problem

Of what size should I expect to be able to solve an integer linear program with Pyomo?

How to visit a subset of network nodes in a single trip?

LP dependent on the ordering of the data

Is there a knapsack problem which allows 'out-of-capacity'?

Partial Relaxation

How to remove or replace sub tour elimination constraints in the VRP variant models?

Propagate value through a graph

Is the iteration-limited Simplex dual solution of a MIP node useful?

Linear objective function with non-linear constraints

Find the cheapest shopping cart

TSP subtour elimination with multiple formulations

Reference for column generation applications

How do I interpret the CPLEX Optimization Studio MIP gap output?