A new approach for sensitivity analysis in network flow problems

Aini, A; Eshghi, K; Salehipour, A

A new approach for sensitivity analysis in network flow problems

Aini, A Eshghi, K Salehipour, A

Permalink

Publisher:: Publishing Horizons
Publication Type:: Journal Article
Citation:: International Journal of Industrial Engineering, 2020, 27, (1), pp. 72-87
Issue Date:: 2020-01-01

Closed Access

	Filename	Description	Size
	ContentServer (1).pdf	Published version	419.72 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Aini, A
dc.contributor.author	Eshghi, K
dc.contributor.author	Salehipour, A
dc.date.accessioned	2021-02-17T01:39:00Z
dc.date.available	2021-02-17T01:39:00Z
dc.date.issued	2020-01-01
dc.identifier.citation	International Journal of Industrial Engineering, 2020, 27, (1), pp. 72-87
dc.identifier.issn	1072-4761
dc.identifier.issn	1943-670X
dc.identifier.uri	http://hdl.handle.net/10453/146166
dc.description.abstract	© International Journal of Industrial Engineering. This paper proposes a new approach to study the sensitivity analysis in the network flow problems, in particular, the minimum spanning tree and shortest path problems. In a sensitivity analysis, one looks for the amount of changes in the edges’ weights, number of edges or number of vertices such that the optimal solution, i.e., the minimum spanning tree or shortest path does not change. We introduce a novel approach, and develop associated equations and mathematics. We discuss two illustrative examples to show the applicability of the proposed approach.
dc.language	English
dc.publisher	Publishing Horizons
dc.relation	http://purl.org/au-research/grants/arc/DE170100234
dc.relation.ispartof	International Journal of Industrial Engineering
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.subject	0913 Mechanical Engineering
dc.subject.classification	Operations Research
dc.title	A new approach for sensitivity analysis in network flow problems
dc.type	Journal Article
utslib.citation.volume	27
utslib.for	0913 Mechanical Engineering
utslib.for	0913 Mechanical Engineering
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
pubs.consider-herdc	true
dc.date.updated	2021-02-17T01:38:55Z
pubs.issue	1
pubs.publication-status	Published
pubs.volume	27
utslib.citation.issue	1

Abstract:

© International Journal of Industrial Engineering. This paper proposes a new approach to study the sensitivity analysis in the network flow problems, in particular, the minimum spanning tree and shortest path problems. In a sensitivity analysis, one looks for the amount of changes in the edges’ weights, number of edges or number of vertices such that the optimal solution, i.e., the minimum spanning tree or shortest path does not change. We introduce a novel approach, and develop associated equations and mathematics. We discuss two illustrative examples to show the applicability of the proposed approach.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/146166