Meta Stack Exchange
to customize your list.
more stack exchange communities
Assistant professor at the Econometric Institute of the Erasmus University Rotterdam
Specific algorithms to compute the LP-relaxation of the Set-Cover problem
asked Sep 24, 2020 at 17:39
Find feasible point in polynomial time in linear programming
Algorithms vs LP or MIP
To which area does constraint programming belong?
What is a "hard problem" in the context of Mixed-integer programming?
Intuition behind more-for-less transportation paradox?
How to choose an architecture for an OR web app and how to learn the tech stack associated?
How to formulate: each pair of elements in $A$ has one common unit in $B$
How does a solver generally know whether a solution is optimal?
Is the "reverse search" algorithm of David Avis the state-of-the-art method for finding discrete solutions to a system of linear inequalities?
Theoretical results on performance of branch-and-bound
Polynomial algorithm for a special ILP problem
Can this be formulated as one inequality