The following pages link to P-Complete Approximation Problems (Q4119042):
Displayed 50 items.
- Quadratic assignment problems (Q594767) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← 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)
- 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 survey for the quadratic assignment problem (Q852928) (← links)
- Detailed layout planning for irregularly-shaped machines with transportation path design (Q856265) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Data relaying with constraints in hierarchical sensor networks (Q857769) (← links)
- Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- The delivery man problem on a tree network (Q920033) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- Biological computation of the solution to the quadratic assignment problem (Q929455) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- Random assignment problems (Q953417) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- Clustering to minimize the maximum intercluster distance (Q1059958) (← links)
- Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976) (← links)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- The facility layout problem (Q1088577) (← links)
- Layouts with wires of balanced length (Q1091358) (← links)
- Design of electronic assembly lines: An analytical framework and its application (Q1124682) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- An algorithm for quadratic assignment problems (Q1130047) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Easy and hard bottleneck location problems (Q1135201) (← links)
- Structure preserving reductions among convex optimization problems (Q1143173) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Optimization problems and the polynomial hierarchy (Q1152218) (← links)
- Discrete extremal problems (Q1152306) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- On locating new facilities in a competitive environment (Q1171986) (← links)
- Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)