The following pages link to (Q4692473):
Displaying 10 items.
- Approximate algorithms for the traveling salesman problem. II (Q499569) (← links)
- An estimate for the curvature of an order-convex set in the integer lattice and related questions (Q635600) (← links)
- Greedy sets and related problems (Q1278939) (← links)
- Maximizing traveling salesman problem for special matrices (Q1343160) (← links)
- An algorithm for constructing reduced DNFs of order-convex Boolean functions (Q2320206) (← links)
- Parametric properties of the transportation problem and relations to supermatroids (Q3123136) (← links)
- Algorithms to construct a mathematical model of preferences using expert judgments (Q4007374) (← links)
- A Greedy Algorithm for Capacitated Lot-Sizing Problems (Q4430673) (← links)
- A polynomial algorithm for resourse allocation problems with polymatroid constrains<sup>1</sup> (Q5689829) (← links)
- (Q5885543) (← links)
