A problem reduction based approach to discrete optimization algorithm design
type: Item
instance of: scholarly article
title: A problem reduction based approach to discrete optimization algorithm design
zbMATH Open document ID: 1192.68437
published in: Computing
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5718450
zbMATH Keywords: discrete optimization
zbMATH Keywords: program calculation
zbMATH Keywords: problem reduction graph
zbMATH Keywords: algorithm design
author: Yu-Jun Zheng
author: Jinyun Xue
MaRDI profile type: Publication
full work available at URL: s00607-010-0085-0
OpenAlex ID: W2042738557
cites work: Nondeterminism within $P^ * $
cites work: Vertex cover: Further observations and further improvements
cites work: Polynomial time approximation schemes and parameterized complexity
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Q4263467
cites work: Q3839050
cites work: A general model for matroids and the greedy algorithm
cites work: An exercise in transformational programming: Backtracking and Branch-and- Bound
cites work: Q3292914
cites work: Q3925859
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: A new polynomial-time algorithm for linear programming
cites work: A new fully polynomial time approximation scheme for the Knapsack problem
cites work: Framework of algorithm correctness in NDADAS
cites work: Approximate Local Search in Combinatorial Optimization
cites work: Dynamic programming revisited: Improving knapsack algorithms
cites work: Algorithm theories and design tactics
cites work: Designware: Software development by refinement
cites work: Toward an Automatic Approach to Greedy Algorithms
cites work: A simple greedy algorithm for a class of shuttle transportation problems
DOI: 10.1007/S00607-010-0085-0
description: scientific article; zbMATH DE number 5718450