Pages that link to "Item:Q1257826"

The following pages link to A characterization of linear admissible transformations for the m- travelling salesmen problem (Q1257826):

Displaying 13 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• The multiple-robot assembly plan problem (Q685191) (← 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 characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer (Q1253610) (← links)
• Graphs in which all Hamiltonian cycles have the same length (Q1337675) (← links)
• Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)