Properties of the trajectories of the appointments problem and the travelling-salesman problem
From MaRDI portal
Publication:3959743
DOI10.1016/0041-5553(81)90142-7zbMath0495.90060OpenAlexW1979679242MaRDI QIDQ3959743
Publication date: 1981
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(81)90142-7
assignment probleminverse optimizationdiscrete programmingtravelling-salesman problemn-cyclesappointments problempermissible sequencespermissible trajectoriesstructure of optimal solutions
Related Items
The bilinear assignment problem: complexity and polynomially solvable special cases, Three value TSP and linkages with the three value linear spanning 2-forests