Skip to search formSkip to main contentSkip to account menu

Constructive heuristic

A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly, extends the current solution until a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The high school timetabling problem has been frequently considered in the literature, but few studies employing parallel… 
2017
2017
The management of complex network services requires flexible and efficient service provisioning as well as optimized handling of… 
Review
2015
Review
2015
The Vertex Separation Problem (VSP) is an NP-hard combinatorial optimization problem in the context of graph theory. Particularly… 
Review
2015
Review
2015
The objective of the present study is considering the relationship between EQ & constructive and non-constructive problem solving… 
2011
2011
This paper presents a genetic algorithm for the multi-mode resource-constrained project scheduling problem (MRCPSP), in which… 
2007
2007
Examination timetabling has been a widely studied research problem for over 30 years, with many techniques being used to produce… 
2006
2006
This paper proposes the use of genetic algorithms and parallel computing to solve a real heterogeneous fleet vehicle routing… 
2005
2005
Este trabalho apresenta algumas propostas para solucionar o problema de planejamento da expansao de sistemas de transmissao… 
2005
2005
In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of… 
2003
2003
We consider the design of fuzzy constructive heuristic algorithms for solving combinatorial problems. The fuzzy technology is…