The following pages link to P-Complete Approximation Problems (Q4119042):
Displaying 34 items.
- APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (Q5168426) (← links)
- (Q5228569) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- Local Search Algorithms for the Maximal Planar Layout Problem (Q5689972) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- The zone-based dynamic facility layout problem (Q5884346) (← links)
- An efficient algorithm for unequal area facilities layout planning with input and output points (Q5884349) (← links)
- On the landscape ruggedness of the quadratic assignment problem (Q5941510) (← links)
- Cardinality of relations and relational approximation algorithms (Q5963086) (← links)
- Better Process Mapping and Sparse Quadratic Assignment (Q6039926) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems (Q6080646) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Partial neighborhood local searches (Q6082175) (← links)
- Plowing with precedence in polynomial time (Q6092637) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem (Q6115413) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
- Two remarks on the optimum arborescence problem (Q6155599) (← links)
- An optimization approach for hybrid workflows in platform-enabled private service marketplaces (Q6168510) (← links)
- Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
- Recognising permuted Demidenko matrices (Q6556164) (← links)
- Max cut and semidefinite rank (Q6564284) (← links)
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)
- Finite element approximation of data-driven problems in conductivity (Q6622728) (← links)
- Greedy heuristic guided by lexicographic excellence (Q6635980) (← links)
- A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062) (← links)
- Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)
