Exact Algorithms for Generalized Combinatorial Optimization Problems
From MaRDI portal
Recommendations
Cited in
(13)- Optimization of dynamic programming methods when solving extremal combinatorial problems
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Solvable cases of a new combinatorial problem of optimization
- Algorithms and complexity for a class of combinatorial optimization problems with labelling
- A portable and scalable algorithm for a class of constrained combinatorial optimization problems
- Combinatorial Algorithms for the Generalized Circulation Problem
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
- scientific article; zbMATH DE number 1953193 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 2079850 (Why is no real title available?)
- Exact exponential algorithms.
- Generalized algorithm for summing the enumerators of suboptimal solutions
This page was built for publication: Exact Algorithms for Generalized Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611967)