A problem reduction based approach to discrete optimization algorithm design

DOI10.1007/S00607-010-0085-0MaRDI QIDQ975314zbMATH OpenOpenAlexFDO

Authors Yu-Jun Zheng, Jinyun Xue

Publication date 9 June 2010

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-010-0085-0

zbMATH Keywords

discrete optimizationalgorithm designproblem reduction graphprogram calculation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Combinatorial optimization problem reduction and algorithm derivation
• Design Is as Easy as Optimization
• Algorithm design through the optimization of reuse-based generation
• scientific article; zbMATH DE number 1552036
• Problems of discrete optimization: challenges and main approaches to solve them

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1189277 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 1341905 (Why is no real title available?)
• A general model for matroids and the greedy algorithm
• A new fully polynomial time approximation scheme for the Knapsack problem
• A new polynomial-time algorithm for linear programming
• A simple greedy algorithm for a class of shuttle transportation problems
• Algorithm theories and design tactics
• An exercise in transformational programming: Backtracking and Branch-and- Bound
• Approximate Local Search in Combinatorial Optimization
• Designware: Software development by refinement
• Dynamic programming revisited: Improving knapsack algorithms
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Framework of algorithm correctness in NDADAS
• Nondeterminism within $P^ * $
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Polynomial time approximation schemes and parameterized complexity
• Toward an Automatic Approach to Greedy Algorithms
• Vertex cover: Further observations and further improvements

Cited in

(6)

• Algorithm design through the optimization of reuse-based generation
• Algorithms for solving a separable problem of discrete optimization
• Design Is as Easy as Optimization
• APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
• Combinatorial optimization problem reduction and algorithm derivation
• An algebraic approach to population-based evolutionary algorithm generation

This page was built for publication: A problem reduction based approach to discrete optimization algorithm design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975314)