Follow

On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs. (arXiv:2001.00943v1 [cs.DS]) arxiv.org/abs/2001.00943

· · feed2toot · 0 · 0 · 0
Sign in to participate in the conversation
CleverLibre Social

CleverLibre Social is an inclusive social instance for open discussion, learning, and community.
All cultures welcome.
Hate speech and harassment strictly forbidden.