An O(m^9 ) ternary min-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
Fields of Study & Subjects
Vehicle Routing Optimization Methods
Complexity and Algorithms in Graphs
Constraint Satisfaction and Optimization
Publication details
- Publication date
- 1 January 2026