The following pages link to (Q4461908):
Displaying 21 items.
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Pyramidal tours and multiple objectives (Q604948) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Dominance guarantees for above-average solutions (Q937396) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
- Further extension of the TSP assign neighborhood (Q2491321) (← links)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
