Pages that link to "Item:Q3325470"

The following pages link to Measuring the Quality of Approximate Solutions to Zero-One Programming Problems (Q3325470):

Displaying 25 items.

• A survey on the structure of approximation classes (Q458503) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• Meaningfulness of conclusions from combinatorial optimization (Q750310) (← links)
• Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
• Conditional clusters, musters, and probability (Q1169778) (← links)
• Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
• Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
• On the differential approximation of MIN SET COVER (Q1770405) (← links)
• Assessment of approximate algorithms: The error measure's crucial role (Q1820671) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System (Q2971639) (← links)
• (Q3385394) (← links)
• Towards a theory of practice in metaheuristics design: A machine learning perspective (Q3431446) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
• Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)