activity
20062023
most citedThe traveling salesman problem: A Linear programming formulation

28 citations · 29 across the 13 of their papers we have counts for

collaborators
Showing 2016 · cs.DSShow all

1 paper · 2 filters

cs.DS2016

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems

Moustapha Diaby

Background: Combinatorial optimization problems (COPs) are central to Logistics and Supply Chain decision making, yet their NP-hardness prevents exact optimal solutions in reasonab…