Skip to main content
added 7 characters in body
Source Link
RobPratt
  • 5.4k
  • 1
  • 15
  • 25

You could dualize the (complicating) equality constraints and use the branch-and-price algorithm. The resulting problems all have the same subproblem, and so you can use a common pool of columns. More explicitly, solve the first problem, use the resulting columns as an initial pool for the second problem, and repeat for the nexteach subsequent problem.

You could dualize the (complicating) equality constraints and use the branch-and-price algorithm. The resulting problems all have the same subproblem, and so you can use a common pool of columns. More explicitly, solve the first problem, use the resulting columns as an initial pool for the second problem, and repeat for the next problem.

You could dualize the (complicating) equality constraints and use the branch-and-price algorithm. The resulting problems all have the same subproblem, and so you can use a common pool of columns. More explicitly, solve the first problem, use the resulting columns as an initial pool for the second problem, and repeat for each subsequent problem.

Source Link
RobPratt
  • 5.4k
  • 1
  • 15
  • 25

You could dualize the (complicating) equality constraints and use the branch-and-price algorithm. The resulting problems all have the same subproblem, and so you can use a common pool of columns. More explicitly, solve the first problem, use the resulting columns as an initial pool for the second problem, and repeat for the next problem.