2014
DOI: 10.5901/mjss.2014.v5n2p261
|View full text |Cite
|
Sign up to set email alerts
|

Urbanization, Environment and Homelessness in the Developing world: The Sustainable Housing Development.

Abstract: The problem of homelessness has been necessitated by several factors, including persistent population increases, inadequate housing, and uncontrolled urban growth pattern resulting in "homelessness" among the vast majority of urban dwellers. The need to ensure decent and affordable shelter to the people, particularly the urban poor, is therefore central to the achievement and improvement of both human living standards and societal development (Jiboye, 2011

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
11
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 9 publications
1
11
0
Order By: Relevance
“…Therefore, it is preferable to match that individual with a housing provider which carries the lowest weight before that housing provider is at full capacity. Consider the following scenario, H = {h 1 , h 2 }, S = {s 1 , s 2 }, C = {1, 1}, and W = { [2,10], [3,4]}. In this case, individual h 1 has a higher weight disparity comparing to individual h 2 , and the capacity constraint creates a consequential decision, so that, if h 2 is assigned to s 1 , then, h 1 must be assigned to s 2 , which is the non-optimal solution.…”
Section: A Greedy Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…Therefore, it is preferable to match that individual with a housing provider which carries the lowest weight before that housing provider is at full capacity. Consider the following scenario, H = {h 1 , h 2 }, S = {s 1 , s 2 }, C = {1, 1}, and W = { [2,10], [3,4]}. In this case, individual h 1 has a higher weight disparity comparing to individual h 2 , and the capacity constraint creates a consequential decision, so that, if h 2 is assigned to s 1 , then, h 1 must be assigned to s 2 , which is the non-optimal solution.…”
Section: A Greedy Methodsmentioning
confidence: 99%
“…Makespan is the maximum load on any machine in set M, and the scheduling problem by finding the assignment with minimum makespan is an NP-hard problem. 2 Similar to makespan, we are interested in an assignment solution where every homeless individual is offered a housing provider with minimum weight based on a set of constraints. Because of this similarity, we will summarize relevant makespan research in this section.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations