An Incremental Model for Combinatorial Maximization Problems
From MaRDI portal
Recommendations
- Approximating incremental combinatorial optimization problems
- An incremental algorithm for the maximum flow problem
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A unified modeling and solution framework for combinatorial optimization problems
- An incremental negamax algorithm
- Incremental problems in the parameterized complexity setting
- Incremental algorithms for optimizing model computation based on partial instantiation
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- Optimization of dynamic programming methods when solving extremal combinatorial problems
- An addendum on the incremental assignment problem
Cited in
(13)- Incremental network optimization: theory and algorithms
- General bounds for incremental maximization
- The online knapsack problem with incremental capacity
- Clairvoyant mechanisms for online auctions
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- Approximating the 3-period incremental knapsack problem
- Packing a knapsack of unknown capacity
- Approximation schemes for multiperiod binary knapsack problems
- On approximating the incremental knapsack problem
- scientific article; zbMATH DE number 3867142 (Why is no real title available?)
- Approximating incremental combinatorial optimization problems
- Comparison of the genetic algorithm and incremental optimisation routines for a Bayesian inverse modelling based network design
- General bounds for incremental maximization
This page was built for publication: An Incremental Model for Combinatorial Maximization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307529)
