A TSP (1,2) application arising in cable assembly shops

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Journal of the Operational Research Society

• Publication date

  2005-03-16

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1057/palgrave.jors.2601850
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Hamiltonian Approach to the Assignment of Non-reusable Frequencies

  1998cited by this paper
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

  1997cited by this paper
• The Traveling Salesman Problem with Distances One and Two

  1993cited by this paper
• Geometric Approaches to Solve the Chebyshev Traveling Salesman Problem

  1990cited by this paper
• THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization

  1986cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• Complexity of Computer Computations

  1972cited by this paper

• Ant Colony Optimization and Beam-Ant Colony Optimization on Traveling Salesman Problem with Traffic Congestion

  2024cites this paper
• 12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)

  2015cites this paper
• VRP12 (vehicle routing problem with distances one and two) with side constraints

  2013cites this paper
• Modifying Ant Colony Optimization

  2008cites this paper
• Optimizing crimping operations in cable assembly shops

  2007cites this paper
• Operations sequencing in a cable assembly shop

  2005cites this paper