MathDB2 problems
- 0 votes0 replies0 views
The efficient-basis coverage conjecture for multi-objective matroid optimization
Efficient-basis coverage conjecture. Every efficient basis for is efficient for at least one of the problems or.
- 0 votes0 replies0 views
Convex-optimization tractability conjecture for norm-constrained matroid bases
Convex-optimization tractability conjecture. Methods based on convex optimization could solve this problem in polynomial, but not strongly polynomial, running time.