Skip to main content

All Questions

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5 votes
0 answers
581 views

When is polytope compatible with network flow?

A linear program is the problem of optimizing an linear objective function within some polytope $A$ over $\mathbf R^n$. My question is motivated by the question of when a linear programming problem ...
David Harris's user avatar
  • 3,475
1 vote
0 answers
20 views

Calculating Cost-Optimal 1-Factors in Digraphs

I need to find a cost-optimal 1-factor in a positively weighted, directed, regular graph $G(V,A)$ without antiparallel arcs, i.e. given $$\text{deg}_{\text{in}}(u)=\text{deg}_{\text{in}}(v)=\text{deg}...
Manfred Weis's user avatar
  • 13.2k