Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
From MaRDI portal
Recommendations
- Analytical Evaluation of Multi-Criteria Heuristics
- Probabilistic approach to assessment of heuristics in 0?1 linear programming
- Assessment of approximate algorithms: The error measure's crucial role
- scientific article; zbMATH DE number 2154265
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
Cited in
(27)- Toward a unified approach for the classification of NP-complete optimization problems
- Conditional clusters, musters, and probability
- Domination analysis of combinatorial optimization problems.
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
- Approximation algorithms for some vehicle routing problems
- On the differential approximation of MIN SET COVER
- Assessment of approximate algorithms: The error measure's crucial role
- Heuristic methods and applications: A categorized survey
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System
- Worst case analysis of nearest neighbour algorithms for the minimum weighted directed k-cycle problem
- Towards a theory of practice in metaheuristics design: A machine learning perspective
- Differential approximation of NP-hard problems with equal size feasible solutions
- A survey on the structure of approximation classes
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Fast heuristics and approximation algorithms
- The bipartite QUBO
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem
- Efficient heuristics for the weighted tardiness distributed permutation flowshop scheduling problem
- Meaningfulness of conclusions from combinatorial optimization
- Domination analysis for minimum multiprocessor scheduling
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
This page was built for publication: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325470)
