The following pages link to Mandell Bellmore (Q4404664):
Displaying 12 items.
- A Bounding Minimization Problem for Primal Integer Programming (Q4404665) (← links)
- A Generated Cut for Primal Integer Programming (Q4768856) (← links)
- Iteration Skipping in Primal Integer Programming (Q4768857) (← links)
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem (Q4770207) (← links)
- A decomposable transshipment algorithm for a multiperiod transportation problem (Q5589733) (← links)
- An Implicit Enumeration Scheme for Proper Cut Generation (Q5603743) (← links)
- The Traveling Salesman Problem: A Survey (Q5615771) (← links)
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms (Q5624982) (← links)
- A network isolation algorithm (Q5633846) (← links)
- Set Covering and Involutory Bases (Q5636706) (← links)
- Set Covering and Involutory Bases (Q5652446) (← links)
- On Multi-Commodity Maximal Dynamic Flows (Q5677309) (← links)
