A problem reduction based approach to discrete optimization algorithm design

DOI10.1007/S00607-010-0085-0zbMATH Open1192.68437OpenAlexW2042738557MaRDI QIDQ975314FDOQ975314

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

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

zbMATH Keywords

discrete optimizationalgorithm designproblem reduction graphprogram calculation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

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

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)