Skip to search formSkip to main contentSkip to account menu

Overlapping subproblems

Known as: Overlapping subproblem 
In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmComputer scienceLongest common subsequence problemMemoization

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Stochastic project management: multiple projects with multi-skilled human resources
This paper presents two stochastic optimization approaches for simultaneous project scheduling and personnel planning, extending… 
2015
2015
Decomposition-based evolutionary algorithm for large scale constrained problems
2014
2014
Modeling and tracking of crowded traffic scenes by using policy trees, occupancy grid blocks and Bayesian filters
In this paper we propose a new solution for representing and tracking crowded traffic environments by using dense stereo data… 
2013
2013
Optimizing Multi-Top-k Queries over Uncertain Data Streams
Query processing over uncertain data streams, in particular top-κ query processing, has become increasingly important due to its… 
2013
2013
THEORETICAL FOUNDATIONS AND EXPERIMENTAL RESULTS FOR A HIERARCHICAL CLASSIFIER WITH OVERLAPPING CLUSTERS
This paper proposes a classification framework based on simple classifiers organized in a tree‐like structure. It is observed… 
2010
2010
A DYNAMIC FEATURE SELECTION METHOD FOR DOCUMENT RANKING WITH RELEVANCE FEEDBACK APPROACH
Ranking search results is essential for information retrieval and Web search. Search engines need to not only return highly… 
2007
2007
Sparse Message Passing Algorithms for Weighted Maximum Satisfiability
Weighted maximum satisfiability is a wellstudied problem that has important applicability to artificial intelligence (for… 
Highly Cited
2004
Highly Cited
2004
Global Optimization Issues in Multiparametric Continuous and Mixed-Integer Optimization Problems
In this paper, a number of theoretical and algorithmic issues concerning the solution of parametric nonconvex programs are… 
Highly Cited
1998
Highly Cited
1998
Using Dynamic Programming and Overlapping Subproblems to Address Adjacency in Large Harvest Scheduling Problems
The adjacency problem for forest management scheduling is formulated as a dynamic programming problem. To overcome typical… 
Highly Cited
1995
Highly Cited
1995
Exploiting Problem Structure for Distributed Constraint Optimization
Distributed constraint optimization imposes considerable complexity in agents’ coordinated search for an optimal solution… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)