The following pages link to P-Complete Approximation Problems (Q4119042):
Displayed 50 items.
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- A biased random-key genetic algorithm for the unequal area facility layout problem (Q319725) (← links)
- The latency location-routing problem (Q323569) (← links)
- Algorithm for the discrete Weber's problem with an accuracy estimate (Q329214) (← links)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Improved approximations for TSP with simple precedence constraints (Q396660) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- How to park freight trains on rail-rail transshipment yards: the train location problem (Q443824) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem (Q447561) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- Quadratic assignment problems (Q594767) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Machine scheduling with deliveries to multiple customer locations (Q707086) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance (Q723980) (← links)
- Approximation algorithms for the bus evacuation problem (Q724742) (← links)
- On approximating the minimum independent dominating set (Q750159) (← links)
- Worst-case analysis of two travelling salesman heuristics (Q786657) (← links)
- Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- QAPLIB-A quadratic assignment problem library (Q807376) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)