New answers tagged integer-programming
2
votes
Maximum cardinality matching with a priority order
Let $C$ be a sufficiently large constant. Use $C-(v_i-u_i)$ as the edge weight, instead of $v_i-u_i$. Then find a maximum-weight matching in the resulting graph. This will be the solution to your ...
D.W.♦
- 169k
Top 50 recent answers are included
Related Tags
integer-programming × 251linear-programming × 112
optimization × 66
algorithms × 45
complexity-theory × 32
graphs × 21
np-complete × 17
constraint-programming × 15
constraint-satisfaction × 13
np-hard × 10
combinatorics × 9
satisfiability × 9
approximation × 9
discrete-mathematics × 9
knapsack-problems × 9
reductions × 8
mathematical-programming × 8
reference-request × 7
scheduling × 7
traveling-salesman × 7
modelling × 7
dynamic-programming × 6
linear-algebra × 6
time-complexity × 5
logic × 5