Pages that link to "Item:Q1575073"

The following pages link to A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. (Q1575073):

Displaying 33 items.

• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
• A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
• Dominance guarantees for above-average solutions (Q937396) (← links)
• Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
• Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
• Extended neighborhood: Definition and characterization (Q1764249) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)
• An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
• Further extension of the TSP assign neighborhood (Q2491321) (← links)
• Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
• A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
• The stable set problem and the thinness of a graph (Q2643810) (← links)
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
• New exponential neighbourhood for polynomially solvable TSPs (Q3439139) (← links)
• Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
• Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
• Travelling salesman paths on Demidenko matrices (Q6558670) (← links)