Pages that link to "Item:Q1080781"
From MaRDI portal
The following pages link to Recognition of Gilmore-Gomory traveling salesman problem (Q1080781):
Displaying 16 items.
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts (Q710581) (← links)
- Three value TSP and linkages with the three value linear spanning 2-forests (Q765337) (← links)
- A correction to a result in linear programming (Q1101011) (← links)
- An algorithm for the detection and construction of Monge sequences (Q1116656) (← links)
- A generalization of the convex-hull-and-line traveling salesman problem (Q1281349) (← links)
- Gilmore-Gomory type traveling salesman problems (Q1302599) (← links)
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Weighted graphs with all Hamiltonian cycles of the same length (Q1408871) (← links)
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds (Q1804883) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey (Q2772854) (← links)
