New answers tagged

3 votes
Accepted

Termination criterion for the Phase 1 algorithm in column generation

The termination criterion is the same because the primal objective value is $0$ if and only if the dual objective value is $0$. Your dual formulation is almost correct, but you are missing $a$ and $b$ ...
RobPratt's user avatar
  • 30.5k
1 vote
Accepted

Partially modify LHS of a constraint set?

The most computationally expensive aspect of this algorithm is the reconstruction of the master problem when a column is added (or sometimes removed) By "reconstruction", do you mean that ...
gmn's user avatar
  • 622
0 votes

Is there existing code for the set partitioning formulation of routing problems?

There is a Python interface for the VRPSolver that can be installed using the following code: python -m pip install VRPSolverEasy All the information is given in ...
Oguz Toragay's user avatar
  • 8,622
1 vote

Is there existing code for the set partitioning formulation of routing problems?

Python is not an efficient language, and solving the resource constrained shortest path is the bottleneck of the branch-and-cut-and-price algorithms for routing problems. Therefore, you won't find a ...
fontanf's user avatar
  • 2,495

Top 50 recent answers are included