On the Linear Relaxation of the s-t-cut Problem with Budget Constraints.
Hassene AissiAli Ridha MahjoubPublished in: ISCO (2020)
Keyphrases
- budget constraints
- linear relaxation
- minimum cost
- linear program
- linear constraints
- relaxation algorithm
- set partitioning
- column generation
- knapsack problem
- random graphs
- valid inequalities
- constant factor
- soft constraints
- integer programming
- linear programming
- bidding strategies
- integer program
- optimal solution
- mixed integer programming
- decision making
- vehicle routing
- graph theoretic
- upper bound