The following pages link to P-Complete Approximation Problems (Q4119042):
Displaying 50 items.
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
- A contribution to quadratic assignment problems (Q3362092) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH (Q3393492) (← links)
- A new linearization method for quadratic assignment problems (Q3423596) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
- A New Neighborhood for the QAP (Q3503523) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)
- A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM (Q3638702) (← links)
- Forward Backward Transformation (Q3649623) (← links)
- The asymptotic probabilistic behaviour of quadratic sum assignment problems (Q3668301) (← links)
- The traveling salesman problem: An update of research (Q3671783) (← links)
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
- The complexity of the travelling repairman problem (Q3709900) (← links)
- Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367) (← links)
- On the computational complexity of centers locating in a graph (Q3902477) (← links)
- The complexity of designing a network with minimum diameter (Q3910007) (← links)
- On random quadratic bottleneck assignment problems (Q3938840) (← links)
- Worst-Case Analysis of Network Design Problem Heuristics (Q3964299) (← links)
- Inclusion complete tally languages and the Hartmanis-Berman conjecture (Q4140380) (← links)
- The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)
- A practical method for design of hybrid-type production facilities (Q4230113) (← links)
- An improved tabu search heuristic for solving facility layout design problems (Q4230253) (← links)
- On the Average Case Complexity of Some P-complete Problems (Q4256141) (← links)
- A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Methods for Binary Multidimensional Scaling (Q4542448) (← links)
- Exact Recovery with Symmetries for the Doubly Stochastic Relaxation (Q4554591) (← links)
- NP-completeness: A retrospective (Q4571936) (← links)
- Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
- An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance (Q4681153) (← links)
- Sales‐delivery man problems on treelike networks (Q4698228) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM (Q4923294) (← links)
- Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals (Q5024637) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Length-constrained cycle partition with an application to UAV routing* (Q5058406) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
- Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
