The following pages link to (Q3677509):
Displaying 50 items.
- A novel approach for part family formation for reconfiguration manufacturing system (Q289658) (← links)
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
- Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Certifying algorithms (Q465678) (← links)
- A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems (Q466000) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Survivable network design with demand uncertainty (Q631096) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- The multiple-robot assembly plan problem (Q685191) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Rectifiable sets and the traveling salesman problem (Q807767) (← links)
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- Performance analysis of cyclical simulated annealing algorithms (Q812974) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- LP-based solution methods for the asymmetric TSP (Q845937) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- Design and control of warehouse order picking: a literature review (Q881508) (← links)
- A note on dual solutions of the assignment problem in connection with the traveling salesman problem (Q911984) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- The ``molecular'' traveling salesman (Q922393) (← links)
- Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- Ant colony method to control variance reduction techniques in the Monte Carlo simulation of clinical electron linear accelerators of use in cancer therapy (Q1044650) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Optimization of the movements of a component placement machine (Q1111924) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Boltzmann machines for travelling salesman problems (Q1119182) (← links)
- An approximation algorithm for the TSP (Q1119485) (← links)
