Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Paul Bouman
The Netherlands
Assistant professor at the Econometric Institute of the Erasmus University Rotterdam
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
9
votes
Specific algorithms to compute the LP-relaxation of the Set-Cover problem
algorithms
lp-relaxation
combinatorics
set-cover
asked Sep 24, 2020 at 17:39
or.stackexchange.com
Top Answers
20
Find feasible point in polynomial time in linear programming
or.stackexchange.com
18
Algorithms vs LP or MIP
or.stackexchange.com
11
To which area does constraint programming belong?
or.stackexchange.com
10
What is a "hard problem" in the context of Mixed-integer programming?
or.stackexchange.com
8
Intuition behind more-for-less transportation paradox?
or.stackexchange.com
7
How to choose an architecture for an OR web app and how to learn the tech stack associated?
or.stackexchange.com
6
How to formulate: each pair of elements in $A$ has one common unit in $B$
or.stackexchange.com
6
How does a solver generally know whether a solution is optimal?
or.stackexchange.com
5
Is the "reverse search" algorithm of David Avis the state-of-the-art method for finding discrete solutions to a system of linear inequalities?
or.stackexchange.com
5
Theoretical results on performance of branch-and-bound
or.stackexchange.com
5
Polynomial algorithm for a special ILP problem
or.stackexchange.com
5
Can this be formulated as one inequality
or.stackexchange.com
Stack Exchange works best with JavaScript enabled
or.stackexchange.com