Measuring the Quality of Approximate Solutions to Zero-One Programming Problems

DOI10.1287/moor.6.3.319zbMath0538.90065OpenAlexW2086942674MaRDI QIDQ3325470

Eitan Zemel

Publication date: 1981

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.6.3.319

zbMATH Keywords

measure of solution qualitymeasuring the quality of an approximate (heuristic) solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (23)

Fast Heuristics and Approximation Algorithms ⋮ The Bipartite QUBO ⋮ Domination analysis for minimum multiprocessor scheduling ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ Toward a unified approach for the classification of NP-complete optimization problems ⋮ Domination analysis of combinatorial optimization problems. ⋮ Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System ⋮ Unnamed Item ⋮ A survey on the structure of approximation classes ⋮ Conditional clusters, musters, and probability ⋮ Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES ⋮ Approximation algorithms for some vehicle routing problems ⋮ On the differential approximation of MIN SET COVER ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) ⋮ Meaningfulness of conclusions from combinatorial optimization ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ Heuristic methods and applications: A categorized survey ⋮ Towards a theory of practice in metaheuristics design: A machine learning perspective ⋮ Differential approximation results for the traveling salesman problem with distances 1 and 2

This page was built for publication: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems